Nuprl Lemma : minimal-not-not-implies-from-program
∀[P,A:ℙ]. (((((P ⇒ A) ⇒ A) ⇒ (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 :
member: t ∈ T,
uall: ∀[x:A]. B[x],
prop: ℙ,
implies: P ⇒ Q,
or: P ∨ Q
Lemmas referenced :
or_wf
Rules used in proof :
introduction,
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
sqequalRule,
isect_memberEquality,
universeEquality,
lambdaEquality,
functionEquality,
sqequalHypSubstitution,
cumulativity,
hypothesisEquality,
cut,
extract_by_obid,
isectElimination,
thin,
hypothesis,
applyEquality,
inrEquality,
inlEquality
Latex:
\mforall{}[P,A:\mBbbP{}]. (((((P {}\mRightarrow{} A) {}\mRightarrow{} A) {}\mRightarrow{} (P \mvee{} A)) {}\mRightarrow{} A) {}\mRightarrow{} A)
Date html generated:
2018_07_25-PM-01_27_14
Last ObjectModification:
2018_05_24-PM-05_57_47
Theory : core_2
Home
Index