MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  nnindALT Structured version   Visualization version   GIF version

Theorem nnindALT 12230
Description: Principle of Mathematical Induction (inference schema). The last four hypotheses give us the substitution instances we need; the first two are the induction step and the basis.

This ALT version of nnind 12229 has a different hypothesis order. It may be easier to use with the Metamath program Proof Assistant, because "MM-PA> ASSIGN LAST" will be applied to the substitution instances first. We may eventually use this one as the official version. You may use either version. After the proof is complete, the ALT version can be changed to the non-ALT version with "MM-PA> MINIMIZE_WITH nnind / MAYGROW";. (Contributed by NM, 7-Dec-2005.) (New usage is discouraged.) (Proof modification is discouraged.)

Hypotheses
Ref Expression
nnindALT.6 (𝑦 ∈ ℕ → (𝜒𝜃))
nnindALT.5 𝜓
nnindALT.1 (𝑥 = 1 → (𝜑𝜓))
nnindALT.2 (𝑥 = 𝑦 → (𝜑𝜒))
nnindALT.3 (𝑥 = (𝑦 + 1) → (𝜑𝜃))
nnindALT.4 (𝑥 = 𝐴 → (𝜑𝜏))
Assertion
Ref Expression
nnindALT (𝐴 ∈ ℕ → 𝜏)
Distinct variable groups:   𝑥,𝑦   𝑥,𝐴   𝜓,𝑥   𝜒,𝑥   𝜃,𝑥   𝜏,𝑥   𝜑,𝑦
Allowed substitution hints:   𝜑(𝑥)   𝜓(𝑦)   𝜒(𝑦)   𝜃(𝑦)   𝜏(𝑦)   𝐴(𝑦)

Proof of Theorem nnindALT
StepHypRef Expression
1 nnindALT.1 . 2 (𝑥 = 1 → (𝜑𝜓))
2 nnindALT.2 . 2 (𝑥 = 𝑦 → (𝜑𝜒))
3 nnindALT.3 . 2 (𝑥 = (𝑦 + 1) → (𝜑𝜃))
4 nnindALT.4 . 2 (𝑥 = 𝐴 → (𝜑𝜏))
5 nnindALT.5 . 2 𝜓
6 nnindALT.6 . 2 (𝑦 ∈ ℕ → (𝜒𝜃))
71, 2, 3, 4, 5, 6nnind 12229 1 (𝐴 ∈ ℕ → 𝜏)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205   = wceq 1541  wcel 2106  (class class class)co 7408  1c1 11110   + caddc 11112  cn 12211
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2703  ax-sep 5299  ax-nul 5306  ax-pr 5427  ax-un 7724  ax-1cn 11167
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3or 1088  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2534  df-eu 2563  df-clab 2710  df-cleq 2724  df-clel 2810  df-nfc 2885  df-ne 2941  df-ral 3062  df-rex 3071  df-reu 3377  df-rab 3433  df-v 3476  df-sbc 3778  df-csb 3894  df-dif 3951  df-un 3953  df-in 3955  df-ss 3965  df-pss 3967  df-nul 4323  df-if 4529  df-pw 4604  df-sn 4629  df-pr 4631  df-op 4635  df-uni 4909  df-iun 4999  df-br 5149  df-opab 5211  df-mpt 5232  df-tr 5266  df-id 5574  df-eprel 5580  df-po 5588  df-so 5589  df-fr 5631  df-we 5633  df-xp 5682  df-rel 5683  df-cnv 5684  df-co 5685  df-dm 5686  df-rn 5687  df-res 5688  df-ima 5689  df-pred 6300  df-ord 6367  df-on 6368  df-lim 6369  df-suc 6370  df-iota 6495  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-ov 7411  df-om 7855  df-2nd 7975  df-frecs 8265  df-wrecs 8296  df-recs 8370  df-rdg 8409  df-nn 12212
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator