Nuprl Lemma : callbyvalueall-nil2
∀[F:Top]. (let x ⟵ [] in F ~ F)
Proof
Definitions occuring in Statement :
nil: [],
callbyvalueall: callbyvalueall,
uall: ∀[x:A]. B[x],
top: Top,
sqequal: s ~ t
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
so_lambda: λ2x.t[x],
top: Top,
so_apply: x[s]
Lemmas referenced :
callbyvalueall-nil,
top_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
introduction,
cut,
extract_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
sqequalRule,
isect_memberEquality,
voidElimination,
voidEquality,
hypothesis,
sqequalAxiom
Latex:
\mforall{}[F:Top]. (let x \mleftarrow{}{} [] in F \msim{} F)
Date html generated:
2018_05_21-PM-06_21_34
Last ObjectModification:
2018_05_19-PM-05_27_37
Theory : untyped!computation
Home
Index