| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > find | Structured version Visualization version GIF version | ||
| Description: The Principle of Finite Induction (mathematical induction). Corollary 7.31 of [TakeutiZaring] p. 43. The simpler hypothesis shown here was suggested in an email from "Colin" on 1-Oct-2001. The hypothesis states that 𝐴 is a set of natural numbers, zero belongs to 𝐴, and given any member of 𝐴 the member's successor also belongs to 𝐴. The conclusion is that every natural number is in 𝐴. (Contributed by NM, 22-Feb-2004.) (Proof shortened by Andrew Salmon, 27-Aug-2011.) (Proof shortened by Wolf Lammen, 28-May-2024.) |
| Ref | Expression |
|---|---|
| find.1 | ⊢ (𝐴 ⊆ ω ∧ ∅ ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 suc 𝑥 ∈ 𝐴) |
| Ref | Expression |
|---|---|
| find | ⊢ 𝐴 = ω |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | find.1 | . . 3 ⊢ (𝐴 ⊆ ω ∧ ∅ ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 suc 𝑥 ∈ 𝐴) | |
| 2 | 1 | simp1i 1157 | . 2 ⊢ 𝐴 ⊆ ω |
| 3 | 3simpc 1168 | . . . 4 ⊢ ((𝐴 ⊆ ω ∧ ∅ ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 suc 𝑥 ∈ 𝐴) → (∅ ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 suc 𝑥 ∈ 𝐴)) | |
| 4 | df-ral 3077 | . . . . . 6 ⊢ (∀𝑥 ∈ 𝐴 suc 𝑥 ∈ 𝐴 ↔ ∀𝑥(𝑥 ∈ 𝐴 → suc 𝑥 ∈ 𝐴)) | |
| 5 | alral 3091 | . . . . . 6 ⊢ (∀𝑥(𝑥 ∈ 𝐴 → suc 𝑥 ∈ 𝐴) → ∀𝑥 ∈ ω (𝑥 ∈ 𝐴 → suc 𝑥 ∈ 𝐴)) | |
| 6 | 4, 5 | sylbi 220 | . . . . 5 ⊢ (∀𝑥 ∈ 𝐴 suc 𝑥 ∈ 𝐴 → ∀𝑥 ∈ ω (𝑥 ∈ 𝐴 → suc 𝑥 ∈ 𝐴)) |
| 7 | 6 | anim2i 629 | . . . 4 ⊢ ((∅ ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 suc 𝑥 ∈ 𝐴) → (∅ ∈ 𝐴 ∧ ∀𝑥 ∈ ω (𝑥 ∈ 𝐴 → suc 𝑥 ∈ 𝐴))) |
| 8 | 1, 3, 7 | mp2b 10 | . . 3 ⊢ (∅ ∈ 𝐴 ∧ ∀𝑥 ∈ ω (𝑥 ∈ 𝐴 → suc 𝑥 ∈ 𝐴)) |
| 9 | peano5 7891 | . . 3 ⊢ ((∅ ∈ 𝐴 ∧ ∀𝑥 ∈ ω (𝑥 ∈ 𝐴 → suc 𝑥 ∈ 𝐴)) → ω ⊆ 𝐴) | |
| 10 | 8, 9 | ax-mp 5 | . 2 ⊢ ω ⊆ 𝐴 |
| 11 | 2, 10 | eqssi 3947 | 1 ⊢ 𝐴 = ω |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 ∀wal 1568 = wceq 1570 ∈ wcel 2145 ∀wral 3076 ⊆ wss 3899 ∅c0 4279 suc csuc 6359 ωcom 7863 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-ext 2732 ax-sep 5251 ax-nul 5263 ax-pr 5398 ax-un 7737 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2100 df-clab 2739 df-cleq 2752 df-clel 2835 df-ne 2956 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5104 df-opab 5168 df-tr 5213 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 df-om 7864 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |