Users' Mathboxes Mathbox for Thierry Arnoux < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  nnindf Structured version   Visualization version   GIF version

Theorem nnindf 31241
Description: Principle of Mathematical Induction, using a bound-variable hypothesis instead of distinct variables. (Contributed by Thierry Arnoux, 6-May-2018.)
Hypotheses
Ref Expression
nnindf.x 𝑦𝜑
nnindf.1 (𝑥 = 1 → (𝜑𝜓))
nnindf.2 (𝑥 = 𝑦 → (𝜑𝜒))
nnindf.3 (𝑥 = (𝑦 + 1) → (𝜑𝜃))
nnindf.4 (𝑥 = 𝐴 → (𝜑𝜏))
nnindf.5 𝜓
nnindf.6 (𝑦 ∈ ℕ → (𝜒𝜃))
Assertion
Ref Expression
nnindf (𝐴 ∈ ℕ → 𝜏)
Distinct variable groups:   𝑥,𝑦   𝑥,𝐴   𝜒,𝑥   𝜓,𝑥   𝜏,𝑥   𝜃,𝑥
Allowed substitution hints:   𝜑(𝑥,𝑦)   𝜓(𝑦)   𝜒(𝑦)   𝜃(𝑦)   𝜏(𝑦)   𝐴(𝑦)

