Nuprl Lemma : not-btrue-sqle-bottom
¬(tt ≤ ⊥)
Proof
Definitions occuring in Statement :
bottom: ⊥,
btrue: tt,
not: ¬A,
sqle: s ≤ t
Definitions unfolded in proof :
prop: ℙ,
uall: ∀[x:A]. B[x],
member: t ∈ T,
implies: P ⇒ Q,
not: ¬A,
top: Top,
bool: 𝔹,
uimplies: b supposing a,
false: False
Lemmas referenced :
bottom-sqle,
istype-void,
bottom_diverge,
value-type-has-value,
bool_wf,
union-value-type,
unit_wf2,
btrue_wf,
sqle_wf_base
Rules used in proof :
hypothesis,
baseClosed,
thin,
isectElimination,
sqequalHypSubstitution,
lemma_by_obid,
cut,
lambdaFormation,
sqequalReflexivity,
computationStep,
sqequalTransitivity,
sqequalSubstitution,
sqequalSqle,
introduction,
extract_by_obid,
Error :isect_memberEquality_alt,
voidElimination,
because_Cache,
sqequalRule,
independent_isectElimination,
independent_functionElimination
Latex:
\mneg{}(tt \mleq{} \mbot{})
Date html generated:
2019_06_20-AM-11_27_21
Last ObjectModification:
2018_10_16-PM-04_33_30
Theory : call!by!value_2
Home
Index