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

Theorem peano5 6958
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 6965. (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 3694 . . . . . 6 (𝑦 ∈ (ω ∖ 𝐴) → ¬ 𝑦𝐴)
21adantl 480 . . . . 5 (((∅ ∈ 𝐴 ∧ ∀𝑥 ∈ ω (𝑥𝐴 → suc 𝑥𝐴)) ∧ 𝑦 ∈ (ω ∖ 𝐴)) → ¬ 𝑦𝐴)
3 eldifi 3693 . . . . . . . . . 10 (𝑦 ∈ (ω ∖ 𝐴) → 𝑦 ∈ ω)
43adantl 480 . . . . . . . . 9 ((∅ ∈ 𝐴𝑦 ∈ (ω ∖ 𝐴)) → 𝑦 ∈ ω)
5 elndif 3695 . . . . . . . . . 10 (∅ ∈ 𝐴 → ¬ ∅ ∈ (ω ∖ 𝐴))
6 eleq1 2675 . . . . . . . . . . . 12 (𝑦 = ∅ → (𝑦 ∈ (ω ∖ 𝐴) ↔ ∅ ∈ (ω ∖ 𝐴)))
76biimpcd 237 . . . . . . . . . . 11 (𝑦 ∈ (ω ∖ 𝐴) → (𝑦 = ∅ → ∅ ∈ (ω ∖ 𝐴)))
87necon3bd 2795 . . . . . . . . . 10 (𝑦 ∈ (ω ∖ 𝐴) → (¬ ∅ ∈ (ω ∖ 𝐴) → 𝑦 ≠ ∅))
95, 8mpan9 484 . . . . . . . . 9 ((∅ ∈ 𝐴𝑦 ∈ (ω ∖ 𝐴)) → 𝑦 ≠ ∅)
10 nnsuc 6951 . . . . . . . . 9 ((𝑦 ∈ ω ∧ 𝑦 ≠ ∅) → ∃𝑥 ∈ ω 𝑦 = suc 𝑥)
114, 9, 10syl2anc 690 . . . . . . . 8 ((∅ ∈ 𝐴𝑦 ∈ (ω ∖ 𝐴)) → ∃𝑥 ∈ ω 𝑦 = suc 𝑥)
1211adantlr 746 . . . . . . 7 (((∅ ∈ 𝐴 ∧ ∀𝑥 ∈ ω (𝑥𝐴 → suc 𝑥𝐴)) ∧ 𝑦 ∈ (ω ∖ 𝐴)) → ∃𝑥 ∈ ω 𝑦 = suc 𝑥)
1312adantr 479 . . . . . 6 ((((∅ ∈ 𝐴 ∧ ∀𝑥 ∈ ω (𝑥𝐴 → suc 𝑥𝐴)) ∧ 𝑦 ∈ (ω ∖ 𝐴)) ∧ ((ω ∖ 𝐴) ∩ 𝑦) = ∅) → ∃𝑥 ∈ ω 𝑦 = suc 𝑥)
14 nfra1 2924 . . . . . . . . . . 11 𝑥𝑥 ∈ ω (𝑥𝐴 → suc 𝑥𝐴)
15 nfv 1829 . . . . . . . . . . 11 𝑥(𝑦 ∈ (ω ∖ 𝐴) ∧ ((ω ∖ 𝐴) ∩ 𝑦) = ∅)
1614, 15nfan 1815 . . . . . . . . . 10 𝑥(∀𝑥 ∈ ω (𝑥𝐴 → suc 𝑥𝐴) ∧ (𝑦 ∈ (ω ∖ 𝐴) ∧ ((ω ∖ 𝐴) ∩ 𝑦) = ∅))
17 nfv 1829 . . . . . . . . . 10 𝑥 𝑦𝐴
18 rsp 2912 . . . . . . . . . . 11 (∀𝑥 ∈ ω (𝑥𝐴 → suc 𝑥𝐴) → (𝑥 ∈ ω → (𝑥𝐴 → suc 𝑥𝐴)))
19 vex 3175 . . . . . . . . . . . . . . . . . 18 𝑥 ∈ V
2019sucid 5707 . . . . . . . . . . . . . . . . 17 𝑥 ∈ suc 𝑥
21 eleq2 2676 . . . . . . . . . . . . . . . . 17 (𝑦 = suc 𝑥 → (𝑥𝑦𝑥 ∈ suc 𝑥))
2220, 21mpbiri 246 . . . . . . . . . . . . . . . 16 (𝑦 = suc 𝑥𝑥𝑦)
23 eleq1 2675 . . . . . . . . . . . . . . . . . 18 (𝑦 = suc 𝑥 → (𝑦 ∈ ω ↔ suc 𝑥 ∈ ω))
24 peano2b 6950 . . . . . . . . . . . . . . . . . 18 (𝑥 ∈ ω ↔ suc 𝑥 ∈ ω)
2523, 24syl6bbr 276 . . . . . . . . . . . . . . . . 17 (𝑦 = suc 𝑥 → (𝑦 ∈ ω ↔ 𝑥 ∈ ω))
26 minel 3984 . . . . . . . . . . . . . . . . . . 19 ((𝑥𝑦 ∧ ((ω ∖ 𝐴) ∩ 𝑦) = ∅) → ¬ 𝑥 ∈ (ω ∖ 𝐴))
27 neldif 3696 . . . . . . . . . . . . . . . . . . 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 2682 . . . . . . . . . . . . . 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 3007 . . . . . . . . 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 2983 . . 3 ((∅ ∈ 𝐴 ∧ ∀𝑥 ∈ ω (𝑥𝐴 → suc 𝑥𝐴)) → ¬ ∃𝑦 ∈ (ω ∖ 𝐴)((ω ∖ 𝐴) ∩ 𝑦) = ∅)
46 ordom 6943 . . . . 5 Ord ω
47 difss 3698 . . . . 5 (ω ∖ 𝐴) ⊆ ω
48 tz7.5 5647 . . . . 5 ((Ord ω ∧ (ω ∖ 𝐴) ⊆ ω ∧ (ω ∖ 𝐴) ≠ ∅) → ∃𝑦 ∈ (ω ∖ 𝐴)((ω ∖ 𝐴) ∩ 𝑦) = ∅)
4946, 47, 48mp3an12 1405 . . . 4 ((ω ∖ 𝐴) ≠ ∅ → ∃𝑦 ∈ (ω ∖ 𝐴)((ω ∖ 𝐴) ∩ 𝑦) = ∅)
5049necon1bi 2809 . . 3 (¬ ∃𝑦 ∈ (ω ∖ 𝐴)((ω ∖ 𝐴) ∩ 𝑦) = ∅ → (ω ∖ 𝐴) = ∅)
5145, 50syl 17 . 2 ((∅ ∈ 𝐴 ∧ ∀𝑥 ∈ ω (𝑥𝐴 → suc 𝑥𝐴)) → (ω ∖ 𝐴) = ∅)
52 ssdif0 3895 . 2 (ω ⊆ 𝐴 ↔ (ω ∖ 𝐴) = ∅)
5351, 52sylibr 222 1 ((∅ ∈ 𝐴 ∧ ∀𝑥 ∈ ω (𝑥𝐴 → suc 𝑥𝐴)) → ω ⊆ 𝐴)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 382   = wceq 1474  wcel 1976  wne 2779  wral 2895  wrex 2896  cdif 3536  cin 3538  wss 3539  c0 3873  Ord word 5625  suc csuc 5628  ωcom 6934
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1712  ax-4 1727  ax-5 1826  ax-6 1874  ax-7 1921  ax-8 1978  ax-9 1985  ax-10 2005  ax-11 2020  ax-12 2032  ax-13 2232  ax-ext 2589  ax-sep 4703  ax-nul 4712  ax-pr 4828  ax-un 6824
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 1700  df-sb 1867  df-eu 2461  df-mo 2462  df-clab 2596  df-cleq 2602  df-clel 2605  df-nfc 2739  df-ne 2781  df-ral 2900  df-rex 2901  df-rab 2904  df-v 3174  df-sbc 3402  df-dif 3542  df-un 3544  df-in 3546  df-ss 3553  df-pss 3555  df-nul 3874  df-if 4036  df-pw 4109  df-sn 4125  df-pr 4127  df-tp 4129  df-op 4131  df-uni 4367  df-br 4578  df-opab 4638  df-tr 4675  df-eprel 4939  df-po 4949  df-so 4950  df-fr 4987  df-we 4989  df-ord 5629  df-on 5630  df-lim 5631  df-suc 5632  df-om 6935
This theorem is referenced by:  find  6960  finds  6961  finds2  6963  omex  8400  dfom3  8404
  Copyright terms: Public domain W3C validator