Nuprl Lemma : test-evd1'
∀[A,B,C,D,E:ℙ]. ((((A ∧ B) ⇒ (A ∧ B)) ⇒ (C ∨ D)) ⇒ (C ⇒ E) ⇒ (D ⇒ E) ⇒ E)
Proof
Definitions occuring in Statement :
uall: ∀[x:A]. B[x],
prop: ℙ,
implies: P ⇒ Q,
or: P ∨ Q,
and: P ∧ Q
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
implies: P ⇒ Q,
member: t ∈ T,
prop: ℙ,
or: P ∨ Q
Lemmas referenced :
and_wf,
or_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
lambdaFormation,
rename,
sqequalHypSubstitution,
independent_functionElimination,
hypothesis,
cut,
lemma_by_obid,
isectElimination,
thin,
hypothesisEquality,
unionElimination,
functionEquality,
because_Cache,
universeEquality
Latex:
\mforall{}[A,B,C,D,E:\mBbbP{}]. ((((A \mwedge{} B) {}\mRightarrow{} (A \mwedge{} B)) {}\mRightarrow{} (C \mvee{} D)) {}\mRightarrow{} (C {}\mRightarrow{} E) {}\mRightarrow{} (D {}\mRightarrow{} E) {}\mRightarrow{} E)
Date html generated:
2016_05_15-PM-03_18_48
Last ObjectModification:
2015_12_27-PM-01_03_18
Theory : general
Home
Index