Nuprl Lemma : strictness-isinl
∀[a,b:Top]. (if ⊥ is inl then a else b ~ ⊥)
Proof
Definitions occuring in Statement :
bottom: ⊥,
uall: ∀[x:A]. B[x],
top: Top,
isinl: isinl def,
sqequal: s ~ t
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
has-value: (a)↓,
not: ¬A,
implies: P ⇒ Q,
false: False,
top: Top
Lemmas referenced :
top_wf,
bottom-sqle,
is-exception_wf,
has-value_wf_base,
exception-not-bottom,
bottom_diverge
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
introduction,
cut,
sqequalSqle,
sqleRule,
thin,
divergentSqle,
callbyvalueIsinl,
sqequalHypSubstitution,
hypothesis,
lemma_by_obid,
independent_functionElimination,
voidElimination,
isinlExceptionCases,
axiomSqleEquality,
baseClosed,
isectElimination,
sqequalRule,
baseApply,
closedConclusion,
hypothesisEquality,
sqleReflexivity,
isect_memberEquality,
voidEquality,
sqequalAxiom,
because_Cache
Latex:
\mforall{}[a,b:Top]. (if \mbot{} is inl then a else b \msim{} \mbot{})
Date html generated:
2016_05_13-PM-03_43_49
Last ObjectModification:
2016_01_14-PM-07_07_32
Theory : computation
Home
Index