Theorem peano2nn 9266

Description: Peano postulate: a successor of a positive integer is a positive integer. (Contributed by NM, 11-Jan-1997.) (Revised by Mario Carneiro, 17-Nov-2014.)

Assertion

Ref	Expression
peano2nn	⊢ (𝐴 ∈ ℕ → (𝐴 + 1) ∈ ℕ)

Proof of Theorem peano2nn

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

Step	Hyp	Ref	Expression
1		dfnn2 9256	. . . . . 6 ⊢ ℕ = ∩ {𝑥 ∣ (1 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥)}
2	1	eleq2i 2301	. . . . 5 ⊢ (𝐴 ∈ ℕ ↔ 𝐴 ∈ ∩ {𝑥 ∣ (1 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥)})
3		elintg 3962	. . . . 5 ⊢ (𝐴 ∈ ℕ → (𝐴 ∈ ∩ {𝑥 ∣ (1 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥)} ↔ ∀𝑧 ∈ {𝑥 ∣ (1 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥)}𝐴 ∈ 𝑧))
4	2, 3	bitrid 192	. . . 4 ⊢ (𝐴 ∈ ℕ → (𝐴 ∈ ℕ ↔ ∀𝑧 ∈ {𝑥 ∣ (1 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥)}𝐴 ∈ 𝑧))
5	4	ibi 176	. . 3 ⊢ (𝐴 ∈ ℕ → ∀𝑧 ∈ {𝑥 ∣ (1 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥)}𝐴 ∈ 𝑧)
6		vex 2818	. . . . . . . 8 ⊢ 𝑧 ∈ V
7		eleq2 2298	. . . . . . . . 9 ⊢ (𝑥 = 𝑧 → (1 ∈ 𝑥 ↔ 1 ∈ 𝑧))
8		eleq2 2298	. . . . . . . . . 10 ⊢ (𝑥 = 𝑧 → ((𝑦 + 1) ∈ 𝑥 ↔ (𝑦 + 1) ∈ 𝑧))
9	8	raleqbi1dv 2755	. . . . . . . . 9 ⊢ (𝑥 = 𝑧 → (∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥 ↔ ∀𝑦 ∈ 𝑧 (𝑦 + 1) ∈ 𝑧))
10	7, 9	anbi12d 473	. . . . . . . 8 ⊢ (𝑥 = 𝑧 → ((1 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥) ↔ (1 ∈ 𝑧 ∧ ∀𝑦 ∈ 𝑧 (𝑦 + 1) ∈ 𝑧)))
11	6, 10	elab 2964	. . . . . . 7 ⊢ (𝑧 ∈ {𝑥 ∣ (1 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥)} ↔ (1 ∈ 𝑧 ∧ ∀𝑦 ∈ 𝑧 (𝑦 + 1) ∈ 𝑧))
12	11	simprbi 275	. . . . . 6 ⊢ (𝑧 ∈ {𝑥 ∣ (1 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥)} → ∀𝑦 ∈ 𝑧 (𝑦 + 1) ∈ 𝑧)
13		oveq1 6065	. . . . . . . 8 ⊢ (𝑦 = 𝐴 → (𝑦 + 1) = (𝐴 + 1))
14	13	eleq1d 2303	. . . . . . 7 ⊢ (𝑦 = 𝐴 → ((𝑦 + 1) ∈ 𝑧 ↔ (𝐴 + 1) ∈ 𝑧))
15	14	rspcva 2921	. . . . . 6 ⊢ ((𝐴 ∈ 𝑧 ∧ ∀𝑦 ∈ 𝑧 (𝑦 + 1) ∈ 𝑧) → (𝐴 + 1) ∈ 𝑧)
16	12, 15	sylan2 286	. . . . 5 ⊢ ((𝐴 ∈ 𝑧 ∧ 𝑧 ∈ {𝑥 ∣ (1 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥)}) → (𝐴 + 1) ∈ 𝑧)
17	16	expcom 116	. . . 4 ⊢ (𝑧 ∈ {𝑥 ∣ (1 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥)} → (𝐴 ∈ 𝑧 → (𝐴 + 1) ∈ 𝑧))
18	17	ralimia 2605	. . 3 ⊢ (∀𝑧 ∈ {𝑥 ∣ (1 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥)}𝐴 ∈ 𝑧 → ∀𝑧 ∈ {𝑥 ∣ (1 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥)} (𝐴 + 1) ∈ 𝑧)
19	5, 18	syl 14	. 2 ⊢ (𝐴 ∈ ℕ → ∀𝑧 ∈ {𝑥 ∣ (1 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥)} (𝐴 + 1) ∈ 𝑧)
20		nnre 9261	. . . 4 ⊢ (𝐴 ∈ ℕ → 𝐴 ∈ ℝ)
21		1red 8305	. . . 4 ⊢ (𝐴 ∈ ℕ → 1 ∈ ℝ)
22	20, 21	readdcld 8319	. . 3 ⊢ (𝐴 ∈ ℕ → (𝐴 + 1) ∈ ℝ)
23	1	eleq2i 2301	. . . 4 ⊢ ((𝐴 + 1) ∈ ℕ ↔ (𝐴 + 1) ∈ ∩ {𝑥 ∣ (1 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥)})
24		elintg 3962	. . . 4 ⊢ ((𝐴 + 1) ∈ ℝ → ((𝐴 + 1) ∈ ∩ {𝑥 ∣ (1 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥)} ↔ ∀𝑧 ∈ {𝑥 ∣ (1 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥)} (𝐴 + 1) ∈ 𝑧))
25	23, 24	bitrid 192	. . 3 ⊢ ((𝐴 + 1) ∈ ℝ → ((𝐴 + 1) ∈ ℕ ↔ ∀𝑧 ∈ {𝑥 ∣ (1 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥)} (𝐴 + 1) ∈ 𝑧))
26	22, 25	syl 14	. 2 ⊢ (𝐴 ∈ ℕ → ((𝐴 + 1) ∈ ℕ ↔ ∀𝑧 ∈ {𝑥 ∣ (1 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥)} (𝐴 + 1) ∈ 𝑧))
27	19, 26	mpbird 167	1 ⊢ (𝐴 ∈ ℕ → (𝐴 + 1) ∈ ℕ)

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1398   ∈ wcel 2205  {cab 2220  ∀wral 2522  ∩ cint 3954  (class class class)co 6058  ℝcr 8142  1c1 8144   + caddc 8146  ℕcn 9254

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-ext 2216  ax-sep 4233  ax-cnex 8234  ax-resscn 8235  ax-1re 8237  ax-addrcl 8240

This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ral 2527  df-rex 2528  df-v 2817  df-un 3218  df-in 3220  df-ss 3227  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-int 3955  df-br 4115  df-iota 5317  df-fv 5365  df-ov 6061  df-inn 9255

This theorem is referenced by:  peano2nnd  9269  nnind  9270  nnaddcl  9274  2nn  9416  3nn  9417  4nn  9418  5nn  9419  6nn  9420  7nn  9421  8nn  9422  9nn  9423  nneoor  9698  10nn  9742  nnsplit  10493  fzonn0p1p1  10580  expp1  10932  facp1  11117  resqrexlemfp1  11719  resqrexlemcalc3  11726  trireciplem  12211  trirecip  12212  cvgratnnlemnexp  12235  cvgratz  12243  nno  12617  nnoddm1d2  12621  rplpwr  12748  prmind2  12842  sqrt2irr  12884  pcmpt  13066  pockthi  13081  dec5nprm  13137  mulgnnp1  13883  2sqlem10  16124