Nuprl Lemma : lifting-add-spread-1
∀[a,b,C:Top]. (let x,y = b in C[x;y] + a ~ let x,y = b in C[x;y] + a)
Proof
Definitions occuring in Statement :
uall: ∀[x:A]. B[x],
top: Top,
so_apply: x[s1;s2],
spread: spread def,
add: n + m,
sqequal: s ~ 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: b supposing a,
strict4: strict4(F),
and: P ∧ Q,
all: ∀x:A. B[x],
implies: P ⇒ Q,
has-value: (a)↓,
prop: ℙ,
guard: {T},
or: P ∨ Q,
squash: ↓T,
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2]
Lemmas referenced :
top_wf,
is-exception_wf,
base_wf,
has-value_wf_base,
int-value-type,
value-type-has-value,
lifting-strict-spread
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,
callbyvalueAdd,
hypothesis,
baseApply,
closedConclusion,
hypothesisEquality,
productElimination,
because_Cache,
equalityTransitivity,
equalitySymmetry,
addExceptionCases,
exceptionSqequal,
inrFormation,
intEquality,
imageMemberEquality,
imageElimination,
inlFormation,
sqequalAxiom
Latex:
\mforall{}[a,b,C:Top]. (let x,y = b in C[x;y] + a \msim{} let x,y = b in C[x;y] + a)
Date html generated:
2016_05_13-PM-03_43_08
Last ObjectModification:
2016_01_14-PM-07_07_57
Theory : computation
Home
Index