Proof of Theorem nnindf
Dummy variable 𝑤 is distinct from all other variables.
StepHypRef Expression
1 1nn 12054 . . . . . 6 1 ∈ ℕ
2 nnindf.5 . . . . . 6 𝜓
3 nnindf.1 . . . . . . 7 (𝑥 = 1 → (𝜑𝜓))
43elrab 3633 . . . . . 6 (1 ∈ {𝑥 ∈ ℕ ∣ 𝜑} ↔ (1 ∈ ℕ ∧ 𝜓))
51, 2, 4mpbir2an 708 . . . . 5 1 ∈ {𝑥 ∈ ℕ ∣ 𝜑}
6 elrabi 3627 . . . . . . . 8 (𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝜑} → 𝑦 ∈ ℕ)
7 peano2nn 12055 . . . . . . . . . . 11 (𝑦 ∈ ℕ → (𝑦 + 1) ∈ ℕ)
87a1d 25 . . . . . . . . . 10 (𝑦 ∈ ℕ → (𝑦 ∈ ℕ → (𝑦 + 1) ∈ ℕ))
9 nnindf.6 . . . . . . . . . 10 (𝑦 ∈ ℕ → (𝜒𝜃))
108, 9anim12d 609 . . . . . . . . 9 (𝑦 ∈ ℕ → ((𝑦 ∈ ℕ ∧ 𝜒) → ((𝑦 + 1) ∈ ℕ ∧ 𝜃)))
11 nnindf.2 . . . . . . . . . 10 (𝑥 = 𝑦 → (𝜑𝜒))
1211elrab 3633 . . . . . . . . 9 (𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝜑} ↔ (𝑦 ∈ ℕ ∧ 𝜒))
13 nnindf.3 . . . . . . . . . 10 (𝑥 = (𝑦 + 1) → (𝜑𝜃))
1413elrab 3633 . . . . . . . . 9 ((𝑦 + 1) ∈ {𝑥 ∈ ℕ ∣ 𝜑} ↔ ((𝑦 + 1) ∈ ℕ ∧ 𝜃))
1510, 12, 143imtr4g 295 . . . . . . . 8 (𝑦 ∈ ℕ → (𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝜑} → (𝑦 + 1) ∈ {𝑥 ∈ ℕ ∣ 𝜑}))
166, 15mpcom 38 . . . . . . 7 (𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝜑} → (𝑦 + 1) ∈ {𝑥 ∈ ℕ ∣ 𝜑})
1716rgen 3064 . . . . . 6 𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝜑} (𝑦 + 1) ∈ {𝑥 ∈ ℕ ∣ 𝜑}
18 nnindf.x . . . . . . . 8 𝑦𝜑
19 nfcv 2905 . . . . . . . 8 𝑦
2018, 19nfrabw 3436 . . . . . . 7 𝑦{𝑥 ∈ ℕ ∣ 𝜑}
21 nfcv 2905 . . . . . . 7 𝑤{𝑥 ∈ ℕ ∣ 𝜑}
22 nfv 1916 . . . . . . 7 𝑤(𝑦 + 1) ∈ {𝑥 ∈ ℕ ∣ 𝜑}
2320nfel2 2923 . . . . . . 7 𝑦(𝑤 + 1) ∈ {𝑥 ∈ ℕ ∣ 𝜑}
24 oveq1 7320 . . . . . . . 8 (𝑦 = 𝑤 → (𝑦 + 1) = (𝑤 + 1))
2524eleq1d 2822 . . . . . . 7 (𝑦 = 𝑤 → ((𝑦 + 1) ∈ {𝑥 ∈ ℕ ∣ 𝜑} ↔ (𝑤 + 1) ∈ {𝑥 ∈ ℕ ∣ 𝜑}))
2620, 21, 22, 23, 25cbvralfw 3284 . . . . . 6 (∀𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝜑} (𝑦 + 1) ∈ {𝑥 ∈ ℕ ∣ 𝜑} ↔ ∀𝑤 ∈ {𝑥 ∈ ℕ ∣ 𝜑} (𝑤 + 1) ∈ {𝑥 ∈ ℕ ∣ 𝜑})
2717, 26mpbi 229 . . . . 5 𝑤 ∈ {𝑥 ∈ ℕ ∣ 𝜑} (𝑤 + 1) ∈ {𝑥 ∈ ℕ ∣ 𝜑}
28 peano5nni 12046 . . . . 5 ((1 ∈ {𝑥 ∈ ℕ ∣ 𝜑} ∧ ∀𝑤 ∈ {𝑥 ∈ ℕ ∣ 𝜑} (𝑤 + 1) ∈ {𝑥 ∈ ℕ ∣ 𝜑}) → ℕ ⊆ {𝑥 ∈ ℕ ∣ 𝜑})
295, 27, 28mp2an 689 . . . 4 ℕ ⊆ {𝑥 ∈ ℕ ∣ 𝜑}
3029sseli 3926 . . 3 (𝐴 ∈ ℕ → 𝐴 ∈ {𝑥 ∈ ℕ ∣ 𝜑})
31 nnindf.4 . . . 4 (𝑥 = 𝐴 → (𝜑𝜏))
3231elrab 3633 . . 3 (𝐴 ∈ {𝑥 ∈ ℕ ∣ 𝜑} ↔ (𝐴 ∈ ℕ ∧ 𝜏))
3330, 32sylib 217 . 2 (𝐴 ∈ ℕ → (𝐴 ∈ ℕ ∧ 𝜏))
3433simprd 496 1 (𝐴 ∈ ℕ → 𝜏)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 396   = wceq 1540  wnf 1784  wcel 2105  wral 3062  {crab 3404  wss 3896  (class class class)co 7313  1c1 10942   + caddc 10944  cn 12043
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 2708  ax-sep 5236  ax-nul 5243  ax-pr 5365  ax-un 7626  ax-1cn 10999
This theorem depends on definitions:  df-bi 206  df-an 397  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 2539  df-eu 2568  df-clab 2715  df-cleq 2729  df-clel 2815  df-nfc 2887  df-ne 2942  df-ral 3063  df-rex 3072  df-reu 3351  df-rab 3405  df-v 3443  df-sbc 3726  df-csb 3842  df-dif 3899  df-un 3901  df-in 3903  df-ss 3913  df-pss 3915  df-nul 4267  df-if 4470  df-pw 4545  df-sn 4570  df-pr 4572  df-op 4576  df-uni 4849  df-iun 4937  df-br 5086  df-opab 5148  df-mpt 5169  df-tr 5203  df-id 5505  df-eprel 5511  df-po 5519  df-so 5520  df-fr 5560  df-we 5562  df-xp 5611  df-rel 5612  df-cnv 5613  df-co 5614  df-dm 5615  df-rn 5616  df-res 5617  df-ima 5618  df-pred 6222  df-ord 6289  df-on 6290  df-lim 6291  df-suc 6292  df-iota 6415  df-fun 6465  df-fn 6466  df-f 6467  df-f1 6468  df-fo 6469  df-f1o 6470  df-fv 6471  df-ov 7316  df-om 7756  df-2nd 7875  df-frecs 8142  df-wrecs 8173  df-recs 8247  df-rdg 8286  df-nn 12044
This theorem is referenced by:  nn0min  31242
  Copyright terms: Public domain W3C validator