Theorem uzval 12785

Description: The value of the upper integers function. (Contributed by NM, 5-Sep-2005.) (Revised by Mario Carneiro, 3-Nov-2013.)

Assertion

Ref	Expression
uzval	⊢ (𝑁 ∈ ℤ → (ℤ≥‘𝑁) = {𝑘 ∈ ℤ ∣ 𝑁 ≤ 𝑘})

Distinct variable group:   𝑘,𝑁

Proof of Theorem uzval

Dummy variable 𝑗 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		breq1 5089	. . 3 ⊢ (𝑗 = 𝑁 → (𝑗 ≤ 𝑘 ↔ 𝑁 ≤ 𝑘))
2	1	rabbidv 3397	. 2 ⊢ (𝑗 = 𝑁 → {𝑘 ∈ ℤ ∣ 𝑗 ≤ 𝑘} = {𝑘 ∈ ℤ ∣ 𝑁 ≤ 𝑘})
3		df-uz 12784	. 2 ⊢ ℤ≥ = (𝑗 ∈ ℤ ↦ {𝑘 ∈ ℤ ∣ 𝑗 ≤ 𝑘})
4		zex 12528	. . 3 ⊢ ℤ ∈ V
5	4	rabex 5277	. 2 ⊢ {𝑘 ∈ ℤ ∣ 𝑁 ≤ 𝑘} ∈ V
6	2, 3, 5	fvmpt 6943	1 ⊢ (𝑁 ∈ ℤ → (ℤ≥‘𝑁) = {𝑘 ∈ ℤ ∣ 𝑁 ≤ 𝑘})

Syntax hints:   → wi 4   = wceq 1542   ∈ wcel 2114  {crab 3390   class class class wbr 5086  ‘cfv 6494   ≤ cle 11175  ℤcz 12519  ℤ_≥cuz 12783

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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5232  ax-pr 5372  ax-cnex 11089  ax-resscn 11090

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ral 3053  df-rex 3063  df-rab 3391  df-v 3432  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-br 5087  df-opab 5149  df-mpt 5168  df-id 5521  df-xp 5632  df-rel 5633  df-cnv 5634  df-co 5635  df-dm 5636  df-iota 6450  df-fun 6496  df-fv 6502  df-ov 7365  df-neg 11375  df-z 12520  df-uz 12784

This theorem is referenced by:  eluz1  12787  nn0uz  12821  nnuz  12822  algfx  16544