Theorem dfuzi 9580

Description: An expression for the upper integers that start at 𝑁 that is analogous to dfnn2 9135 for positive integers. (Contributed by NM, 6-Jul-2005.) (Proof shortened by Mario Carneiro, 3-May-2014.)

Hypothesis

Ref	Expression
dfuz.1	⊢ 𝑁 ∈ ℤ

Assertion

Ref	Expression
dfuzi	⊢ {𝑧 ∈ ℤ ∣ 𝑁 ≤ 𝑧} = ∩ {𝑥 ∣ (𝑁 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥)}

Distinct variable group:   𝑥,𝑦,𝑧,𝑁

Proof of Theorem dfuzi

Step	Hyp	Ref	Expression
1		ssintab 3943	. . 3 ⊢ ({𝑧 ∈ ℤ ∣ 𝑁 ≤ 𝑧} ⊆ ∩ {𝑥 ∣ (𝑁 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥)} ↔ ∀𝑥((𝑁 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥) → {𝑧 ∈ ℤ ∣ 𝑁 ≤ 𝑧} ⊆ 𝑥))
2		dfuz.1	. . . 4 ⊢ 𝑁 ∈ ℤ
3	2	peano5uzi 9579	. . 3 ⊢ ((𝑁 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥) → {𝑧 ∈ ℤ ∣ 𝑁 ≤ 𝑧} ⊆ 𝑥)
4	1, 3	mpgbir 1499	. 2 ⊢ {𝑧 ∈ ℤ ∣ 𝑁 ≤ 𝑧} ⊆ ∩ {𝑥 ∣ (𝑁 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥)}
5	2	zrei 9475	. . . . . 6 ⊢ 𝑁 ∈ ℝ
6	5	leidi 8655	. . . . 5 ⊢ 𝑁 ≤ 𝑁
7		breq2 4090	. . . . . 6 ⊢ (𝑧 = 𝑁 → (𝑁 ≤ 𝑧 ↔ 𝑁 ≤ 𝑁))
8	7	elrab 2960	. . . . 5 ⊢ (𝑁 ∈ {𝑧 ∈ ℤ ∣ 𝑁 ≤ 𝑧} ↔ (𝑁 ∈ ℤ ∧ 𝑁 ≤ 𝑁))
9	2, 6, 8	mpbir2an 948	. . . 4 ⊢ 𝑁 ∈ {𝑧 ∈ ℤ ∣ 𝑁 ≤ 𝑧}
10		peano2uz2 9577	. . . . . 6 ⊢ ((𝑁 ∈ ℤ ∧ 𝑦 ∈ {𝑧 ∈ ℤ ∣ 𝑁 ≤ 𝑧}) → (𝑦 + 1) ∈ {𝑧 ∈ ℤ ∣ 𝑁 ≤ 𝑧})
11	2, 10	mpan 424	. . . . 5 ⊢ (𝑦 ∈ {𝑧 ∈ ℤ ∣ 𝑁 ≤ 𝑧} → (𝑦 + 1) ∈ {𝑧 ∈ ℤ ∣ 𝑁 ≤ 𝑧})
12	11	rgen 2583	. . . 4 ⊢ ∀𝑦 ∈ {𝑧 ∈ ℤ ∣ 𝑁 ≤ 𝑧} (𝑦 + 1) ∈ {𝑧 ∈ ℤ ∣ 𝑁 ≤ 𝑧}
13		zex 9478	. . . . . 6 ⊢ ℤ ∈ V
14	13	rabex 4232	. . . . 5 ⊢ {𝑧 ∈ ℤ ∣ 𝑁 ≤ 𝑧} ∈ V
15		eleq2 2293	. . . . . 6 ⊢ (𝑥 = {𝑧 ∈ ℤ ∣ 𝑁 ≤ 𝑧} → (𝑁 ∈ 𝑥 ↔ 𝑁 ∈ {𝑧 ∈ ℤ ∣ 𝑁 ≤ 𝑧}))
16		eleq2 2293	. . . . . . 7 ⊢ (𝑥 = {𝑧 ∈ ℤ ∣ 𝑁 ≤ 𝑧} → ((𝑦 + 1) ∈ 𝑥 ↔ (𝑦 + 1) ∈ {𝑧 ∈ ℤ ∣ 𝑁 ≤ 𝑧}))
17	16	raleqbi1dv 2740	. . . . . 6 ⊢ (𝑥 = {𝑧 ∈ ℤ ∣ 𝑁 ≤ 𝑧} → (∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥 ↔ ∀𝑦 ∈ {𝑧 ∈ ℤ ∣ 𝑁 ≤ 𝑧} (𝑦 + 1) ∈ {𝑧 ∈ ℤ ∣ 𝑁 ≤ 𝑧}))
18	15, 17	anbi12d 473	. . . . 5 ⊢ (𝑥 = {𝑧 ∈ ℤ ∣ 𝑁 ≤ 𝑧} → ((𝑁 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥) ↔ (𝑁 ∈ {𝑧 ∈ ℤ ∣ 𝑁 ≤ 𝑧} ∧ ∀𝑦 ∈ {𝑧 ∈ ℤ ∣ 𝑁 ≤ 𝑧} (𝑦 + 1) ∈ {𝑧 ∈ ℤ ∣ 𝑁 ≤ 𝑧})))
19	14, 18	elab 2948	. . . 4 ⊢ ({𝑧 ∈ ℤ ∣ 𝑁 ≤ 𝑧} ∈ {𝑥 ∣ (𝑁 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥)} ↔ (𝑁 ∈ {𝑧 ∈ ℤ ∣ 𝑁 ≤ 𝑧} ∧ ∀𝑦 ∈ {𝑧 ∈ ℤ ∣ 𝑁 ≤ 𝑧} (𝑦 + 1) ∈ {𝑧 ∈ ℤ ∣ 𝑁 ≤ 𝑧}))
20	9, 12, 19	mpbir2an 948	. . 3 ⊢ {𝑧 ∈ ℤ ∣ 𝑁 ≤ 𝑧} ∈ {𝑥 ∣ (𝑁 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥)}
21		intss1 3941	. . 3 ⊢ ({𝑧 ∈ ℤ ∣ 𝑁 ≤ 𝑧} ∈ {𝑥 ∣ (𝑁 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥)} → ∩ {𝑥 ∣ (𝑁 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥)} ⊆ {𝑧 ∈ ℤ ∣ 𝑁 ≤ 𝑧})
22	20, 21	ax-mp 5	. 2 ⊢ ∩ {𝑥 ∣ (𝑁 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥)} ⊆ {𝑧 ∈ ℤ ∣ 𝑁 ≤ 𝑧}
23	4, 22	eqssi 3241	1 ⊢ {𝑧 ∈ ℤ ∣ 𝑁 ≤ 𝑧} = ∩ {𝑥 ∣ (𝑁 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥)}

