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

Theorem nnindALT 12236
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 12235 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 12235 1 (𝐴 ∈ ℕ → 𝜏)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205   = wceq 1540  wcel 2105  (class class class)co 7412  1c1 11114   + caddc 11116  cn 12217
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1912  ax-6 1970  ax-7 2010  ax-8 2107  ax-9 2115  ax-10 2136  ax-11 2153  ax-12 2170  ax-ext 2702  ax-sep 5300  ax-nul 5307  ax-pr 5428  ax-un 7728  ax-1cn 11171
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 845  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1781  df-nf 1785  df-sb 2067  df-mo 2533  df-eu 2562  df-clab 2709  df-cleq 2723  df-clel 2809  df-nfc 2884  df-ne 2940  df-ral 3061  df-rex 3070  df-reu 3376  df-rab 3432  df-v 3475  df-sbc 3779  df-csb 3895  df-dif 3952  df-un 3954  df-in 3956  df-ss 3966  df-pss 3968  df-nul 4324  df-if 4530  df-pw 4605  df-sn 4630  df-pr 4632  df-op 4636  df-uni 4910  df-iun 5000  df-br 5150  df-opab 5212  df-mpt 5233  df-tr 5267  df-id 5575  df-eprel 5581  df-po 5589  df-so 5590  df-fr 5632  df-we 5634  df-xp 5683  df-rel 5684  df-cnv 5685  df-co 5686  df-dm 5687  df-rn 5688  df-res 5689  df-ima 5690  df-pred 6301  df-ord 6368  df-on 6369  df-lim 6370  df-suc 6371  df-iota 6496  df-fun 6546  df-fn 6547  df-f 6548  df-f1 6549  df-fo 6550  df-f1o 6551  df-fv 6552  df-ov 7415  df-om 7859  df-2nd 7979  df-frecs 8269  df-wrecs 8300  df-recs 8374  df-rdg 8413  df-nn 12218
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator