| 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 3045 | . . . . . 6 ⊢ (∀𝑥 ∈ 𝐴 suc 𝑥 ∈ 𝐴 ↔ ∀𝑥(𝑥 ∈ 𝐴 → suc 𝑥 ∈ 𝐴)) | |
| 5 | alral 3058 | . . . . . 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 7869 | . . 3 ⊢ ((∅ ∈ 𝐴 ∧ ∀𝑥 ∈ ω (𝑥 ∈ 𝐴 → suc 𝑥 ∈ 𝐴)) → ω ⊆ 𝐴) | |
| 10 | 8, 9 | ax-mp 5 | . 2 ⊢ ω ⊆ 𝐴 |
| 11 | 2, 10 | eqssi 3963 | 1 ⊢ 𝐴 = ω |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1086 ∀wal 1538 = wceq 1540 ∈ wcel 2109 ∀wral 3044 ⊆ wss 3914 ∅c0 4296 suc csuc 6334 ωcom 7842 |
| 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-ext 2701 ax-sep 5251 ax-nul 5261 ax-pr 5387 ax-un 7711 |
| 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-sb 2066 df-clab 2708 df-cleq 2721 df-clel 2803 df-ne 2926 df-ral 3045 df-rex 3054 df-rab 3406 df-v 3449 df-dif 3917 df-un 3919 df-in 3921 df-ss 3931 df-pss 3934 df-nul 4297 df-if 4489 df-pw 4565 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4872 df-br 5108 df-opab 5170 df-tr 5215 df-eprel 5538 df-po 5546 df-so 5547 df-fr 5591 df-we 5593 df-ord 6335 df-on 6336 df-lim 6337 df-suc 6338 df-om 7843 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |