Nuprl Lemma : not-btrue-sqeq-bottom
¬(tt ~ ⊥)
Proof
Definitions occuring in Statement :
bottom: ⊥,
btrue: tt,
not: ¬A,
sqequal: s ~ t
Definitions unfolded in proof :
not: ¬A,
implies: P ⇒ Q,
member: t ∈ T,
all: ∀x:A. B[x],
and: P ∧ Q,
false: False
Lemmas referenced :
not-btrue-sqle-bottom,
sqequalIffSqle
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
lambdaFormation,
sqequalIntensionalEquality,
baseClosed,
cut,
lemma_by_obid,
sqequalHypSubstitution,
dependent_functionElimination,
thin,
independent_functionElimination,
hypothesis,
productElimination,
voidElimination
Latex:
\mneg{}(tt \msim{} \mbot{})
Date html generated:
2016_05_15-PM-10_04_12
Last ObjectModification:
2016_01_16-AM-08_28_15
Theory : bar!type
Home
Index