Nuprl Lemma : fix-of-id
fix((λx.x)) ~ ⊥
Proof
Definitions occuring in Statement :
bottom: ⊥,
fix: fix(F),
lambda: λx.A[x],
sqequal: s ~ t
Definitions unfolded in proof :
all: ∀x:A. B[x],
member: t ∈ T,
uall: ∀[x:A]. B[x],
uimplies: b supposing a
Lemmas referenced :
is-strict-fun,
fix_strict_diverge
Rules used in proof :
cut,
lemma_by_obid,
sqequalHypSubstitution,
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
dependent_functionElimination,
thin,
isectElimination,
baseClosed,
independent_isectElimination,
sqequalRule,
hypothesis
Latex:
fix((\mlambda{}x.x)) \msim{} \mbot{}
Date html generated:
2016_05_15-PM-10_04_54
Last ObjectModification:
2016_01_16-AM-08_28_13
Theory : bar!type
Home
Index