Theorem uzval 12779

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 5077	. . 3 ⊢ (𝑗 = 𝑁 → (𝑗 ≤ 𝑘 ↔ 𝑁 ≤ 𝑘))
2	1	rabbidv 3394	. 2 ⊢ (𝑗 = 𝑁 → {𝑘 ∈ ℤ ∣ 𝑗 ≤ 𝑘} = {𝑘 ∈ ℤ ∣ 𝑁 ≤ 𝑘})
3		df-uz 12778	. 2 ⊢ ℤ≥ = (𝑗 ∈ ℤ ↦ {𝑘 ∈ ℤ ∣ 𝑗 ≤ 𝑘})
4		zex 12522	. . 3 ⊢ ℤ ∈ V
5	4	rabex 5269	. 2 ⊢ {𝑘 ∈ ℤ ∣ 𝑁 ≤ 𝑘} ∈ V
6	2, 3, 5	fvmpt 6936	1 ⊢ (𝑁 ∈ ℤ → (ℤ≥‘𝑁) = {𝑘 ∈ ℤ ∣ 𝑁 ≤ 𝑘})

Syntax hints:   → wi 4   = wceq 1542   ∈ wcel 2114  {crab 3387   class class class wbr 5074  ‘cfv 6487   ≤ cle 11169  ℤcz 12513  ℤ_≥cuz 12777

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 2184  ax-ext 2707  ax-sep 5220  ax-pr 5364  ax-cnex 11083  ax-resscn 11084

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 2538  df-eu 2568  df-clab 2714  df-cleq 2727  df-clel 2810  df-nfc 2884  df-ral 3050  df-rex 3060  df-rab 3388  df-v 3429  df-dif 3888  df-un 3890  df-in 3892  df-ss 3902  df-nul 4264  df-if 4457  df-pw 4533  df-sn 4558  df-pr 4560  df-op 4564  df-uni 4841  df-br 5075  df-opab 5137  df-mpt 5156  df-id 5515  df-xp 5626  df-rel 5627  df-cnv 5628  df-co 5629  df-dm 5630  df-iota 6443  df-fun 6489  df-fv 6495  df-ov 7359  df-neg 11369  df-z 12514  df-uz 12778

This theorem is referenced by:  eluz1  12781  nn0uz  12815  nnuz  12816  algfx  16538