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

Theorem peano5 6856
Description: The induction postulate: any class containing zero and closed under the successor operation contains all natural numbers. One of Peano's five postulates for arithmetic. Proposition 7.30(5) of [TakeutiZaring] p. 43, except our proof does not require the Axiom of Infinity. The more traditional statement of mathematical induction as a theorem schema, with a basis and an induction step, is derived from this theorem as theorem findes 6863. (Contributed by NM, 18-Feb-2004.)
Assertion
Ref Expression
peano5 ((∅ ∈ 𝐴 ∧ ∀𝑥 ∈ ω (𝑥𝐴 → suc 𝑥𝐴)) → ω ⊆ 𝐴)
Distinct variable group:   𝑥,𝐴

Proof of Theorem peano5
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 eldifn 3599 . . . . . 6 (𝑦 ∈ (ω ∖ 𝐴) → ¬ 𝑦𝐴)
21adantl 480 . . . . 5 (((∅ ∈ 𝐴 ∧ ∀𝑥 ∈ ω (𝑥𝐴 → suc 𝑥𝐴)) ∧ 𝑦 ∈ (ω ∖ 𝐴)) → ¬ 𝑦𝐴)
3 eldifi 3598 . . . . . . . . . 10 (𝑦 ∈ (ω ∖ 𝐴) → 𝑦 ∈ ω)
43adantl 480 . . . . . . . . 9 ((∅ ∈ 𝐴𝑦 ∈ (ω ∖ 𝐴)) → 𝑦 ∈ ω)
5 elndif 3600 . . . . . . . . . 10 (∅ ∈ 𝐴 → ¬ ∅ ∈ (ω ∖ 𝐴))
6 eleq1 2580 . . . . . . . . . . . 12 (𝑦 = ∅ → (𝑦 ∈ (ω ∖ 𝐴) ↔ ∅ ∈ (ω ∖ 𝐴)))
76biimpcd 237 . . . . . . . . . . 11 (𝑦 ∈ (ω ∖ 𝐴) → (𝑦 = ∅ → ∅ ∈ (ω ∖ 𝐴)))
87necon3bd 2700 . . . . . . . . . 10 (𝑦 ∈ (ω ∖ 𝐴) → (¬ ∅ ∈ (ω ∖ 𝐴) → 𝑦 ≠ ∅))
95, 8mpan9 484 . . . . . . . . 9 ((∅ ∈ 𝐴𝑦 ∈ (ω ∖ 𝐴)) → 𝑦 ≠ ∅)
10 nnsuc 6849 . . . . . . . . 9 ((𝑦 ∈ ω ∧ 𝑦 ≠ ∅) → ∃𝑥 ∈ ω 𝑦 = suc 𝑥)
114, 9, 10syl2anc 690 . . . . . . . 8 ((∅ ∈ 𝐴𝑦 ∈ (ω ∖ 𝐴)) → ∃𝑥 ∈ ω 𝑦 = suc 𝑥)
1211adantlr 746 . . . . . . 7 (((∅ ∈ 𝐴 ∧ ∀𝑥 ∈ ω (𝑥𝐴 → suc 𝑥𝐴)) ∧ 𝑦 ∈ (ω ∖ 𝐴)) → ∃𝑥 ∈ ω 𝑦 = suc 𝑥)
1312adantr 479 . . . . . 6 ((((∅ ∈ 𝐴 ∧ ∀𝑥 ∈ ω (𝑥𝐴 → suc 𝑥𝐴)) ∧ 𝑦 ∈ (ω ∖ 𝐴)) ∧ ((ω ∖ 𝐴) ∩ 𝑦) = ∅) → ∃𝑥 ∈ ω 𝑦 = suc 𝑥)
14 nfra1 2829 . . . . . . . . . . 11 𝑥𝑥 ∈ ω (𝑥𝐴 → suc 𝑥𝐴)
15 nfv 1796 . . . . . . . . . . 11 𝑥(𝑦 ∈ (ω ∖ 𝐴) ∧ ((ω ∖ 𝐴) ∩ 𝑦) = ∅)
1614, 15nfan 2059 . . . . . . . . . 10 𝑥(∀𝑥 ∈ ω (𝑥𝐴 → suc 𝑥𝐴) ∧ (𝑦 ∈ (ω ∖ 𝐴) ∧ ((ω ∖ 𝐴) ∩ 𝑦) = ∅))
17 nfv 1796 . . . . . . . . . 10 𝑥 𝑦𝐴
18 rsp 2817 . . . . . . . . . . 11 (∀𝑥 ∈ ω (𝑥𝐴 → suc 𝑥𝐴) → (𝑥 ∈ ω → (𝑥𝐴 → suc 𝑥𝐴)))
19 vex 3080 . . . . . . . . . . . . . . . . . 18 𝑥 ∈ V
2019sucid 5609 . . . . . . . . . . . . . . . . 17 𝑥 ∈ suc 𝑥
21 eleq2 2581 . . . . . . . . . . . . . . . . 17 (𝑦 = suc 𝑥 → (𝑥𝑦𝑥 ∈ suc 𝑥))
2220, 21mpbiri 246 . . . . . . . . . . . . . . . 16 (𝑦 = suc 𝑥𝑥𝑦)
23 eleq1 2580 . . . . . . . . . . . . . . . . . 18 (𝑦 = suc 𝑥 → (𝑦 ∈ ω ↔ suc 𝑥 ∈ ω))
24 peano2b 6848 . . . . . . . . . . . . . . . . . 18 (𝑥 ∈ ω ↔ suc 𝑥 ∈ ω)
2523, 24syl6bbr 276 . . . . . . . . . . . . . . . . 17 (𝑦 = suc 𝑥 → (𝑦 ∈ ω ↔ 𝑥 ∈ ω))
26 minel 3888 . . . . . . . . . . . . . . . . . . 19 ((𝑥𝑦 ∧ ((ω ∖ 𝐴) ∩ 𝑦) = ∅) → ¬ 𝑥 ∈ (ω ∖ 𝐴))
27 neldif 3601 . . . . . . . . . . . . . . . . . . 19 ((𝑥 ∈ ω ∧ ¬ 𝑥 ∈ (ω ∖ 𝐴)) → 𝑥𝐴)
2826, 27sylan2 489 . . . . . . . . . . . . . . . . . 18 ((𝑥 ∈ ω ∧ (𝑥𝑦 ∧ ((ω ∖ 𝐴) ∩ 𝑦) = ∅)) → 𝑥𝐴)
2928exp32 628 . . . . . . . . . . . . . . . . 17 (𝑥 ∈ ω → (𝑥𝑦 → (((ω ∖ 𝐴) ∩ 𝑦) = ∅ → 𝑥𝐴)))
3025, 29syl6bi 241 . . . . . . . . . . . . . . . 16 (𝑦 = suc 𝑥 → (𝑦 ∈ ω → (𝑥𝑦 → (((ω ∖ 𝐴) ∩ 𝑦) = ∅ → 𝑥𝐴))))
3122, 30mpid 42 . . . . . . . . . . . . . . 15 (𝑦 = suc 𝑥 → (𝑦 ∈ ω → (((ω ∖ 𝐴) ∩ 𝑦) = ∅ → 𝑥𝐴)))
323, 31syl5 33 . . . . . . . . . . . . . 14 (𝑦 = suc 𝑥 → (𝑦 ∈ (ω ∖ 𝐴) → (((ω ∖ 𝐴) ∩ 𝑦) = ∅ → 𝑥𝐴)))
3332impd 445 . . . . . . . . . . . . 13 (𝑦 = suc 𝑥 → ((𝑦 ∈ (ω ∖ 𝐴) ∧ ((ω ∖ 𝐴) ∩ 𝑦) = ∅) → 𝑥𝐴))
34 eleq1a 2587 . . . . . . . . . . . . . 14 (suc 𝑥𝐴 → (𝑦 = suc 𝑥𝑦𝐴))
3534com12 32 . . . . . . . . . . . . 13 (𝑦 = suc 𝑥 → (suc 𝑥𝐴𝑦𝐴))
3633, 35imim12d 78 . . . . . . . . . . . 12 (𝑦 = suc 𝑥 → ((𝑥𝐴 → suc 𝑥𝐴) → ((𝑦 ∈ (ω ∖ 𝐴) ∧ ((ω ∖ 𝐴) ∩ 𝑦) = ∅) → 𝑦𝐴)))
3736com13 85 . . . . . . . . . . 11 ((𝑦 ∈ (ω ∖ 𝐴) ∧ ((ω ∖ 𝐴) ∩ 𝑦) = ∅) → ((𝑥𝐴 → suc 𝑥𝐴) → (𝑦 = suc 𝑥𝑦𝐴)))
3818, 37sylan9 686 . . . . . . . . . 10 ((∀𝑥 ∈ ω (𝑥𝐴 → suc 𝑥𝐴) ∧ (𝑦 ∈ (ω ∖ 𝐴) ∧ ((ω ∖ 𝐴) ∩ 𝑦) = ∅)) → (𝑥 ∈ ω → (𝑦 = suc 𝑥𝑦𝐴)))
3916, 17, 38rexlimd 2912 . . . . . . . . 9 ((∀𝑥 ∈ ω (𝑥𝐴 → suc 𝑥𝐴) ∧ (𝑦 ∈ (ω ∖ 𝐴) ∧ ((ω ∖ 𝐴) ∩ 𝑦) = ∅)) → (∃𝑥 ∈ ω 𝑦 = suc 𝑥𝑦𝐴))
4039exp32 628 . . . . . . . 8 (∀𝑥 ∈ ω (𝑥𝐴 → suc 𝑥𝐴) → (𝑦 ∈ (ω ∖ 𝐴) → (((ω ∖ 𝐴) ∩ 𝑦) = ∅ → (∃𝑥 ∈ ω 𝑦 = suc 𝑥𝑦𝐴))))
4140a1i 11 . . . . . . 7 (∅ ∈ 𝐴 → (∀𝑥 ∈ ω (𝑥𝐴 → suc 𝑥𝐴) → (𝑦 ∈ (ω ∖ 𝐴) → (((ω ∖ 𝐴) ∩ 𝑦) = ∅ → (∃𝑥 ∈ ω 𝑦 = suc 𝑥𝑦𝐴)))))
4241imp41 616 . . . . . 6 ((((∅ ∈ 𝐴 ∧ ∀𝑥 ∈ ω (𝑥𝐴 → suc 𝑥𝐴)) ∧ 𝑦 ∈ (ω ∖ 𝐴)) ∧ ((ω ∖ 𝐴) ∩ 𝑦) = ∅) → (∃𝑥 ∈ ω 𝑦 = suc 𝑥𝑦𝐴))
4313, 42mpd 15 . . . . 5 ((((∅ ∈ 𝐴 ∧ ∀𝑥 ∈ ω (𝑥𝐴 → suc 𝑥𝐴)) ∧ 𝑦 ∈ (ω ∖ 𝐴)) ∧ ((ω ∖ 𝐴) ∩ 𝑦) = ∅) → 𝑦𝐴)
442, 43mtand 688 . . . 4 (((∅ ∈ 𝐴 ∧ ∀𝑥 ∈ ω (𝑥𝐴 → suc 𝑥𝐴)) ∧ 𝑦 ∈ (ω ∖ 𝐴)) → ¬ ((ω ∖ 𝐴) ∩ 𝑦) = ∅)
4544nrexdv 2888 . . 3 ((∅ ∈ 𝐴 ∧ ∀𝑥 ∈ ω (𝑥𝐴 → suc 𝑥𝐴)) → ¬ ∃𝑦 ∈ (ω ∖ 𝐴)((ω ∖ 𝐴) ∩ 𝑦) = ∅)
46 ordom 6841 . . . . 5 Ord ω
47 difss 3603 . . . . 5 (ω ∖ 𝐴) ⊆ ω
48 tz7.5 5551 . . . . 5 ((Ord ω ∧ (ω ∖ 𝐴) ⊆ ω ∧ (ω ∖ 𝐴) ≠ ∅) → ∃𝑦 ∈ (ω ∖ 𝐴)((ω ∖ 𝐴) ∩ 𝑦) = ∅)
4946, 47, 48mp3an12 1405 . . . 4 ((ω ∖ 𝐴) ≠ ∅ → ∃𝑦 ∈ (ω ∖ 𝐴)((ω ∖ 𝐴) ∩ 𝑦) = ∅)
5049necon1bi 2714 . . 3 (¬ ∃𝑦 ∈ (ω ∖ 𝐴)((ω ∖ 𝐴) ∩ 𝑦) = ∅ → (ω ∖ 𝐴) = ∅)
5145, 50syl 17 . 2 ((∅ ∈ 𝐴 ∧ ∀𝑥 ∈ ω (𝑥𝐴 → suc 𝑥𝐴)) → (ω ∖ 𝐴) = ∅)
52 ssdif0 3799 . 2 (ω ⊆ 𝐴 ↔ (ω ∖ 𝐴) = ∅)
5351, 52sylibr 222 1 ((∅ ∈ 𝐴 ∧ ∀𝑥 ∈ ω (𝑥𝐴 → suc 𝑥𝐴)) → ω ⊆ 𝐴)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 382   = wceq 1474  wcel 1938  wne 2684  wral 2800  wrex 2801  cdif 3441  cin 3443  wss 3444  c0 3777  Ord word 5529  suc csuc 5532  ωcom 6832
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1700  ax-4 1713  ax-5 1793  ax-6 1838  ax-7 1885  ax-8 1940  ax-9 1947  ax-10 1966  ax-11 1971  ax-12 1983  ax-13 2137  ax-ext 2494  ax-sep 4607  ax-nul 4616  ax-pr 4732  ax-un 6722
This theorem depends on definitions:  df-bi 195  df-or 383  df-an 384  df-3or 1031  df-3an 1032  df-tru 1477  df-ex 1695  df-nf 1699  df-sb 1831  df-eu 2366  df-mo 2367  df-clab 2501  df-cleq 2507  df-clel 2510  df-nfc 2644  df-ne 2686  df-ral 2805  df-rex 2806  df-rab 2809  df-v 3079  df-sbc 3307  df-dif 3447  df-un 3449  df-in 3451  df-ss 3458  df-pss 3460  df-nul 3778  df-if 3940  df-pw 4013  df-sn 4029  df-pr 4031  df-tp 4033  df-op 4035  df-uni 4271  df-br 4482  df-opab 4542  df-tr 4579  df-eprel 4843  df-po 4853  df-so 4854  df-fr 4891  df-we 4893  df-ord 5533  df-on 5534  df-lim 5535  df-suc 5536  df-om 6833
This theorem is referenced by:  find  6858  finds  6859  finds2  6861  omex  8298  dfom3  8302
  Copyright terms: Public domain W3C validator