| Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > nnindf | Structured version Visualization version GIF version | ||
| Description: Principle of Mathematical Induction, using a bound-variable hypothesis instead of distinct variables. (Contributed by Thierry Arnoux, 6-May-2018.) |
| Ref | Expression |
|---|---|
| nnindf.x | ⊢ Ⅎ𝑦𝜑 |
| nnindf.1 | ⊢ (𝑥 = 1 → (𝜑 ↔ 𝜓)) |
| nnindf.2 | ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜒)) |
| nnindf.3 | ⊢ (𝑥 = (𝑦 + 1) → (𝜑 ↔ 𝜃)) |
| nnindf.4 | ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜏)) |
| nnindf.5 | ⊢ 𝜓 |
| nnindf.6 | ⊢ (𝑦 ∈ ℕ → (𝜒 → 𝜃)) |
| Ref | Expression |
|---|---|
| nnindf | ⊢ (𝐴 ∈ ℕ → 𝜏) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 1nn 12198 | . . . . . 6 ⊢ 1 ∈ ℕ | |
| 2 | nnindf.5 | . . . . . 6 ⊢ 𝜓 | |
| 3 | nnindf.1 | . . . . . . 7 ⊢ (𝑥 = 1 → (𝜑 ↔ 𝜓)) | |
| 4 | 3 | elrab 3661 | . . . . . 6 ⊢ (1 ∈ {𝑥 ∈ ℕ ∣ 𝜑} ↔ (1 ∈ ℕ ∧ 𝜓)) |
| 5 | 1, 2, 4 | mpbir2an 711 | . . . . 5 ⊢ 1 ∈ {𝑥 ∈ ℕ ∣ 𝜑} |
| 6 | elrabi 3656 | . . . . . . . 8 ⊢ (𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝜑} → 𝑦 ∈ ℕ) | |
| 7 | peano2nn 12199 | . . . . . . . . . . 11 ⊢ (𝑦 ∈ ℕ → (𝑦 + 1) ∈ ℕ) | |
| 8 | 7 | a1d 25 | . . . . . . . . . 10 ⊢ (𝑦 ∈ ℕ → (𝑦 ∈ ℕ → (𝑦 + 1) ∈ ℕ)) |
| 9 | nnindf.6 | . . . . . . . . . 10 ⊢ (𝑦 ∈ ℕ → (𝜒 → 𝜃)) | |
| 10 | 8, 9 | anim12d 609 | . . . . . . . . 9 ⊢ (𝑦 ∈ ℕ → ((𝑦 ∈ ℕ ∧ 𝜒) → ((𝑦 + 1) ∈ ℕ ∧ 𝜃))) |
| 11 | nnindf.2 | . . . . . . . . . 10 ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜒)) | |
| 12 | 11 | elrab 3661 | . . . . . . . . 9 ⊢ (𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝜑} ↔ (𝑦 ∈ ℕ ∧ 𝜒)) |
| 13 | nnindf.3 | . . . . . . . . . 10 ⊢ (𝑥 = (𝑦 + 1) → (𝜑 ↔ 𝜃)) | |
| 14 | 13 | elrab 3661 | . . . . . . . . 9 ⊢ ((𝑦 + 1) ∈ {𝑥 ∈ ℕ ∣ 𝜑} ↔ ((𝑦 + 1) ∈ ℕ ∧ 𝜃)) |
| 15 | 10, 12, 14 | 3imtr4g 296 | . . . . . . . 8 ⊢ (𝑦 ∈ ℕ → (𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝜑} → (𝑦 + 1) ∈ {𝑥 ∈ ℕ ∣ 𝜑})) |
| 16 | 6, 15 | mpcom 38 | . . . . . . 7 ⊢ (𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝜑} → (𝑦 + 1) ∈ {𝑥 ∈ ℕ ∣ 𝜑}) |
| 17 | 16 | rgen 3047 | . . . . . 6 ⊢ ∀𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝜑} (𝑦 + 1) ∈ {𝑥 ∈ ℕ ∣ 𝜑} |
| 18 | nnindf.x | . . . . . . . 8 ⊢ Ⅎ𝑦𝜑 | |
| 19 | nfcv 2892 | . . . . . . . 8 ⊢ Ⅎ𝑦ℕ | |
| 20 | 18, 19 | nfrabw 3446 | . . . . . . 7 ⊢ Ⅎ𝑦{𝑥 ∈ ℕ ∣ 𝜑} |
| 21 | nfcv 2892 | . . . . . . 7 ⊢ Ⅎ𝑤{𝑥 ∈ ℕ ∣ 𝜑} | |
| 22 | nfv 1914 | . . . . . . 7 ⊢ Ⅎ𝑤(𝑦 + 1) ∈ {𝑥 ∈ ℕ ∣ 𝜑} | |
| 23 | 20 | nfel2 2911 | . . . . . . 7 ⊢ Ⅎ𝑦(𝑤 + 1) ∈ {𝑥 ∈ ℕ ∣ 𝜑} |
| 24 | oveq1 7396 | . . . . . . . 8 ⊢ (𝑦 = 𝑤 → (𝑦 + 1) = (𝑤 + 1)) | |
| 25 | 24 | eleq1d 2814 | . . . . . . 7 ⊢ (𝑦 = 𝑤 → ((𝑦 + 1) ∈ {𝑥 ∈ ℕ ∣ 𝜑} ↔ (𝑤 + 1) ∈ {𝑥 ∈ ℕ ∣ 𝜑})) |
| 26 | 20, 21, 22, 23, 25 | cbvralfw 3280 | . . . . . 6 ⊢ (∀𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝜑} (𝑦 + 1) ∈ {𝑥 ∈ ℕ ∣ 𝜑} ↔ ∀𝑤 ∈ {𝑥 ∈ ℕ ∣ 𝜑} (𝑤 + 1) ∈ {𝑥 ∈ ℕ ∣ 𝜑}) |
| 27 | 17, 26 | mpbi 230 | . . . . 5 ⊢ ∀𝑤 ∈ {𝑥 ∈ ℕ ∣ 𝜑} (𝑤 + 1) ∈ {𝑥 ∈ ℕ ∣ 𝜑} |
| 28 | peano5nni 12190 | . . . . 5 ⊢ ((1 ∈ {𝑥 ∈ ℕ ∣ 𝜑} ∧ ∀𝑤 ∈ {𝑥 ∈ ℕ ∣ 𝜑} (𝑤 + 1) ∈ {𝑥 ∈ ℕ ∣ 𝜑}) → ℕ ⊆ {𝑥 ∈ ℕ ∣ 𝜑}) | |
| 29 | 5, 27, 28 | mp2an 692 | . . . 4 ⊢ ℕ ⊆ {𝑥 ∈ ℕ ∣ 𝜑} |
| 30 | 29 | sseli 3944 | . . 3 ⊢ (𝐴 ∈ ℕ → 𝐴 ∈ {𝑥 ∈ ℕ ∣ 𝜑}) |
| 31 | nnindf.4 | . . . 4 ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜏)) | |
| 32 | 31 | elrab 3661 | . . 3 ⊢ (𝐴 ∈ {𝑥 ∈ ℕ ∣ 𝜑} ↔ (𝐴 ∈ ℕ ∧ 𝜏)) |
| 33 | 30, 32 | sylib 218 | . 2 ⊢ (𝐴 ∈ ℕ → (𝐴 ∈ ℕ ∧ 𝜏)) |
| 34 | 33 | simprd 495 | 1 ⊢ (𝐴 ∈ ℕ → 𝜏) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1540 Ⅎwnf 1783 ∈ wcel 2109 ∀wral 3045 {crab 3408 ⊆ wss 3916 (class class class)co 7389 1c1 11075 + caddc 11077 ℕcn 12187 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2702 ax-sep 5253 ax-nul 5263 ax-pr 5389 ax-un 7713 ax-1cn 11132 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2534 df-eu 2563 df-clab 2709 df-cleq 2722 df-clel 2804 df-nfc 2879 df-ne 2927 df-ral 3046 df-rex 3055 df-reu 3357 df-rab 3409 df-v 3452 df-sbc 3756 df-csb 3865 df-dif 3919 df-un 3921 df-in 3923 df-ss 3933 df-pss 3936 df-nul 4299 df-if 4491 df-pw 4567 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4874 df-iun 4959 df-br 5110 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5535 df-eprel 5540 df-po 5548 df-so 5549 df-fr 5593 df-we 5595 df-xp 5646 df-rel 5647 df-cnv 5648 df-co 5649 df-dm 5650 df-rn 5651 df-res 5652 df-ima 5653 df-pred 6276 df-ord 6337 df-on 6338 df-lim 6339 df-suc 6340 df-iota 6466 df-fun 6515 df-fn 6516 df-f 6517 df-f1 6518 df-fo 6519 df-f1o 6520 df-fv 6521 df-ov 7392 df-om 7845 df-2nd 7971 df-frecs 8262 df-wrecs 8293 df-recs 8342 df-rdg 8380 df-nn 12188 |
| This theorem is referenced by: nn0min 32751 |
| Copyright terms: Public domain | W3C validator |