| 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 12244 | . . . . . 6 ⊢ 1 ∈ ℕ | |
| 2 | nnindf.5 | . . . . . 6 ⊢ 𝜓 | |
| 3 | nnindf.1 | . . . . . . 7 ⊢ (𝑥 = 1 → (𝜑 ↔ 𝜓)) | |
| 4 | 3 | elrab 3659 | . . . . . 6 ⊢ (1 ∈ {𝑥 ∈ ℕ ∣ 𝜑} ↔ (1 ∈ ℕ ∧ 𝜓)) |
| 5 | 1, 2, 4 | mpbir2an 723 | . . . . 5 ⊢ 1 ∈ {𝑥 ∈ ℕ ∣ 𝜑} |
| 6 | elrabi 3655 | . . . . . . . 8 ⊢ (𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝜑} → 𝑦 ∈ ℕ) | |
| 7 | peano2nn 12245 | . . . . . . . . . . 11 ⊢ (𝑦 ∈ ℕ → (𝑦 + 1) ∈ ℕ) | |
| 8 | 7 | a1d 26 | . . . . . . . . . 10 ⊢ (𝑦 ∈ ℕ → (𝑦 ∈ ℕ → (𝑦 + 1) ∈ ℕ)) |
| 9 | nnindf.6 | . . . . . . . . . 10 ⊢ (𝑦 ∈ ℕ → (𝜒 → 𝜃)) | |
| 10 | 8, 9 | anim12d 620 | . . . . . . . . 9 ⊢ (𝑦 ∈ ℕ → ((𝑦 ∈ ℕ ∧ 𝜒) → ((𝑦 + 1) ∈ ℕ ∧ 𝜃))) |
| 11 | nnindf.2 | . . . . . . . . . 10 ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜒)) | |
| 12 | 11 | elrab 3659 | . . . . . . . . 9 ⊢ (𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝜑} ↔ (𝑦 ∈ ℕ ∧ 𝜒)) |
| 13 | nnindf.3 | . . . . . . . . . 10 ⊢ (𝑥 = (𝑦 + 1) → (𝜑 ↔ 𝜃)) | |
| 14 | 13 | elrab 3659 | . . . . . . . . 9 ⊢ ((𝑦 + 1) ∈ {𝑥 ∈ ℕ ∣ 𝜑} ↔ ((𝑦 + 1) ∈ ℕ ∧ 𝜃)) |
| 15 | 10, 12, 14 | 3imtr4g 299 | . . . . . . . 8 ⊢ (𝑦 ∈ ℕ → (𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝜑} → (𝑦 + 1) ∈ {𝑥 ∈ ℕ ∣ 𝜑})) |
| 16 | 6, 15 | mpcom 39 | . . . . . . 7 ⊢ (𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝜑} → (𝑦 + 1) ∈ {𝑥 ∈ ℕ ∣ 𝜑}) |
| 17 | 16 | rgen 3087 | . . . . . 6 ⊢ ∀𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝜑} (𝑦 + 1) ∈ {𝑥 ∈ ℕ ∣ 𝜑} |
| 18 | nnindf.x | . . . . . . . 8 ⊢ Ⅎ𝑦𝜑 | |
| 19 | nfcv 2931 | . . . . . . . 8 ⊢ Ⅎ𝑦ℕ | |
| 20 | 18, 19 | nfrabw 3460 | . . . . . . 7 ⊢ Ⅎ𝑦{𝑥 ∈ ℕ ∣ 𝜑} |
| 21 | nfcv 2931 | . . . . . . 7 ⊢ Ⅎ𝑤{𝑥 ∈ ℕ ∣ 𝜑} | |
| 22 | nfv 1941 | . . . . . . 7 ⊢ Ⅎ𝑤(𝑦 + 1) ∈ {𝑥 ∈ ℕ ∣ 𝜑} | |
| 23 | 20 | nfel2 2949 | . . . . . . 7 ⊢ Ⅎ𝑦(𝑤 + 1) ∈ {𝑥 ∈ ℕ ∣ 𝜑} |
| 24 | oveq1 7418 | . . . . . . . 8 ⊢ (𝑦 = 𝑤 → (𝑦 + 1) = (𝑤 + 1)) | |
| 25 | 24 | eleq1d 2854 | . . . . . . 7 ⊢ (𝑦 = 𝑤 → ((𝑦 + 1) ∈ {𝑥 ∈ ℕ ∣ 𝜑} ↔ (𝑤 + 1) ∈ {𝑥 ∈ ℕ ∣ 𝜑})) |
| 26 | 20, 21, 22, 23, 25 | cbvralfw 3311 | . . . . . 6 ⊢ (∀𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝜑} (𝑦 + 1) ∈ {𝑥 ∈ ℕ ∣ 𝜑} ↔ ∀𝑤 ∈ {𝑥 ∈ ℕ ∣ 𝜑} (𝑤 + 1) ∈ {𝑥 ∈ ℕ ∣ 𝜑}) |
| 27 | 17, 26 | mpbi 233 | . . . . 5 ⊢ ∀𝑤 ∈ {𝑥 ∈ ℕ ∣ 𝜑} (𝑤 + 1) ∈ {𝑥 ∈ ℕ ∣ 𝜑} |
| 28 | peano5nni 12236 | . . . . 5 ⊢ ((1 ∈ {𝑥 ∈ ℕ ∣ 𝜑} ∧ ∀𝑤 ∈ {𝑥 ∈ ℕ ∣ 𝜑} (𝑤 + 1) ∈ {𝑥 ∈ ℕ ∣ 𝜑}) → ℕ ⊆ {𝑥 ∈ ℕ ∣ 𝜑}) | |
| 29 | 5, 27, 28 | mp2an 704 | . . . 4 ⊢ ℕ ⊆ {𝑥 ∈ ℕ ∣ 𝜑} |
| 30 | 29 | sseli 3941 | . . 3 ⊢ (𝐴 ∈ ℕ → 𝐴 ∈ {𝑥 ∈ ℕ ∣ 𝜑}) |
| 31 | nnindf.4 | . . . 4 ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜏)) | |
| 32 | 31 | elrab 3659 | . . 3 ⊢ (𝐴 ∈ {𝑥 ∈ ℕ ∣ 𝜑} ↔ (𝐴 ∈ ℕ ∧ 𝜏)) |
| 33 | 30, 32 | sylib 221 | . 2 ⊢ (𝐴 ∈ ℕ → (𝐴 ∈ ℕ ∧ 𝜏)) |
| 34 | 33 | simprd 500 | 1 ⊢ (𝐴 ∈ ℕ → 𝜏) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 = wceq 1567 Ⅎwnf 1810 ∈ wcel 2149 ∀wral 3085 {crab 3423 ⊆ wss 3913 (class class class)co 7411 1c1 11101 + caddc 11103 ℕcn 12233 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-sep 5261 ax-nul 5271 ax-pr 5405 ax-un 7733 ax-1cn 11158 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-ral 3086 df-rex 3096 df-reu 3377 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-pss 3933 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4877 df-iun 4962 df-br 5114 df-opab 5178 df-mpt 5197 df-tr 5223 df-id 5557 df-eprel 5562 df-po 5570 df-so 5571 df-fr 5615 df-we 5617 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-res 5674 df-ima 5675 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-ov 7414 df-om 7863 df-2nd 7987 df-frecs 8278 df-wrecs 8309 df-recs 8358 df-rdg 8397 df-nn 12234 |
| This theorem is referenced by: nn0min 33106 |
| Copyright terms: Public domain | W3C validator |