Nuprl Lemma : decide-axiom-if-has-value
∀t:Base. ((t)↓ ⇒ Dec(t ~ Ax))
Proof
Definitions occuring in Statement :
has-value: (a)↓,
decidable: Dec(P),
all: ∀x:A. B[x],
implies: P ⇒ Q,
base: Base,
sqequal: s ~ t,
axiom: Ax
Definitions unfolded in proof :
all: ∀x:A. B[x],
implies: P ⇒ Q,
member: t ∈ T,
has-value: (a)↓,
uall: ∀[x:A]. B[x],
decidable: Dec(P),
or: P ∨ Q,
prop: ℙ,
top: Top,
not: ¬A,
false: False
Lemmas referenced :
base_wf,
not_zero_sqequal_one,
top_wf,
not_wf,
is-exception_wf,
has-value_wf_base
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
lambdaFormation,
introduction,
isaxiomCases,
divergentSqle,
hypothesis,
cut,
lemma_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
baseClosed,
hypothesisEquality,
sqequalRule,
inlEquality,
sqequalAxiom,
sqequalIntensionalEquality,
isect_memberFormation,
isect_memberEquality,
because_Cache,
voidElimination,
voidEquality,
inrEquality,
lambdaEquality,
independent_functionElimination
Latex:
\mforall{}t:Base. ((t)\mdownarrow{} {}\mRightarrow{} Dec(t \msim{} Ax))
Date html generated:
2016_05_13-PM-03_22_13
Last ObjectModification:
2016_01_14-PM-06_47_08
Theory : call!by!value_1
Home
Index