Nuprl Lemma : bottom-sqequal-fix-id
⊥ ~ fix((λx.x))
Proof
Definitions occuring in Statement :
bottom: ⊥,
fix: fix(F),
lambda: λx.A[x],
sqequal: s ~ t
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
top: Top,
bottom: ⊥
Lemmas referenced :
is-exception_wf,
has-value_wf_base,
bottom-sqle
Rules used in proof :
sqequalSqle,
cut,
lemma_by_obid,
sqequalHypSubstitution,
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isectElimination,
thin,
isect_memberEquality,
voidElimination,
voidEquality,
hypothesis,
divergentSqle,
sqequalRule,
sqleRule,
sqleReflexivity,
baseClosed
Latex:
\mbot{} \msim{} fix((\mlambda{}x.x))
Date html generated:
2016_05_15-PM-02_07_14
Last ObjectModification:
2016_01_15-PM-10_24_03
Theory : untyped!computation
Home
Index