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