Nuprl Lemma : xmiddle-elim
∀[P,Q:ℙ]. (((P ∨ (¬P)) ⇒ (¬Q)) ⇒ (¬Q))
Proof
Definitions occuring in Statement :
uall: ∀[x:A]. B[x],
prop: ℙ,
not: ¬A,
implies: P ⇒ Q,
or: P ∨ Q
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
not: ¬A,
implies: P ⇒ Q,
or: P ∨ Q,
prop: ℙ
Lemmas referenced :
false_wf,
or_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
introduction,
lambdaEquality,
applyEquality,
hypothesisEquality,
inrEquality,
inlEquality,
functionEquality,
sqequalHypSubstitution,
sqequalRule,
cut,
lemma_by_obid,
hypothesis,
isectElimination,
thin,
universeEquality
Latex:
\mforall{}[P,Q:\mBbbP{}]. (((P \mvee{} (\mneg{}P)) {}\mRightarrow{} (\mneg{}Q)) {}\mRightarrow{} (\mneg{}Q))
Date html generated:
2016_05_15-PM-07_19_13
Last ObjectModification:
2015_12_27-AM-11_27_57
Theory : general
Home
Index