Theorem dfuzi 9735

Description: An expression for the upper integers that start at 𝑁 that is analogous to dfnn2 9285 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 3982	. . 3 ⊢ ({𝑧 ∈ ℤ ∣ 𝑁 ≤ 𝑧} ⊆ ∩ {𝑥 ∣ (𝑁 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥)} ↔ ∀𝑥((𝑁 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥) → {𝑧 ∈ ℤ ∣ 𝑁 ≤ 𝑧} ⊆ 𝑥))
2		dfuz.1	. . . 4 ⊢ 𝑁 ∈ ℤ
3	2	peano5uzi 9734	. . 3 ⊢ ((𝑁 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥) → {𝑧 ∈ ℤ ∣ 𝑁 ≤ 𝑧} ⊆ 𝑥)
4	1, 3	mpgbir 1506	. 2 ⊢ {𝑧 ∈ ℤ ∣ 𝑁 ≤ 𝑧} ⊆ ∩ {𝑥 ∣ (𝑁 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥)}
5	2	zrei 9629	. . . . . 6 ⊢ 𝑁 ∈ ℝ
6	5	leidi 8803	. . . . 5 ⊢ 𝑁 ≤ 𝑁
7		breq2 4129	. . . . . 6 ⊢ (𝑧 = 𝑁 → (𝑁 ≤ 𝑧 ↔ 𝑁 ≤ 𝑁))
8	7	elrab 2982	. . . . 5 ⊢ (𝑁 ∈ {𝑧 ∈ ℤ ∣ 𝑁 ≤ 𝑧} ↔ (𝑁 ∈ ℤ ∧ 𝑁 ≤ 𝑁))
9	2, 6, 8	mpbir2an 955	. . . 4 ⊢ 𝑁 ∈ {𝑧 ∈ ℤ ∣ 𝑁 ≤ 𝑧}
10		peano2uz2 9732	. . . . . 6 ⊢ ((𝑁 ∈ ℤ ∧ 𝑦 ∈ {𝑧 ∈ ℤ ∣ 𝑁 ≤ 𝑧}) → (𝑦 + 1) ∈ {𝑧 ∈ ℤ ∣ 𝑁 ≤ 𝑧})
11	2, 10	mpan 428	. . . . 5 ⊢ (𝑦 ∈ {𝑧 ∈ ℤ ∣ 𝑁 ≤ 𝑧} → (𝑦 + 1) ∈ {𝑧 ∈ ℤ ∣ 𝑁 ≤ 𝑧})
12	11	rgen 2603	. . . 4 ⊢ ∀𝑦 ∈ {𝑧 ∈ ℤ ∣ 𝑁 ≤ 𝑧} (𝑦 + 1) ∈ {𝑧 ∈ ℤ ∣ 𝑁 ≤ 𝑧}
13		zex 9632	. . . . . 6 ⊢ ℤ ∈ V
14	13	rabex 4275	. . . . 5 ⊢ {𝑧 ∈ ℤ ∣ 𝑁 ≤ 𝑧} ∈ V
15		eleq2 2302	. . . . . 6 ⊢ (𝑥 = {𝑧 ∈ ℤ ∣ 𝑁 ≤ 𝑧} → (𝑁 ∈ 𝑥 ↔ 𝑁 ∈ {𝑧 ∈ ℤ ∣ 𝑁 ≤ 𝑧}))
16		eleq2 2302	. . . . . . 7 ⊢ (𝑥 = {𝑧 ∈ ℤ ∣ 𝑁 ≤ 𝑧} → ((𝑦 + 1) ∈ 𝑥 ↔ (𝑦 + 1) ∈ {𝑧 ∈ ℤ ∣ 𝑁 ≤ 𝑧}))
17	16	raleqbi1dv 2761	. . . . . 6 ⊢ (𝑥 = {𝑧 ∈ ℤ ∣ 𝑁 ≤ 𝑧} → (∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥 ↔ ∀𝑦 ∈ {𝑧 ∈ ℤ ∣ 𝑁 ≤ 𝑧} (𝑦 + 1) ∈ {𝑧 ∈ ℤ ∣ 𝑁 ≤ 𝑧}))
18	15, 17	anbi12d 477	. . . . 5 ⊢ (𝑥 = {𝑧 ∈ ℤ ∣ 𝑁 ≤ 𝑧} → ((𝑁 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥) ↔ (𝑁 ∈ {𝑧 ∈ ℤ ∣ 𝑁 ≤ 𝑧} ∧ ∀𝑦 ∈ {𝑧 ∈ ℤ ∣ 𝑁 ≤ 𝑧} (𝑦 + 1) ∈ {𝑧 ∈ ℤ ∣ 𝑁 ≤ 𝑧})))
19	14, 18	elab 2970	. . . 4 ⊢ ({𝑧 ∈ ℤ ∣ 𝑁 ≤ 𝑧} ∈ {𝑥 ∣ (𝑁 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥)} ↔ (𝑁 ∈ {𝑧 ∈ ℤ ∣ 𝑁 ≤ 𝑧} ∧ ∀𝑦 ∈ {𝑧 ∈ ℤ ∣ 𝑁 ≤ 𝑧} (𝑦 + 1) ∈ {𝑧 ∈ ℤ ∣ 𝑁 ≤ 𝑧}))
20	9, 12, 19	mpbir2an 955	. . 3 ⊢ {𝑧 ∈ ℤ ∣ 𝑁 ≤ 𝑧} ∈ {𝑥 ∣ (𝑁 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥)}
21		intss1 3980	. . 3 ⊢ ({𝑧 ∈ ℤ ∣ 𝑁 ≤ 𝑧} ∈ {𝑥 ∣ (𝑁 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥)} → ∩ {𝑥 ∣ (𝑁 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥)} ⊆ {𝑧 ∈ ℤ ∣ 𝑁 ≤ 𝑧})
22	20, 21	ax-mp 5	. 2 ⊢ ∩ {𝑥 ∣ (𝑁 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥)} ⊆ {𝑧 ∈ ℤ ∣ 𝑁 ≤ 𝑧}
23	4, 22	eqssi 3264	1 ⊢ {𝑧 ∈ ℤ ∣ 𝑁 ≤ 𝑧} = ∩ {𝑥 ∣ (𝑁 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥)}

