Nuprl Lemma : strictness-callbyvalueall
∀[F:Top]. (let x ⟵ ⊥ in F[x] ~ ⊥)
Proof
Definitions occuring in Statement :
bottom: ⊥,
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),
so_lambda: λ2x.t[x],
top: Top,
so_apply: x[s]
Lemmas referenced :
strictness-callbyvalue,
top_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
introduction,
cut,
sqequalRule,
lemma_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
isect_memberEquality,
voidElimination,
voidEquality,
hypothesis,
sqequalAxiom
Latex:
\mforall{}[F:Top]. (let x \mleftarrow{}{} \mbot{} in F[x] \msim{} \mbot{})
Date html generated:
2016_05_13-PM-03_43_35
Last ObjectModification:
2015_12_26-AM-09_52_20
Theory : computation
Home
Index