Syntax hints:   → wi 4   ∧ wa 104   = wceq 1395   ∈ wcel 2200  {cab 2215  ∀wral 2508  {crab 2512   ⊆ wss 3198  ∩ cint 3926   class class class wbr 4086  (class class class)co 6013  1c1 8023   + caddc 8025   ≤ cle 8205  ℤcz 9469

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-in1 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-sep 4205  ax-pow 4262  ax-pr 4297  ax-un 4528  ax-setind 4633  ax-cnex 8113  ax-resscn 8114  ax-1cn 8115  ax-1re 8116  ax-icn 8117  ax-addcl 8118  ax-addrcl 8119  ax-mulcl 8120  ax-addcom 8122  ax-addass 8124  ax-distr 8126  ax-i2m1 8127  ax-0lt1 8128  ax-0id 8130  ax-rnegex 8131  ax-cnre 8133  ax-pre-ltirr 8134  ax-pre-ltwlin 8135  ax-pre-lttrn 8136  ax-pre-ltadd 8138

This theorem depends on definitions:  df-bi 117  df-3or 1003  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-nel 2496  df-ral 2513  df-rex 2514  df-reu 2515  df-rab 2517  df-v 2802  df-sbc 3030  df-dif 3200  df-un 3202  df-in 3204  df-ss 3211  df-pw 3652  df-sn 3673  df-pr 3674  df-op 3676  df-uni 3892  df-int 3927  df-br 4087  df-opab 4149  df-id 4388  df-xp 4729  df-rel 4730  df-cnv 4731  df-co 4732  df-dm 4733  df-iota 5284  df-fun 5326  df-fv 5332  df-riota 5966  df-ov 6016  df-oprab 6017  df-mpo 6018  df-pnf 8206  df-mnf 8207  df-xr 8208  df-ltxr 8209  df-le 8210  df-sub 8342  df-neg 8343  df-inn 9134  df-n0 9393  df-z 9470

This theorem is referenced by: (None)