| 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 1139 | . 2 ⊢ 𝐴 ⊆ ω |
| 3 | 3simpc 1150 | . . . 4 ⊢ ((𝐴 ⊆ ω ∧ ∅ ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 suc 𝑥 ∈ 𝐴) → (∅ ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 suc 𝑥 ∈ 𝐴)) | |
| 4 | df-ral 3052 | . . . . . 6 ⊢ (∀𝑥 ∈ 𝐴 suc 𝑥 ∈ 𝐴 ↔ ∀𝑥(𝑥 ∈ 𝐴 → suc 𝑥 ∈ 𝐴)) | |
| 5 | alral 3065 | . . . . . 6 ⊢ (∀𝑥(𝑥 ∈ 𝐴 → suc 𝑥 ∈ 𝐴) → ∀𝑥 ∈ ω (𝑥 ∈ 𝐴 → suc 𝑥 ∈ 𝐴)) | |
| 6 | 4, 5 | sylbi 217 | . . . . 5 ⊢ (∀𝑥 ∈ 𝐴 suc 𝑥 ∈ 𝐴 → ∀𝑥 ∈ ω (𝑥 ∈ 𝐴 → suc 𝑥 ∈ 𝐴)) |
| 7 | 6 | anim2i 617 | . . . 4 ⊢ ((∅ ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 suc 𝑥 ∈ 𝐴) → (∅ ∈ 𝐴 ∧ ∀𝑥 ∈ ω (𝑥 ∈ 𝐴 → suc 𝑥 ∈ 𝐴))) |
| 8 | 1, 3, 7 | mp2b 10 | . . 3 ⊢ (∅ ∈ 𝐴 ∧ ∀𝑥 ∈ ω (𝑥 ∈ 𝐴 → suc 𝑥 ∈ 𝐴)) |
| 9 | peano5 7835 | . . 3 ⊢ ((∅ ∈ 𝐴 ∧ ∀𝑥 ∈ ω (𝑥 ∈ 𝐴 → suc 𝑥 ∈ 𝐴)) → ω ⊆ 𝐴) | |
| 10 | 8, 9 | ax-mp 5 | . 2 ⊢ ω ⊆ 𝐴 |
| 11 | 2, 10 | eqssi 3950 | 1 ⊢ 𝐴 = ω |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1086 ∀wal 1539 = wceq 1541 ∈ wcel 2113 ∀wral 3051 ⊆ wss 3901 ∅c0 4285 suc csuc 6319 ωcom 7808 |
| 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-ext 2708 ax-sep 5241 ax-nul 5251 ax-pr 5377 ax-un 7680 |
| 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-sb 2068 df-clab 2715 df-cleq 2728 df-clel 2811 df-ne 2933 df-ral 3052 df-rex 3061 df-rab 3400 df-v 3442 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-br 5099 df-opab 5161 df-tr 5206 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-we 5579 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-om 7809 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |