Nuprl Lemma : lifting-apply-decide

[a,b,F,G:Top].  (case of inl(x) => F[x] inr(x) => G[x] case of inl(x) => F[x] inr(x) => G[x] b)


Definitions occuring in Statement :  uall: [x:A]. B[x] top: Top so_apply: x[s] apply: a decide: case of inl(x) => s[x] inr(y) => t[y] sqequal: t
Definitions unfolded in proof :  uall: [x:A]. B[x] member: t ∈ T so_lambda: so_lambda(x,y,z,w.t[x; y; z; w]) so_apply: x[s1;s2;s3;s4] top: Top uimplies: supposing a strict4: strict4(F) and: P ∧ Q all: x:A. B[x] implies:  Q has-value: (a)↓ prop: guard: {T} or: P ∨ Q squash: T so_lambda: λ2x.t[x] so_apply: x[s]
Lemmas referenced :  top_wf is-exception_wf base_wf has-value_wf_base lifting-strict-decide
Rules used in proof :  sqequalSubstitution sqequalTransitivity computationStep sqequalReflexivity isect_memberFormation introduction cut sqequalRule lemma_by_obid sqequalHypSubstitution isectElimination thin baseClosed isect_memberEquality voidElimination voidEquality independent_isectElimination independent_pairFormation lambdaFormation callbyvalueApply hypothesis baseApply closedConclusion hypothesisEquality applyExceptionCases inrFormation imageMemberEquality imageElimination exceptionSqequal inlFormation sqequalAxiom because_Cache

    (case  a  of  inl(x)  =>  F[x]  |  inr(x)  =>  G[x]  b  \msim{}  case  a  of  inl(x)  =>  F[x]  b  |  inr(x)  =>  G[x]  b)

Date html generated: 2016_05_13-PM-03_42_58
Last ObjectModification: 2016_01_14-PM-07_08_02

Theory : computation

Home Index