---

Step * of Lemma not-not-p-or-not-p-prgram

∀P,A:ℙ.  (((P ∨ (P ⇒ A)) ⇒ A) ⇒ A)
BY
{ Extract of Obid: not-not-p-or-not-p
  normalizes to:
  
  λP,A,F. (F (inr (λp.(F (inl p))) ))
  finishing with Auto }

---

Latex:

---

Latex:
\mforall{}P,A:\mBbbP{}.    (((P  \mvee{}  (P  {}\mRightarrow{}  A))  {}\mRightarrow{}  A)  {}\mRightarrow{}  A)


By

---

Latex:
Extract  of  Obid:  not-not-p-or-not-p
normalizes  to:

\mlambda{}P,A,F.  (F  (inr  (\mlambda{}p.(F  (inl  p)))  ))
finishing  with  Auto

---

Home Index