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 32983
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 12215 . . . . . 6 1 ∈ ℕ
2 nnindf.5 . . . . . 6 𝜓
3 nnindf.1 . . . . . . 7 (𝑥 = 1 → (𝜑𝜓))
43elrab 3649 . . . . . 6 (1 ∈ {𝑥 ∈ ℕ ∣ 𝜑} ↔ (1 ∈ ℕ ∧ 𝜓))
51, 2, 4mpbir2an 721 . . . . 5 1 ∈ {𝑥 ∈ ℕ ∣ 𝜑}
6 elrabi 3645 . . . . . . . 8 (𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝜑} → 𝑦 ∈ ℕ)
7 peano2nn 12216 . . . . . . . . . . 11 (𝑦 ∈ ℕ → (𝑦 + 1) ∈ ℕ)
87a1d 25 . . . . . . . . . 10 (𝑦 ∈ ℕ → (𝑦 ∈ ℕ → (𝑦 + 1) ∈ ℕ))
9 nnindf.6 . . . . . . . . . 10 (𝑦 ∈ ℕ → (𝜒𝜃))
108, 9anim12d 618 . . . . . . . . 9 (𝑦 ∈ ℕ → ((𝑦 ∈ ℕ ∧ 𝜒) → ((𝑦 + 1) ∈ ℕ ∧ 𝜃)))
11 nnindf.2 . . . . . . . . . 10 (𝑥 = 𝑦 → (𝜑𝜒))
1211elrab 3649 . . . . . . . . 9 (𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝜑} ↔ (𝑦 ∈ ℕ ∧ 𝜒))
13 nnindf.3 . . . . . . . . . 10 (𝑥 = (𝑦 + 1) → (𝜑𝜃))
1413elrab 3649 . . . . . . . . 9 ((𝑦 + 1) ∈ {𝑥 ∈ ℕ ∣ 𝜑} ↔ ((𝑦 + 1) ∈ ℕ ∧ 𝜃))
1510, 12, 143imtr4g 298 . . . . . . . 8 (𝑦 ∈ ℕ → (𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝜑} → (𝑦 + 1) ∈ {𝑥 ∈ ℕ ∣ 𝜑}))
166, 15mpcom 38 . . . . . . 7 (𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝜑} → (𝑦 + 1) ∈ {𝑥 ∈ ℕ ∣ 𝜑})
1716rgen 3077 . . . . . 6 𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝜑} (𝑦 + 1) ∈ {𝑥 ∈ ℕ ∣ 𝜑}
18 nnindf.x . . . . . . . 8 𝑦𝜑
19 nfcv 2923 . . . . . . . 8 𝑦
2018, 19nfrabw 3450 . . . . . . 7 𝑦{𝑥 ∈ ℕ ∣ 𝜑}
21 nfcv 2923 . . . . . . 7 𝑤{𝑥 ∈ ℕ ∣ 𝜑}
22 nfv 1933 . . . . . . 7 𝑤(𝑦 + 1) ∈ {𝑥 ∈ ℕ ∣ 𝜑}
2320nfel2 2941 . . . . . . 7 𝑦(𝑤 + 1) ∈ {𝑥 ∈ ℕ ∣ 𝜑}
24 oveq1 7398 . . . . . . . 8 (𝑦 = 𝑤 → (𝑦 + 1) = (𝑤 + 1))
2524eleq1d 2846 . . . . . . 7 (𝑦 = 𝑤 → ((𝑦 + 1) ∈ {𝑥 ∈ ℕ ∣ 𝜑} ↔ (𝑤 + 1) ∈ {𝑥 ∈ ℕ ∣ 𝜑}))
2620, 21, 22, 23, 25cbvralfw 3301 . . . . . 6 (∀𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝜑} (𝑦 + 1) ∈ {𝑥 ∈ ℕ ∣ 𝜑} ↔ ∀𝑤 ∈ {𝑥 ∈ ℕ ∣ 𝜑} (𝑤 + 1) ∈ {𝑥 ∈ ℕ ∣ 𝜑})
2717, 26mpbi 232 . . . . 5 𝑤 ∈ {𝑥 ∈ ℕ ∣ 𝜑} (𝑤 + 1) ∈ {𝑥 ∈ ℕ ∣ 𝜑}
28 peano5nni 12207 . . . . 5 ((1 ∈ {𝑥 ∈ ℕ ∣ 𝜑} ∧ ∀𝑤 ∈ {𝑥 ∈ ℕ ∣ 𝜑} (𝑤 + 1) ∈ {𝑥 ∈ ℕ ∣ 𝜑}) → ℕ ⊆ {𝑥 ∈ ℕ ∣ 𝜑})
295, 27, 28mp2an 702 . . . 4 ℕ ⊆ {𝑥 ∈ ℕ ∣ 𝜑}
3029sseli 3930 . . 3 (𝐴 ∈ ℕ → 𝐴 ∈ {𝑥 ∈ ℕ ∣ 𝜑})
31 nnindf.4 . . . 4 (𝑥 = 𝐴 → (𝜑𝜏))
3231elrab 3649 . . 3 (𝐴 ∈ {𝑥 ∈ ℕ ∣ 𝜑} ↔ (𝐴 ∈ ℕ ∧ 𝜏))
3330, 32sylib 220 . 2 (𝐴 ∈ ℕ → (𝐴 ∈ ℕ ∧ 𝜏))
3433simprd 499 1 (𝐴 ∈ ℕ → 𝜏)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 399   = wceq 1559  wnf 1802  wcel 2141  wral 3075  {crab 3413  wss 3902  (class class class)co 7391  1c1 11068   + caddc 11070  cn 12204
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-sep 5243  ax-nul 5253  ax-pr 5387  ax-un 7713  ax-1cn 11125
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3or 1098  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-nf 1803  df-sb 2090  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3076  df-rex 3086  df-reu 3367  df-rab 3414  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4284  df-if 4478  df-pw 4554  df-sn 4580  df-pr 4582  df-op 4586  df-uni 4863  df-iun 4948  df-br 5098  df-opab 5160  df-mpt 5179  df-tr 5205  df-id 5538  df-eprel 5543  df-po 5551  df-so 5552  df-fr 5596  df-we 5598  df-xp 5649  df-rel 5650  df-cnv 5651  df-co 5652  df-dm 5653  df-rn 5654  df-res 5655  df-ima 5656  df-pred 6283  df-ord 6344  df-on 6345  df-lim 6346  df-suc 6347  df-iota 6472  df-fun 6518  df-fn 6519  df-f 6520  df-f1 6521  df-fo 6522  df-f1o 6523  df-fv 6524  df-ov 7394  df-om 7842  df-2nd 7966  df-frecs 8256  df-wrecs 8287  df-recs 8336  df-rdg 8375  df-nn 12205
This theorem is referenced by:  nn0min  32984
  Copyright terms: Public domain W3C validator