Nuprl Lemma : exception-not-value
∀[t:Base]. is-exception(t) ⇒ False supposing (t)↓
Proof
Definitions occuring in Statement :
has-value: (a)↓,
is-exception: is-exception(t),
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
implies: P ⇒ Q,
false: False,
base: Base
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
implies: P ⇒ Q,
false: False,
is-exception: is-exception(t),
prop: ℙ
Lemmas referenced :
exception-not-value_1,
base_wf,
has-value_wf_base,
is-exception_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
introduction,
cut,
lambdaFormation,
sqequalHypSubstitution,
hypothesis,
lemma_by_obid,
isectElimination,
thin,
hypothesisEquality,
sqequalRule,
lambdaEquality,
dependent_functionElimination,
because_Cache,
isect_memberEquality,
voidElimination,
equalityTransitivity,
equalitySymmetry,
baseClosed,
independent_isectElimination,
independent_functionElimination
Latex:
\mforall{}[t:Base]. is-exception(t) {}\mRightarrow{} False supposing (t)\mdownarrow{}
Date html generated:
2016_05_13-PM-03_23_24
Last ObjectModification:
2016_01_14-PM-06_46_01
Theory : call!by!value_1
Home
Index