Theorem peano5 7886

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 7893. (Contributed by NM, 18-Feb-2004.) Avoid ax-10 2176, ax-12 2213. (Revised by GG, 3-Oct-2024.)

Assertion

Ref	Expression
peano5	⊢ ((∅ ∈ 𝐴 ∧ ∀𝑥 ∈ ω (𝑥 ∈ 𝐴 → suc 𝑥 ∈ 𝐴)) → ω ⊆ 𝐴)

Distinct variable group:   𝑥,𝐴

Proof of Theorem peano5

Dummy variables 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eldifn 4086	. . . . . 6 ⊢ (𝑧 ∈ (ω ∖ 𝐴) → ¬ 𝑧 ∈ 𝐴)
2	1	adantl 486	. . . . 5 ⊢ (((∅ ∈ 𝐴 ∧ ∀𝑥 ∈ ω (𝑥 ∈ 𝐴 → suc 𝑥 ∈ 𝐴)) ∧ 𝑧 ∈ (ω ∖ 𝐴)) → ¬ 𝑧 ∈ 𝐴)
3		eldifi 4085	. . . . . . . 8 ⊢ (𝑧 ∈ (ω ∖ 𝐴) → 𝑧 ∈ ω)
4		elndif 4087	. . . . . . . . 9 ⊢ (∅ ∈ 𝐴 → ¬ ∅ ∈ (ω ∖ 𝐴))
5		eleq1 2851	. . . . . . . . . . 11 ⊢ (𝑧 = ∅ → (𝑧 ∈ (ω ∖ 𝐴) ↔ ∅ ∈ (ω ∖ 𝐴)))
6	5	biimpcd 252	. . . . . . . . . 10 ⊢ (𝑧 ∈ (ω ∖ 𝐴) → (𝑧 = ∅ → ∅ ∈ (ω ∖ 𝐴)))
7	6	necon3bd 2972	. . . . . . . . 9 ⊢ (𝑧 ∈ (ω ∖ 𝐴) → (¬ ∅ ∈ (ω ∖ 𝐴) → 𝑧 ≠ ∅))
8	4, 7	mpan9 515	. . . . . . . 8 ⊢ ((∅ ∈ 𝐴 ∧ 𝑧 ∈ (ω ∖ 𝐴)) → 𝑧 ≠ ∅)
9		nnsuc 7876	. . . . . . . 8 ⊢ ((𝑧 ∈ ω ∧ 𝑧 ≠ ∅) → ∃𝑦 ∈ ω 𝑧 = suc 𝑦)
10	3, 8, 9	syl2an2 698	. . . . . . 7 ⊢ ((∅ ∈ 𝐴 ∧ 𝑧 ∈ (ω ∖ 𝐴)) → ∃𝑦 ∈ ω 𝑧 = suc 𝑦)
11	10	ad4ant13 763	. . . . . 6 ⊢ ((((∅ ∈ 𝐴 ∧ ∀𝑥 ∈ ω (𝑥 ∈ 𝐴 → suc 𝑥 ∈ 𝐴)) ∧ 𝑧 ∈ (ω ∖ 𝐴)) ∧ ((ω ∖ 𝐴) ∩ 𝑧) = ∅) → ∃𝑦 ∈ ω 𝑧 = suc 𝑦)
12		eleq1w 2846	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝑦 → (𝑥 ∈ 𝐴 ↔ 𝑦 ∈ 𝐴))
13		suceq 6429	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 𝑦 → suc 𝑥 = suc 𝑦)
14	13	eleq1d 2848	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝑦 → (suc 𝑥 ∈ 𝐴 ↔ suc 𝑦 ∈ 𝐴))
15	12, 14	imbi12d 347	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝑦 → ((𝑥 ∈ 𝐴 → suc 𝑥 ∈ 𝐴) ↔ (𝑦 ∈ 𝐴 → suc 𝑦 ∈ 𝐴)))
16	15	rspccv 3578	. . . . . . . . . . 11 ⊢ (∀𝑥 ∈ ω (𝑥 ∈ 𝐴 → suc 𝑥 ∈ 𝐴) → (𝑦 ∈ ω → (𝑦 ∈ 𝐴 → suc 𝑦 ∈ 𝐴)))
17		vex 3459	. . . . . . . . . . . . . . . . . 18 ⊢ 𝑦 ∈ V
18	17	sucid 6445	. . . . . . . . . . . . . . . . 17 ⊢ 𝑦 ∈ suc 𝑦
19		eleq2 2852	. . . . . . . . . . . . . . . . 17 ⊢ (𝑧 = suc 𝑦 → (𝑦 ∈ 𝑧 ↔ 𝑦 ∈ suc 𝑦))
20	18, 19	mpbiri 261	. . . . . . . . . . . . . . . 16 ⊢ (𝑧 = suc 𝑦 → 𝑦 ∈ 𝑧)
21		eleq1 2851	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑧 = suc 𝑦 → (𝑧 ∈ ω ↔ suc 𝑦 ∈ ω))
22		peano2b 7875	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑦 ∈ ω ↔ suc 𝑦 ∈ ω)
23	21, 22	bitr4di 292	. . . . . . . . . . . . . . . . 17 ⊢ (𝑧 = suc 𝑦 → (𝑧 ∈ ω ↔ 𝑦 ∈ ω))
24		minel 4426	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑦 ∈ 𝑧 ∧ ((ω ∖ 𝐴) ∩ 𝑧) = ∅) → ¬ 𝑦 ∈ (ω ∖ 𝐴))
25		neldif 4088	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑦 ∈ ω ∧ ¬ 𝑦 ∈ (ω ∖ 𝐴)) → 𝑦 ∈ 𝐴)
26	24, 25	sylan2 604	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑦 ∈ ω ∧ (𝑦 ∈ 𝑧 ∧ ((ω ∖ 𝐴) ∩ 𝑧) = ∅)) → 𝑦 ∈ 𝐴)
27	26	exp32 425	. . . . . . . . . . . . . . . . 17 ⊢ (𝑦 ∈ ω → (𝑦 ∈ 𝑧 → (((ω ∖ 𝐴) ∩ 𝑧) = ∅ → 𝑦 ∈ 𝐴)))
28	23, 27	biimtrdi 256	. . . . . . . . . . . . . . . 16 ⊢ (𝑧 = suc 𝑦 → (𝑧 ∈ ω → (𝑦 ∈ 𝑧 → (((ω ∖ 𝐴) ∩ 𝑧) = ∅ → 𝑦 ∈ 𝐴))))
29	20, 28	mpid 45	. . . . . . . . . . . . . . 15 ⊢ (𝑧 = suc 𝑦 → (𝑧 ∈ ω → (((ω ∖ 𝐴) ∩ 𝑧) = ∅ → 𝑦 ∈ 𝐴)))
30	3, 29	syl5 35	. . . . . . . . . . . . . 14 ⊢ (𝑧 = suc 𝑦 → (𝑧 ∈ (ω ∖ 𝐴) → (((ω ∖ 𝐴) ∩ 𝑧) = ∅ → 𝑦 ∈ 𝐴)))
31	30	impd 415	. . . . . . . . . . . . 13 ⊢ (𝑧 = suc 𝑦 → ((𝑧 ∈ (ω ∖ 𝐴) ∧ ((ω ∖ 𝐴) ∩ 𝑧) = ∅) → 𝑦 ∈ 𝐴))
32		eleq1a 2858	. . . . . . . . . . . . . 14 ⊢ (suc 𝑦 ∈ 𝐴 → (𝑧 = suc 𝑦 → 𝑧 ∈ 𝐴))
33	32	com12 33	. . . . . . . . . . . . 13 ⊢ (𝑧 = suc 𝑦 → (suc 𝑦 ∈ 𝐴 → 𝑧 ∈ 𝐴))
34	31, 33	imim12d 82	. . . . . . . . . . . 12 ⊢ (𝑧 = suc 𝑦 → ((𝑦 ∈ 𝐴 → suc 𝑦 ∈ 𝐴) → ((𝑧 ∈ (ω ∖ 𝐴) ∧ ((ω ∖ 𝐴) ∩ 𝑧) = ∅) → 𝑧 ∈ 𝐴)))
35	34	com13 89	. . . . . . . . . . 11 ⊢ ((𝑧 ∈ (ω ∖ 𝐴) ∧ ((ω ∖ 𝐴) ∩ 𝑧) = ∅) → ((𝑦 ∈ 𝐴 → suc 𝑦 ∈ 𝐴) → (𝑧 = suc 𝑦 → 𝑧 ∈ 𝐴)))
36	16, 35	sylan9 516	. . . . . . . . . 10 ⊢ ((∀𝑥 ∈ ω (𝑥 ∈ 𝐴 → suc 𝑥 ∈ 𝐴) ∧ (𝑧 ∈ (ω ∖ 𝐴) ∧ ((ω ∖ 𝐴) ∩ 𝑧) = ∅)) → (𝑦 ∈ ω → (𝑧 = suc 𝑦 → 𝑧 ∈ 𝐴)))
37	36	rexlimdv 3164	. . . . . . . . 9 ⊢ ((∀𝑥 ∈ ω (𝑥 ∈ 𝐴 → suc 𝑥 ∈ 𝐴) ∧ (𝑧 ∈ (ω ∖ 𝐴) ∧ ((ω ∖ 𝐴) ∩ 𝑧) = ∅)) → (∃𝑦 ∈ ω 𝑧 = suc 𝑦 → 𝑧 ∈ 𝐴))
38	37	exp32 425	. . . . . . . 8 ⊢ (∀𝑥 ∈ ω (𝑥 ∈ 𝐴 → suc 𝑥 ∈ 𝐴) → (𝑧 ∈ (ω ∖ 𝐴) → (((ω ∖ 𝐴) ∩ 𝑧) = ∅ → (∃𝑦 ∈ ω 𝑧 = suc 𝑦 → 𝑧 ∈ 𝐴))))
39	38	a1i 11	. . . . . . 7 ⊢ (∅ ∈ 𝐴 → (∀𝑥 ∈ ω (𝑥 ∈ 𝐴 → suc 𝑥 ∈ 𝐴) → (𝑧 ∈ (ω ∖ 𝐴) → (((ω ∖ 𝐴) ∩ 𝑧) = ∅ → (∃𝑦 ∈ ω 𝑧 = suc 𝑦 → 𝑧 ∈ 𝐴)))))
40	39	imp41 430	. . . . . 6 ⊢ ((((∅ ∈ 𝐴 ∧ ∀𝑥 ∈ ω (𝑥 ∈ 𝐴 → suc 𝑥 ∈ 𝐴)) ∧ 𝑧 ∈ (ω ∖ 𝐴)) ∧ ((ω ∖ 𝐴) ∩ 𝑧) = ∅) → (∃𝑦 ∈ ω 𝑧 = suc 𝑦 → 𝑧 ∈ 𝐴))
41	11, 40	mpd 16	. . . . 5 ⊢ ((((∅ ∈ 𝐴 ∧ ∀𝑥 ∈ ω (𝑥 ∈ 𝐴 → suc 𝑥 ∈ 𝐴)) ∧ 𝑧 ∈ (ω ∖ 𝐴)) ∧ ((ω ∖ 𝐴) ∩ 𝑧) = ∅) → 𝑧 ∈ 𝐴)
42	2, 41	mtand 827	. . . 4 ⊢ (((∅ ∈ 𝐴 ∧ ∀𝑥 ∈ ω (𝑥 ∈ 𝐴 → suc 𝑥 ∈ 𝐴)) ∧ 𝑧 ∈ (ω ∖ 𝐴)) → ¬ ((ω ∖ 𝐴) ∩ 𝑧) = ∅)
43	42	nrexdv 3160	. . 3 ⊢ ((∅ ∈ 𝐴 ∧ ∀𝑥 ∈ ω (𝑥 ∈ 𝐴 → suc 𝑥 ∈ 𝐴)) → ¬ ∃𝑧 ∈ (ω ∖ 𝐴)((ω ∖ 𝐴) ∩ 𝑧) = ∅)
44		ordom 7868	. . . . 5 ⊢ Ord ω
45		difss 4090	. . . . 5 ⊢ (ω ∖ 𝐴) ⊆ ω
46		tz7.5 6381	. . . . 5 ⊢ ((Ord ω ∧ (ω ∖ 𝐴) ⊆ ω ∧ (ω ∖ 𝐴) ≠ ∅) → ∃𝑧 ∈ (ω ∖ 𝐴)((ω ∖ 𝐴) ∩ 𝑧) = ∅)
47	44, 45, 46	mp3an12 1480	. . . 4 ⊢ ((ω ∖ 𝐴) ≠ ∅ → ∃𝑧 ∈ (ω ∖ 𝐴)((ω ∖ 𝐴) ∩ 𝑧) = ∅)
48	47	necon1bi 2986	. . 3 ⊢ (¬ ∃𝑧 ∈ (ω ∖ 𝐴)((ω ∖ 𝐴) ∩ 𝑧) = ∅ → (ω ∖ 𝐴) = ∅)
49	43, 48	syl 18	. 2 ⊢ ((∅ ∈ 𝐴 ∧ ∀𝑥 ∈ ω (𝑥 ∈ 𝐴 → suc 𝑥 ∈ 𝐴)) → (ω ∖ 𝐴) = ∅)
50		ssdif0 4321	. 2 ⊢ (ω ⊆ 𝐴 ↔ (ω ∖ 𝐴) = ∅)
51	49, 50	sylibr 237	1 ⊢ ((∅ ∈ 𝐴 ∧ ∀𝑥 ∈ ω (𝑥 ∈ 𝐴 → suc 𝑥 ∈ 𝐴)) → ω ⊆ 𝐴)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 400   = wceq 1570   ∈ wcel 2143   ≠ wne 2958  ∀wral 3079  ∃wrex 3089   ∖ cdif 3902   ∩ cin 3904   ⊆ wss 3905  ∅c0 4286  Ord word 6359  suc csuc 6362  ωcom 7858

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-ext 2735  ax-sep 5257  ax-nul 5269  ax-pr 5404  ax-un 7732

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-sb 2097  df-clab 2742  df-cleq 2755  df-clel 2838  df-ne 2959  df-ral 3080  df-rex 3090  df-rab 3417  df-v 3457  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-pss 3925  df-nul 4287  df-if 4488  df-pw 4564  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-br 5110  df-opab 5174  df-tr 5219  df-eprel 5561  df-po 5569  df-so 5570  df-fr 5614  df-we 5616  df-ord 6363  df-on 6364  df-lim 6365  df-suc 6366  df-om 7859

This theorem is referenced by:  find  7888  finds  7889  finds2  7891  omex  9608  dfom3  9612