Nuprl Lemma : minimal-not-not-excluded-middle
∀[A,P:ℙ]. (((P ∨ (P ⇒ A)) ⇒ A) ⇒ A)
Proof
Definitions occuring in Statement :
uall: ∀[x:A]. B[x],
prop: ℙ,
implies: P ⇒ Q,
or: P ∨ Q
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
implies: P ⇒ Q,
guard: {T},
or: P ∨ Q,
member: t ∈ T,
prop: ℙ
Lemmas referenced :
or_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
lambdaFormation,
cut,
hypothesis,
addLevel,
sqequalHypSubstitution,
independent_functionElimination,
thin,
sqequalRule,
inrFormation,
inlFormation,
functionEquality,
hypothesisEquality,
because_Cache,
levelHypothesis,
lemma_by_obid,
isectElimination,
universeEquality
Latex:
\mforall{}[A,P:\mBbbP{}]. (((P \mvee{} (P {}\mRightarrow{} A)) {}\mRightarrow{} A) {}\mRightarrow{} A)
Date html generated:
2016_05_13-PM-03_46_03
Last ObjectModification:
2015_12_26-AM-09_58_43
Theory : call!by!value_2
Home
Index