Nuprl Lemma : strictness-minus
-⊥ ~ ⊥
Proof
Definitions occuring in Statement :
bottom: ⊥,
minus: -n,
sqequal: s ~ t
Definitions unfolded in proof :
has-value: (a)↓,
member: t ∈ T,
all: ∀x:A. B[x],
implies: P ⇒ Q,
uall: ∀[x:A]. B[x],
uimplies: b supposing a,
prop: ℙ,
not: ¬A,
false: False,
top: Top
Lemmas referenced :
value-type-has-value,
int-value-type,
equal_wf,
bottom_diverge,
exception-not-bottom,
has-value_wf_base,
is-exception_wf,
bottom-sqle
Rules used in proof :
sqequalSqle,
cut,
divergentSqle,
callbyvalueMinus,
sqequalHypSubstitution,
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
hypothesis,
thin,
baseClosed,
equalityTransitivity,
equalitySymmetry,
intEquality,
lambdaFormation,
introduction,
extract_by_obid,
isectElimination,
independent_isectElimination,
hypothesisEquality,
dependent_functionElimination,
independent_functionElimination,
voidElimination,
minusExceptionCases,
axiomSqleEquality,
isect_memberEquality,
voidEquality
Latex:
-\mbot{} \msim{} \mbot{}
Date html generated:
2017_04_14-AM-07_21_46
Last ObjectModification:
2017_02_27-PM-02_55_01
Theory : computation
Home
Index