Nuprl Lemma : lift-test2
∀[r,g,a:Top]. (let a,b = let a,b = r in <g, a> in a + b ~ let a,b = r in let g,u = <g, a> in g + u)
Proof
Definitions occuring in Statement :
uall: ∀[x:A]. B[x],
top: Top,
spread: spread def,
pair: <a, b>,
add: n + m,
sqequal: s ~ t
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
top: Top,
so_lambda: so_lambda(x,y,z,w.t[x; y; z; w]),
member: t ∈ T,
so_apply: x[s1;s2;s3;s4],
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2],
uimplies: b supposing a
Lemmas referenced :
strict4-spread,
lifting-strict-spread
Rules used in proof :
sqequalSubstitution,
sqequalRule,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
cut,
lemma_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
baseClosed,
isect_memberEquality,
voidElimination,
voidEquality,
independent_isectElimination,
hypothesis,
isect_memberFormation,
introduction,
sqequalAxiom,
isectEquality,
hypothesisEquality,
because_Cache
Latex:
\mforall{}[r,g,a:Top]. (let a,b = let a,b = r in <g, a> in a + b \msim{} let a,b = r in let g,u = <g, a> in g + u)
Date html generated:
2016_05_15-PM-06_34_43
Last ObjectModification:
2016_01_16-AM-09_54_11
Theory : general
Home
Index