Nuprl Lemma : strictness-fix
fix(⊥) ~ ⊥
Proof
Definitions occuring in Statement :
bottom: ⊥,
fix: fix(F),
sqequal: s ~ t
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
top: Top
Lemmas referenced :
strictness-apply
Rules used in proof :
sqequalSubstitution,
sqequalRule,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
cut,
lemma_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
isect_memberEquality,
voidElimination,
voidEquality,
hypothesis
Latex:
fix(\mbot{}) \msim{} \mbot{}
Date html generated:
2016_05_13-PM-03_43_43
Last ObjectModification:
2015_12_26-AM-09_52_22
Theory : computation
Home
Index