| 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 12156 | . . . . . 6 ⊢ 1 ∈ ℕ | |
| 2 | nnindf.5 | . . . . . 6 ⊢ 𝜓 | |
| 3 | nnindf.1 | . . . . . . 7 ⊢ (𝑥 = 1 → (𝜑 ↔ 𝜓)) | |
| 4 | 3 | elrab 3646 | . . . . . 6 ⊢ (1 ∈ {𝑥 ∈ ℕ ∣ 𝜑} ↔ (1 ∈ ℕ ∧ 𝜓)) |
| 5 | 1, 2, 4 | mpbir2an 711 | . . . . 5 ⊢ 1 ∈ {𝑥 ∈ ℕ ∣ 𝜑} |
| 6 | elrabi 3642 | . . . . . . . 8 ⊢ (𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝜑} → 𝑦 ∈ ℕ) | |
| 7 | peano2nn 12157 | . . . . . . . . . . 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 3646 | . . . . . . . . 9 ⊢ (𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝜑} ↔ (𝑦 ∈ ℕ ∧ 𝜒)) |
| 13 | nnindf.3 | . . . . . . . . . 10 ⊢ (𝑥 = (𝑦 + 1) → (𝜑 ↔ 𝜃)) | |
| 14 | 13 | elrab 3646 | . . . . . . . . 9 ⊢ ((𝑦 + 1) ∈ {𝑥 ∈ ℕ ∣ 𝜑} ↔ ((𝑦 + 1) ∈ ℕ ∧ 𝜃)) |
| 15 | 10, 12, 14 | 3imtr4g 296 | . . . . . . . 8 ⊢ (𝑦 ∈ ℕ → (𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝜑} → (𝑦 + 1) ∈ {𝑥 ∈ ℕ ∣ 𝜑})) |
| 16 | 6, 15 | mpcom 38 | . . . . . . 7 ⊢ (𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝜑} → (𝑦 + 1) ∈ {𝑥 ∈ ℕ ∣ 𝜑}) |
| 17 | 16 | rgen 3053 | . . . . . 6 ⊢ ∀𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝜑} (𝑦 + 1) ∈ {𝑥 ∈ ℕ ∣ 𝜑} |
| 18 | nnindf.x | . . . . . . . 8 ⊢ Ⅎ𝑦𝜑 | |
| 19 | nfcv 2898 | . . . . . . . 8 ⊢ Ⅎ𝑦ℕ | |
| 20 | 18, 19 | nfrabw 3436 | . . . . . . 7 ⊢ Ⅎ𝑦{𝑥 ∈ ℕ ∣ 𝜑} |
| 21 | nfcv 2898 | . . . . . . 7 ⊢ Ⅎ𝑤{𝑥 ∈ ℕ ∣ 𝜑} | |
| 22 | nfv 1915 | . . . . . . 7 ⊢ Ⅎ𝑤(𝑦 + 1) ∈ {𝑥 ∈ ℕ ∣ 𝜑} | |
| 23 | 20 | nfel2 2917 | . . . . . . 7 ⊢ Ⅎ𝑦(𝑤 + 1) ∈ {𝑥 ∈ ℕ ∣ 𝜑} |
| 24 | oveq1 7365 | . . . . . . . 8 ⊢ (𝑦 = 𝑤 → (𝑦 + 1) = (𝑤 + 1)) | |
| 25 | 24 | eleq1d 2821 | . . . . . . 7 ⊢ (𝑦 = 𝑤 → ((𝑦 + 1) ∈ {𝑥 ∈ ℕ ∣ 𝜑} ↔ (𝑤 + 1) ∈ {𝑥 ∈ ℕ ∣ 𝜑})) |
| 26 | 20, 21, 22, 23, 25 | cbvralfw 3276 | . . . . . 6 ⊢ (∀𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝜑} (𝑦 + 1) ∈ {𝑥 ∈ ℕ ∣ 𝜑} ↔ ∀𝑤 ∈ {𝑥 ∈ ℕ ∣ 𝜑} (𝑤 + 1) ∈ {𝑥 ∈ ℕ ∣ 𝜑}) |
| 27 | 17, 26 | mpbi 230 | . . . . 5 ⊢ ∀𝑤 ∈ {𝑥 ∈ ℕ ∣ 𝜑} (𝑤 + 1) ∈ {𝑥 ∈ ℕ ∣ 𝜑} |
| 28 | peano5nni 12148 | . . . . 5 ⊢ ((1 ∈ {𝑥 ∈ ℕ ∣ 𝜑} ∧ ∀𝑤 ∈ {𝑥 ∈ ℕ ∣ 𝜑} (𝑤 + 1) ∈ {𝑥 ∈ ℕ ∣ 𝜑}) → ℕ ⊆ {𝑥 ∈ ℕ ∣ 𝜑}) | |
| 29 | 5, 27, 28 | mp2an 692 | . . . 4 ⊢ ℕ ⊆ {𝑥 ∈ ℕ ∣ 𝜑} |
| 30 | 29 | sseli 3929 | . . 3 ⊢ (𝐴 ∈ ℕ → 𝐴 ∈ {𝑥 ∈ ℕ ∣ 𝜑}) |
| 31 | nnindf.4 | . . . 4 ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜏)) | |
| 32 | 31 | elrab 3646 | . . 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 1541 Ⅎwnf 1784 ∈ wcel 2113 ∀wral 3051 {crab 3399 ⊆ wss 3901 (class class class)co 7358 1c1 11027 + caddc 11029 ℕcn 12145 |
| 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 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-sep 5241 ax-nul 5251 ax-pr 5377 ax-un 7680 ax-1cn 11084 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-ral 3052 df-rex 3061 df-reu 3351 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-pss 3921 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-iun 4948 df-br 5099 df-opab 5161 df-mpt 5180 df-tr 5206 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-ov 7361 df-om 7809 df-2nd 7934 df-frecs 8223 df-wrecs 8254 df-recs 8303 df-rdg 8341 df-nn 12146 |
| This theorem is referenced by: nn0min 32901 |
| Copyright terms: Public domain | W3C validator |