Theorem dfnn2 12258

Description: Alternate definition of the set of positive integers. This was our original definition, before the current df-nn 12246 replaced it. This definition requires the axiom of infinity to ensure it has the properties we expect. (Contributed by Jeff Hankins, 12-Sep-2013.) (Revised by Mario Carneiro, 3-May-2014.)

Assertion

Ref	Expression
dfnn2	⊢ ℕ = ∩ {𝑥 ∣ (1 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥)}

Distinct variable group:   𝑥,𝑦

Proof of Theorem dfnn2

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		1ex 11236	. . . . 5 ⊢ 1 ∈ V
2	1	elintab 4939	. . . 4 ⊢ (1 ∈ ∩ {𝑥 ∣ (1 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥)} ↔ ∀𝑥((1 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥) → 1 ∈ 𝑥))
3		simpl 482	. . . 4 ⊢ ((1 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥) → 1 ∈ 𝑥)
4	2, 3	mpgbir 1799	. . 3 ⊢ 1 ∈ ∩ {𝑥 ∣ (1 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥)}
5		oveq1 7417	. . . . . . . . . 10 ⊢ (𝑦 = 𝑧 → (𝑦 + 1) = (𝑧 + 1))
6	5	eleq1d 2820	. . . . . . . . 9 ⊢ (𝑦 = 𝑧 → ((𝑦 + 1) ∈ 𝑥 ↔ (𝑧 + 1) ∈ 𝑥))
7	6	rspccv 3603	. . . . . . . 8 ⊢ (∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥 → (𝑧 ∈ 𝑥 → (𝑧 + 1) ∈ 𝑥))
8	7	adantl 481	. . . . . . 7 ⊢ ((1 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥) → (𝑧 ∈ 𝑥 → (𝑧 + 1) ∈ 𝑥))
9	8	a2i 14	. . . . . 6 ⊢ (((1 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥) → 𝑧 ∈ 𝑥) → ((1 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥) → (𝑧 + 1) ∈ 𝑥))
10	9	alimi 1811	. . . . 5 ⊢ (∀𝑥((1 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥) → 𝑧 ∈ 𝑥) → ∀𝑥((1 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥) → (𝑧 + 1) ∈ 𝑥))
11		vex 3468	. . . . . 6 ⊢ 𝑧 ∈ V
12	11	elintab 4939	. . . . 5 ⊢ (𝑧 ∈ ∩ {𝑥 ∣ (1 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥)} ↔ ∀𝑥((1 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥) → 𝑧 ∈ 𝑥))
13		ovex 7443	. . . . . 6 ⊢ (𝑧 + 1) ∈ V
14	13	elintab 4939	. . . . 5 ⊢ ((𝑧 + 1) ∈ ∩ {𝑥 ∣ (1 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥)} ↔ ∀𝑥((1 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥) → (𝑧 + 1) ∈ 𝑥))
15	10, 12, 14	3imtr4i 292	. . . 4 ⊢ (𝑧 ∈ ∩ {𝑥 ∣ (1 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥)} → (𝑧 + 1) ∈ ∩ {𝑥 ∣ (1 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥)})
16	15	rgen 3054	. . 3 ⊢ ∀𝑧 ∈ ∩ {𝑥 ∣ (1 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥)} (𝑧 + 1) ∈ ∩ {𝑥 ∣ (1 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥)}
17		peano5nni 12248	. . 3 ⊢ ((1 ∈ ∩ {𝑥 ∣ (1 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥)} ∧ ∀𝑧 ∈ ∩ {𝑥 ∣ (1 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥)} (𝑧 + 1) ∈ ∩ {𝑥 ∣ (1 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥)}) → ℕ ⊆ ∩ {𝑥 ∣ (1 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥)})
18	4, 16, 17	mp2an 692	. 2 ⊢ ℕ ⊆ ∩ {𝑥 ∣ (1 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥)}
19		1nn 12256	. . . 4 ⊢ 1 ∈ ℕ
20		peano2nn 12257	. . . . 5 ⊢ (𝑦 ∈ ℕ → (𝑦 + 1) ∈ ℕ)
21	20	rgen 3054	. . . 4 ⊢ ∀𝑦 ∈ ℕ (𝑦 + 1) ∈ ℕ
22		nnex 12251	. . . . 5 ⊢ ℕ ∈ V
23		eleq2 2824	. . . . . 6 ⊢ (𝑥 = ℕ → (1 ∈ 𝑥 ↔ 1 ∈ ℕ))
24		eleq2 2824	. . . . . . 7 ⊢ (𝑥 = ℕ → ((𝑦 + 1) ∈ 𝑥 ↔ (𝑦 + 1) ∈ ℕ))
25	24	raleqbi1dv 3321	. . . . . 6 ⊢ (𝑥 = ℕ → (∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥 ↔ ∀𝑦 ∈ ℕ (𝑦 + 1) ∈ ℕ))
26	23, 25	anbi12d 632	. . . . 5 ⊢ (𝑥 = ℕ → ((1 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥) ↔ (1 ∈ ℕ ∧ ∀𝑦 ∈ ℕ (𝑦 + 1) ∈ ℕ)))
27	22, 26	elab 3663	. . . 4 ⊢ (ℕ ∈ {𝑥 ∣ (1 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥)} ↔ (1 ∈ ℕ ∧ ∀𝑦 ∈ ℕ (𝑦 + 1) ∈ ℕ))
28	19, 21, 27	mpbir2an 711	. . 3 ⊢ ℕ ∈ {𝑥 ∣ (1 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥)}
29		intss1 4944	. . 3 ⊢ (ℕ ∈ {𝑥 ∣ (1 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥)} → ∩ {𝑥 ∣ (1 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥)} ⊆ ℕ)
30	28, 29	ax-mp 5	. 2 ⊢ ∩ {𝑥 ∣ (1 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥)} ⊆ ℕ
31	18, 30	eqssi 3980	1 ⊢ ℕ = ∩ {𝑥 ∣ (1 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥)}

Syntax hints:   → wi 4   ∧ wa 395  ∀wal 1538   = wceq 1540   ∈ wcel 2109  {cab 2714  ∀wral 3052   ⊆ wss 3931  ∩ cint 4927  (class class class)co 7410  1c1 11135   + caddc 11137  ℕcn 12245

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2708  ax-sep 5271  ax-nul 5281  ax-pr 5407  ax-un 7734  ax-cnex 11190  ax-1cn 11192  ax-addcl 11194

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2540  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2810  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3062  df-reu 3365  df-rab 3421  df-v 3466  df-sbc 3771  df-csb 3880  df-dif 3934  df-un 3936  df-in 3938  df-ss 3948  df-pss 3951  df-nul 4314  df-if 4506  df-pw 4582  df-sn 4607  df-pr 4609  df-op 4613  df-uni 4889  df-int 4928  df-iun 4974  df-br 5125  df-opab 5187  df-mpt 5207  df-tr 5235  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-we 5613  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-pred 6295  df-ord 6360  df-on 6361  df-lim 6362  df-suc 6363  df-iota 6489  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-ov 7413  df-om 7867  df-2nd 7994  df-frecs 8285  df-wrecs 8316  df-recs 8390  df-rdg 8429  df-nn 12246

This theorem is referenced by:  dfnn3  12259