Nuprl Lemma : example
∀[P,A:ℙ]. (((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 :
or: P ∨ Q,
guard: {T},
prop: ℙ,
member: t ∈ T,
implies: P ⇒ Q,
uall: ∀[x:A]. B[x]
Lemmas referenced :
or_wf
Rules used in proof :
inlFormation,
inrFormation,
sqequalRule,
independent_functionElimination,
universeEquality,
hypothesis,
hypothesisEquality,
thin,
isectElimination,
sqequalHypSubstitution,
extract_by_obid,
introduction,
cut,
functionEquality,
lambdaFormation,
isect_memberFormation,
sqequalReflexivity,
computationStep,
sqequalTransitivity,
sqequalSubstitution
Latex:
\mforall{}[P,A:\mBbbP{}]. (((P \mvee{} (P {}\mRightarrow{} A)) {}\mRightarrow{} A) {}\mRightarrow{} A)
Date html generated:
2017_09_29-PM-05_46_53
Last ObjectModification:
2017_09_24-AM-11_23_13
Theory : core_2
Home
Index