Syntax hints:   → wi 4   ∧ wa 104   = wceq 1402   ∈ wcel 2209  {cab 2224  ∀wral 2528  {crab 2532   ⊆ wss 3220  ∩ cint 3965   class class class wbr 4125  (class class class)co 6075  1c1 8170   + caddc 8172   ≤ cle 8351  ℤcz 9623

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 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4244  ax-pow 4306  ax-pr 4341  ax-un 4573  ax-setind 4679  ax-cnex 8260  ax-resscn 8261  ax-1cn 8262  ax-1re 8263  ax-icn 8264  ax-addcl 8265  ax-addrcl 8266  ax-mulcl 8267  ax-addcom 8269  ax-addass 8271  ax-distr 8273  ax-i2m1 8274  ax-0lt1 8275  ax-0id 8277  ax-rnegex 8278  ax-cnre 8280  ax-pre-ltirr 8281  ax-pre-ltwlin 8282  ax-pre-lttrn 8283  ax-pre-ltadd 8285

This theorem depends on definitions:  df-bi 117  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-int 3966  df-br 4126  df-opab 4188  df-id 4433  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-iota 5332  df-fun 5374  df-fv 5380  df-riota 6028  df-ov 6078  df-oprab 6079  df-mpo 6080  df-pnf 8352  df-mnf 8353  df-xr 8354  df-ltxr 8355  df-le 8356  df-sub 8489  df-neg 8490  df-inn 9284  df-n0 9543  df-z 9624

This theorem is referenced by: (None)