MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  uzval Structured version   Visualization version   GIF version

Theorem uzval 13006
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.
StepHypRef Expression
1 breq1 5110 . . 3 (𝑗 = 𝑁 → (𝑗 ≤ 𝑘 ↔ 𝑁 ≤ 𝑘))
21rabbidv 3422 . 2 (𝑗 = 𝑁 → {𝑘 ∈ ℤ ∣ 𝑗 ≤ 𝑘} = {𝑘 ∈ ℤ ∣ 𝑁 ≤ 𝑘})
3 df-uz 13005 . 2 ℤ≥ = (𝑗 ∈ ℤ ↦ {𝑘 ∈ ℤ ∣ 𝑗 ≤ 𝑘})
4 zex 12741 . . 3 ℤ ∈ V
54rabex 5306 . 2 {𝑘 ∈ ℤ ∣ 𝑁 ≤ 𝑘} ∈ V
62, 3, 5fvmpt 7023 1 (𝑁 ∈ ℤ → (ℤ≥‘𝑁) = {𝑘 ∈ ℤ ∣ 𝑁 ≤ 𝑘})
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1572   ∈ wcel 2150  {crab 3415   class class class wbr 5107  ‘cfv 6565   ≤ cle 11382  ℤcz 12732  ℤ≥cuz 13004
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-10 2183  ax-11 2200  ax-12 2219  ax-ext 2738  ax-sep 5254  ax-pr 5397  ax-cnex 11294  ax-resscn 11295
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1105  df-3an 1106  df-tru 1575  df-fal 1585  df-ex 1815  df-nf 1819  df-sb 2104  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2842  df-nfc 2916  df-ral 3084  df-rex 3094  df-rab 3416  df-v 3455  df-ss 3900  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-op 4840  df-uni 4872  df-br 5108  df-opab 5173  df-mpt 5192  df-id 5552  df-xp 5663  df-rel 5664  df-cnv 5665  df-co 5666  df-dm 5667  df-iota 6519  df-fun 6567  df-fv 6573  df-ov 7453  df-neg 11582  df-z 12733  df-uz 13005
This theorem is used by:  eluz1  13008  nn0uz  13042  nnuz  13043  algfx  16798
  Copyright terms: Public domain W3C validator