Theorem peano5nni 12156

Description: Peano's inductive postulate. Theorem I.36 (principle of mathematical induction) of [Apostol] p. 34. (Contributed by NM, 10-Jan-1997.) (Revised by Mario Carneiro, 17-Nov-2014.)

Assertion

Ref	Expression
peano5nni	⊢ ((1 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝑥 + 1) ∈ 𝐴) → ℕ ⊆ 𝐴)

Distinct variable group:   𝑥,𝐴

Proof of Theorem peano5nni

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

Step	Hyp	Ref	Expression
1		df-nn 12154	. . 3 ⊢ ℕ = (rec((𝑛 ∈ V ↦ (𝑛 + 1)), 1) “ ω)
2		df-ima 5646	. . 3 ⊢ (rec((𝑛 ∈ V ↦ (𝑛 + 1)), 1) “ ω) = ran (rec((𝑛 ∈ V ↦ (𝑛 + 1)), 1) ↾ ω)
3	1, 2	eqtri 2764	. 2 ⊢ ℕ = ran (rec((𝑛 ∈ V ↦ (𝑛 + 1)), 1) ↾ ω)
4		frfnom 8381	. . . . 5 ⊢ (rec((𝑛 ∈ V ↦ (𝑛 + 1)), 1) ↾ ω) Fn ω
5	4	a1i 11	. . . 4 ⊢ ((1 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝑥 + 1) ∈ 𝐴) → (rec((𝑛 ∈ V ↦ (𝑛 + 1)), 1) ↾ ω) Fn ω)
6		fveq2 6842	. . . . . . . 8 ⊢ (𝑦 = ∅ → ((rec((𝑛 ∈ V ↦ (𝑛 + 1)), 1) ↾ ω)‘𝑦) = ((rec((𝑛 ∈ V ↦ (𝑛 + 1)), 1) ↾ ω)‘∅))
7	6	eleq1d 2822	. . . . . . 7 ⊢ (𝑦 = ∅ → (((rec((𝑛 ∈ V ↦ (𝑛 + 1)), 1) ↾ ω)‘𝑦) ∈ 𝐴 ↔ ((rec((𝑛 ∈ V ↦ (𝑛 + 1)), 1) ↾ ω)‘∅) ∈ 𝐴))
8		fveq2 6842	. . . . . . . 8 ⊢ (𝑦 = 𝑧 → ((rec((𝑛 ∈ V ↦ (𝑛 + 1)), 1) ↾ ω)‘𝑦) = ((rec((𝑛 ∈ V ↦ (𝑛 + 1)), 1) ↾ ω)‘𝑧))
9	8	eleq1d 2822	. . . . . . 7 ⊢ (𝑦 = 𝑧 → (((rec((𝑛 ∈ V ↦ (𝑛 + 1)), 1) ↾ ω)‘𝑦) ∈ 𝐴 ↔ ((rec((𝑛 ∈ V ↦ (𝑛 + 1)), 1) ↾ ω)‘𝑧) ∈ 𝐴))
10		fveq2 6842	. . . . . . . 8 ⊢ (𝑦 = suc 𝑧 → ((rec((𝑛 ∈ V ↦ (𝑛 + 1)), 1) ↾ ω)‘𝑦) = ((rec((𝑛 ∈ V ↦ (𝑛 + 1)), 1) ↾ ω)‘suc 𝑧))
11	10	eleq1d 2822	. . . . . . 7 ⊢ (𝑦 = suc 𝑧 → (((rec((𝑛 ∈ V ↦ (𝑛 + 1)), 1) ↾ ω)‘𝑦) ∈ 𝐴 ↔ ((rec((𝑛 ∈ V ↦ (𝑛 + 1)), 1) ↾ ω)‘suc 𝑧) ∈ 𝐴))
12		ax-1cn 11109	. . . . . . . . 9 ⊢ 1 ∈ ℂ
13		fr0g 8382	. . . . . . . . 9 ⊢ (1 ∈ ℂ → ((rec((𝑛 ∈ V ↦ (𝑛 + 1)), 1) ↾ ω)‘∅) = 1)
14	12, 13	ax-mp 5	. . . . . . . 8 ⊢ ((rec((𝑛 ∈ V ↦ (𝑛 + 1)), 1) ↾ ω)‘∅) = 1
15		simpl 483	. . . . . . . 8 ⊢ ((1 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝑥 + 1) ∈ 𝐴) → 1 ∈ 𝐴)
16	14, 15	eqeltrid 2842	. . . . . . 7 ⊢ ((1 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝑥 + 1) ∈ 𝐴) → ((rec((𝑛 ∈ V ↦ (𝑛 + 1)), 1) ↾ ω)‘∅) ∈ 𝐴)
17		oveq1 7364	. . . . . . . . . . . 12 ⊢ (𝑥 = ((rec((𝑛 ∈ V ↦ (𝑛 + 1)), 1) ↾ ω)‘𝑧) → (𝑥 + 1) = (((rec((𝑛 ∈ V ↦ (𝑛 + 1)), 1) ↾ ω)‘𝑧) + 1))
18	17	eleq1d 2822	. . . . . . . . . . 11 ⊢ (𝑥 = ((rec((𝑛 ∈ V ↦ (𝑛 + 1)), 1) ↾ ω)‘𝑧) → ((𝑥 + 1) ∈ 𝐴 ↔ (((rec((𝑛 ∈ V ↦ (𝑛 + 1)), 1) ↾ ω)‘𝑧) + 1) ∈ 𝐴))
19	18	rspccv 3578	. . . . . . . . . 10 ⊢ (∀𝑥 ∈ 𝐴 (𝑥 + 1) ∈ 𝐴 → (((rec((𝑛 ∈ V ↦ (𝑛 + 1)), 1) ↾ ω)‘𝑧) ∈ 𝐴 → (((rec((𝑛 ∈ V ↦ (𝑛 + 1)), 1) ↾ ω)‘𝑧) + 1) ∈ 𝐴))
20	19	ad2antlr 725	. . . . . . . . 9 ⊢ (((1 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝑥 + 1) ∈ 𝐴) ∧ 𝑧 ∈ ω) → (((rec((𝑛 ∈ V ↦ (𝑛 + 1)), 1) ↾ ω)‘𝑧) ∈ 𝐴 → (((rec((𝑛 ∈ V ↦ (𝑛 + 1)), 1) ↾ ω)‘𝑧) + 1) ∈ 𝐴))
21		ovex 7390	. . . . . . . . . . . 12 ⊢ (((rec((𝑛 ∈ V ↦ (𝑛 + 1)), 1) ↾ ω)‘𝑧) + 1) ∈ V
22		eqid 2736	. . . . . . . . . . . . 13 ⊢ (rec((𝑛 ∈ V ↦ (𝑛 + 1)), 1) ↾ ω) = (rec((𝑛 ∈ V ↦ (𝑛 + 1)), 1) ↾ ω)
23		oveq1 7364	. . . . . . . . . . . . 13 ⊢ (𝑦 = 𝑛 → (𝑦 + 1) = (𝑛 + 1))
24		oveq1 7364	. . . . . . . . . . . . 13 ⊢ (𝑦 = ((rec((𝑛 ∈ V ↦ (𝑛 + 1)), 1) ↾ ω)‘𝑧) → (𝑦 + 1) = (((rec((𝑛 ∈ V ↦ (𝑛 + 1)), 1) ↾ ω)‘𝑧) + 1))
25	22, 23, 24	frsucmpt2 8386	. . . . . . . . . . . 12 ⊢ ((𝑧 ∈ ω ∧ (((rec((𝑛 ∈ V ↦ (𝑛 + 1)), 1) ↾ ω)‘𝑧) + 1) ∈ V) → ((rec((𝑛 ∈ V ↦ (𝑛 + 1)), 1) ↾ ω)‘suc 𝑧) = (((rec((𝑛 ∈ V ↦ (𝑛 + 1)), 1) ↾ ω)‘𝑧) + 1))
26	21, 25	mpan2 689	. . . . . . . . . . 11 ⊢ (𝑧 ∈ ω → ((rec((𝑛 ∈ V ↦ (𝑛 + 1)), 1) ↾ ω)‘suc 𝑧) = (((rec((𝑛 ∈ V ↦ (𝑛 + 1)), 1) ↾ ω)‘𝑧) + 1))
27	26	eleq1d 2822	. . . . . . . . . 10 ⊢ (𝑧 ∈ ω → (((rec((𝑛 ∈ V ↦ (𝑛 + 1)), 1) ↾ ω)‘suc 𝑧) ∈ 𝐴 ↔ (((rec((𝑛 ∈ V ↦ (𝑛 + 1)), 1) ↾ ω)‘𝑧) + 1) ∈ 𝐴))
28	27	adantl 482	. . . . . . . . 9 ⊢ (((1 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝑥 + 1) ∈ 𝐴) ∧ 𝑧 ∈ ω) → (((rec((𝑛 ∈ V ↦ (𝑛 + 1)), 1) ↾ ω)‘suc 𝑧) ∈ 𝐴 ↔ (((rec((𝑛 ∈ V ↦ (𝑛 + 1)), 1) ↾ ω)‘𝑧) + 1) ∈ 𝐴))
29	20, 28	sylibrd 258	. . . . . . . 8 ⊢ (((1 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝑥 + 1) ∈ 𝐴) ∧ 𝑧 ∈ ω) → (((rec((𝑛 ∈ V ↦ (𝑛 + 1)), 1) ↾ ω)‘𝑧) ∈ 𝐴 → ((rec((𝑛 ∈ V ↦ (𝑛 + 1)), 1) ↾ ω)‘suc 𝑧) ∈ 𝐴))
30	29	expcom 414	. . . . . . 7 ⊢ (𝑧 ∈ ω → ((1 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝑥 + 1) ∈ 𝐴) → (((rec((𝑛 ∈ V ↦ (𝑛 + 1)), 1) ↾ ω)‘𝑧) ∈ 𝐴 → ((rec((𝑛 ∈ V ↦ (𝑛 + 1)), 1) ↾ ω)‘suc 𝑧) ∈ 𝐴)))
31	7, 9, 11, 16, 30	finds2 7837	. . . . . 6 ⊢ (𝑦 ∈ ω → ((1 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝑥 + 1) ∈ 𝐴) → ((rec((𝑛 ∈ V ↦ (𝑛 + 1)), 1) ↾ ω)‘𝑦) ∈ 𝐴))
32	31	com12 32	. . . . 5 ⊢ ((1 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝑥 + 1) ∈ 𝐴) → (𝑦 ∈ ω → ((rec((𝑛 ∈ V ↦ (𝑛 + 1)), 1) ↾ ω)‘𝑦) ∈ 𝐴))
33	32	ralrimiv 3142	. . . 4 ⊢ ((1 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝑥 + 1) ∈ 𝐴) → ∀𝑦 ∈ ω ((rec((𝑛 ∈ V ↦ (𝑛 + 1)), 1) ↾ ω)‘𝑦) ∈ 𝐴)
34		ffnfv 7066	. . . 4 ⊢ ((rec((𝑛 ∈ V ↦ (𝑛 + 1)), 1) ↾ ω):ω⟶𝐴 ↔ ((rec((𝑛 ∈ V ↦ (𝑛 + 1)), 1) ↾ ω) Fn ω ∧ ∀𝑦 ∈ ω ((rec((𝑛 ∈ V ↦ (𝑛 + 1)), 1) ↾ ω)‘𝑦) ∈ 𝐴))
35	5, 33, 34	sylanbrc 583	. . 3 ⊢ ((1 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝑥 + 1) ∈ 𝐴) → (rec((𝑛 ∈ V ↦ (𝑛 + 1)), 1) ↾ ω):ω⟶𝐴)
36	35	frnd 6676	. 2 ⊢ ((1 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝑥 + 1) ∈ 𝐴) → ran (rec((𝑛 ∈ V ↦ (𝑛 + 1)), 1) ↾ ω) ⊆ 𝐴)
37	3, 36	eqsstrid 3992	1 ⊢ ((1 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝑥 + 1) ∈ 𝐴) → ℕ ⊆ 𝐴)

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 396   = wceq 1541   ∈ wcel 2106  ∀wral 3064  Vcvv 3445   ⊆ wss 3910  ∅c0 4282   ↦ cmpt 5188  ran crn 5634   ↾ cres 5635   “ cima 5636  suc csuc 6319   Fn wfn 6491  ⟶wf 6492  ‘cfv 6496  (class class class)co 7357  ωcom 7802  reccrdg 8355  ℂcc 11049  1c1 11052   + caddc 11054  ℕcn 12153

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2707  ax-sep 5256  ax-nul 5263  ax-pr 5384  ax-un 7672  ax-1cn 11109

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3or 1088  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2538  df-eu 2567  df-clab 2714  df-cleq 2728  df-clel 2814  df-nfc 2889  df-ne 2944  df-ral 3065  df-rex 3074  df-reu 3354  df-rab 3408  df-v 3447  df-sbc 3740  df-csb 3856  df-dif 3913  df-un 3915  df-in 3917  df-ss 3927  df-pss 3929  df-nul 4283  df-if 4487  df-pw 4562  df-sn 4587  df-pr 4589  df-op 4593  df-uni 4866  df-iun 4956  df-br 5106  df-opab 5168  df-mpt 5189  df-tr 5223  df-id 5531  df-eprel 5537  df-po 5545  df-so 5546  df-fr 5588  df-we 5590  df-xp 5639  df-rel 5640  df-cnv 5641  df-co 5642  df-dm 5643  df-rn 5644  df-res 5645  df-ima 5646  df-pred 6253  df-ord 6320  df-on 6321  df-lim 6322  df-suc 6323  df-iota 6448  df-fun 6498  df-fn 6499  df-f 6500  df-f1 6501  df-fo 6502  df-f1o 6503  df-fv 6504  df-ov 7360  df-om 7803  df-2nd 7922  df-frecs 8212  df-wrecs 8243  df-recs 8317  df-rdg 8356  df-nn 12154

This theorem is referenced by:  nnssre  12157  nnsscn  12158  dfnn2  12166  nnind  12171  nnindf  31715