Nuprl Lemma : curry-lemma-program
∀A,B,C:ℙ. (((A ∧ B) ⇒ C) ⇒ A ⇒ B ⇒ C)
Proof
Definitions occuring in Statement :
prop: ℙ,
all: ∀x:A. B[x],
implies: P ⇒ Q,
and: P ∧ Q
Definitions unfolded in proof :
member: t ∈ T,
curry-lemma
Lemmas referenced :
curry-lemma
Rules used in proof :
introduction,
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
cut,
instantiate,
extract_by_obid,
hypothesis,
sqequalRule,
thin,
sqequalHypSubstitution,
equalityTransitivity,
equalitySymmetry
Latex:
\mforall{}A,B,C:\mBbbP{}. (((A \mwedge{} B) {}\mRightarrow{} C) {}\mRightarrow{} A {}\mRightarrow{} B {}\mRightarrow{} C)
Date html generated:
2018_05_21-PM-00_00_33
Last ObjectModification:
2018_05_19-AM-07_14_18
Theory : core_2
Home
Index