Nuprl Lemma : apply-bottom
∀[t:Top]. (⊥ t ~ ⊥)
Proof
Definitions occuring in Statement :
bottom: ⊥,
uall: ∀[x:A]. B[x],
top: Top,
apply: f a,
sqequal: s ~ t
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
top: Top
Lemmas referenced :
strictness-apply,
top_wf
Rules used in proof :
sqequalSubstitution,
sqequalRule,
sqequalReflexivity,
cut,
lemma_by_obid,
sqequalHypSubstitution,
sqequalTransitivity,
computationStep,
isectElimination,
thin,
isect_memberEquality,
voidElimination,
voidEquality,
hypothesis,
isect_memberFormation,
introduction,
sqequalAxiom
Latex:
\mforall{}[t:Top]. (\mbot{} t \msim{} \mbot{})
Date html generated:
2016_05_15-PM-10_04_24
Last ObjectModification:
2015_12_27-PM-05_16_48
Theory : bar!type
Home
Index