---

Step * 1 of Lemma uniform-comp-nat-induction-TYPE-tac


1. [P] : ℕ ⟶ TYPE
2. ∀[n:ℕ]. ((∀[m:ℕn]. P[m]) ⇒ P[n])
⊢ ∀[n:ℕ]. P[n]
BY
{ ProveUniformCompNatInd }

---

Latex:

---

Latex:

1.  [P]  :  \mBbbN{}  {}\mrightarrow{}  TYPE
2.  \mforall{}[n:\mBbbN{}].  ((\mforall{}[m:\mBbbN{}n].  P[m])  {}\mRightarrow{}  P[n])
\mvdash{}  \mforall{}[n:\mBbbN{}].  P[n]


By

---

Latex:
ProveUniformCompNatInd

---

Home Index