---

Step * of Lemma curry-lemma-program

∀A,B,C:ℙ.  (((A ∧ B) ⇒ C) ⇒ A ⇒ B ⇒ C)
BY
{ Extract of Obid: curry-lemma
  normalizes to:
  
  λA,B,C,F,a,b. (F <a, b>)
  finishing with Auto }

---

Latex:

---

Latex:
\mforall{}A,B,C:\mBbbP{}.    (((A  \mwedge{}  B)  {}\mRightarrow{}  C)  {}\mRightarrow{}  A  {}\mRightarrow{}  B  {}\mRightarrow{}  C)


By

---

Latex:
Extract  of  Obid:  curry-lemma
normalizes  to:

\mlambda{}A,B,C,F,a,b.  (F  <a,  b>)
finishing  with  Auto

---

Home Index