MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  find Structured version   Visualization version   GIF version

Theorem find 7876
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.)
Hypothesis
Ref Expression
find.1 (𝐴 ⊆ ω ∧ ∅ ∈ 𝐴 ∧ ∀𝑥𝐴 suc 𝑥𝐴)
Assertion
Ref Expression
find 𝐴 = ω
Distinct variable group:   𝑥,𝐴

Proof of Theorem find
StepHypRef Expression
1 find.1 . . 3 (𝐴 ⊆ ω ∧ ∅ ∈ 𝐴 ∧ ∀𝑥𝐴 suc 𝑥𝐴)
21simp1i 1152 . 2 𝐴 ⊆ ω
3 3simpc 1163 . . . 4 ((𝐴 ⊆ ω ∧ ∅ ∈ 𝐴 ∧ ∀𝑥𝐴 suc 𝑥𝐴) → (∅ ∈ 𝐴 ∧ ∀𝑥𝐴 suc 𝑥𝐴))
4 df-ral 3077 . . . . . 6 (∀𝑥𝐴 suc 𝑥𝐴 ↔ ∀𝑥(𝑥𝐴 → suc 𝑥𝐴))
5 alral 3091 . . . . . 6 (∀𝑥(𝑥𝐴 → suc 𝑥𝐴) → ∀𝑥 ∈ ω (𝑥𝐴 → suc 𝑥𝐴))
64, 5sylbi 219 . . . . 5 (∀𝑥𝐴 suc 𝑥𝐴 → ∀𝑥 ∈ ω (𝑥𝐴 → suc 𝑥𝐴))
76anim2i 626 . . . 4 ((∅ ∈ 𝐴 ∧ ∀𝑥𝐴 suc 𝑥𝐴) → (∅ ∈ 𝐴 ∧ ∀𝑥 ∈ ω (𝑥𝐴 → suc 𝑥𝐴)))
81, 3, 7mp2b 10 . . 3 (∅ ∈ 𝐴 ∧ ∀𝑥 ∈ ω (𝑥𝐴 → suc 𝑥𝐴))
9 peano5 7874 . . 3 ((∅ ∈ 𝐴 ∧ ∀𝑥 ∈ ω (𝑥𝐴 → suc 𝑥𝐴)) → ω ⊆ 𝐴)
108, 9ax-mp 5 . 2 ω ⊆ 𝐴
112, 10eqssi 3952 1 𝐴 = ω
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 399  w3a 1098  wal 1558   = wceq 1560  wcel 2142  wral 3076  wss 3904  c0 4285  suc csuc 6348  ωcom 7846
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1815  ax-4 1829  ax-5 1930  ax-6 1987  ax-7 2028  ax-8 2144  ax-9 2152  ax-ext 2734  ax-sep 5246  ax-nul 5256  ax-pr 5390  ax-un 7718
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3or 1099  df-3an 1100  df-tru 1563  df-fal 1573  df-ex 1800  df-sb 2091  df-clab 2741  df-cleq 2754  df-clel 2837  df-ne 2958  df-ral 3077  df-rex 3087  df-rab 3415  df-v 3456  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-pss 3924  df-nul 4286  df-if 4481  df-pw 4557  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-br 5101  df-opab 5163  df-tr 5208  df-eprel 5547  df-po 5555  df-so 5556  df-fr 5600  df-we 5602  df-ord 6349  df-on 6350  df-lim 6351  df-suc 6352  df-om 7847
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator