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

Theorem om2uz0i 13948
Description: The mapping 𝐺 is a one-to-one mapping from ω onto upper integers that will be used to construct a recursive definition generator. Ordinal natural number 0 maps to complex number 𝐶 (normally 0 for the upper integers 0 or 1 for the upper integers ), 1 maps to 𝐶 + 1, etc. This theorem shows the value of 𝐺 at ordinal natural number zero. (This series of theorems generalizes an earlier series for 0 contributed by Raph Levien, 10-Apr-2004.) (Contributed by NM, 3-Oct-2004.) (Revised by Mario Carneiro, 13-Sep-2013.)
Hypotheses
Ref Expression
om2uz.1 𝐶 ∈ ℤ
om2uz.2 𝐺 = (rec((𝑥 ∈ V ↦ (𝑥 + 1)), 𝐶) ↾ ω)
Assertion
Ref Expression
om2uz0i (𝐺‘∅) = 𝐶
Distinct variable group:   𝑥,𝐶
Allowed substitution hint:   𝐺(𝑥)

Proof of Theorem om2uz0i
StepHypRef Expression
1 om2uz.2 . . 3 𝐺 = (rec((𝑥 ∈ V ↦ (𝑥 + 1)), 𝐶) ↾ ω)
21fveq1i 6897 . 2 (𝐺‘∅) = ((rec((𝑥 ∈ V ↦ (𝑥 + 1)), 𝐶) ↾ ω)‘∅)
3 om2uz.1 . . 3 𝐶 ∈ ℤ
4 fr0g 8457 . . 3 (𝐶 ∈ ℤ → ((rec((𝑥 ∈ V ↦ (𝑥 + 1)), 𝐶) ↾ ω)‘∅) = 𝐶)
53, 4ax-mp 5 . 2 ((rec((𝑥 ∈ V ↦ (𝑥 + 1)), 𝐶) ↾ ω)‘∅) = 𝐶
62, 5eqtri 2753 1 (𝐺‘∅) = 𝐶
Colors of variables: wff setvar class
Syntax hints:   = wceq 1533  wcel 2098  Vcvv 3461  c0 4322  cmpt 5232  cres 5680  cfv 6549  (class class class)co 7419  ωcom 7871  reccrdg 8430  1c1 11141   + caddc 11143  cz 12591
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-10 2129  ax-11 2146  ax-12 2166  ax-ext 2696  ax-sep 5300  ax-nul 5307  ax-pr 5429  ax-un 7741
This theorem depends on definitions:  df-bi 206  df-an 395  df-or 846  df-3or 1085  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-nf 1778  df-sb 2060  df-mo 2528  df-eu 2557  df-clab 2703  df-cleq 2717  df-clel 2802  df-nfc 2877  df-ne 2930  df-ral 3051  df-rex 3060  df-reu 3364  df-rab 3419  df-v 3463  df-sbc 3774  df-csb 3890  df-dif 3947  df-un 3949  df-in 3951  df-ss 3961  df-pss 3964  df-nul 4323  df-if 4531  df-pw 4606  df-sn 4631  df-pr 4633  df-op 4637  df-uni 4910  df-iun 4999  df-br 5150  df-opab 5212  df-mpt 5233  df-tr 5267  df-id 5576  df-eprel 5582  df-po 5590  df-so 5591  df-fr 5633  df-we 5635  df-xp 5684  df-rel 5685  df-cnv 5686  df-co 5687  df-dm 5688  df-rn 5689  df-res 5690  df-ima 5691  df-pred 6307  df-ord 6374  df-on 6375  df-lim 6376  df-suc 6377  df-iota 6501  df-fun 6551  df-fn 6552  df-f 6553  df-f1 6554  df-fo 6555  df-f1o 6556  df-fv 6557  df-ov 7422  df-om 7872  df-2nd 7995  df-frecs 8287  df-wrecs 8318  df-recs 8392  df-rdg 8431
This theorem is referenced by:  om2uzuzi  13950  om2uzrani  13953  om2uzrdg  13957  uzrdgxfr  13968  fzennn  13969  axdc4uzlem  13984  hashgadd  14372
  Copyright terms: Public domain W3C validator