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