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

Theorem uzrdglem 13326
Description: A helper lemma for the value of a recursive definition generator on upper integers. (Contributed by Mario Carneiro, 26-Jun-2013.) (Revised by Mario Carneiro, 18-Nov-2014.)
Hypotheses
Ref Expression
om2uz.1 𝐶 ∈ ℤ
om2uz.2 𝐺 = (rec((𝑥 ∈ V ↦ (𝑥 + 1)), 𝐶) ↾ ω)
uzrdg.1 𝐴 ∈ V
uzrdg.2 𝑅 = (rec((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩), ⟨𝐶, 𝐴⟩) ↾ ω)
Assertion
Ref Expression
uzrdglem (𝐵 ∈ (ℤ𝐶) → ⟨𝐵, (2nd ‘(𝑅‘(𝐺𝐵)))⟩ ∈ ran 𝑅)
Distinct variable groups:   𝑦,𝐴   𝑥,𝑦,𝐶   𝑦,𝐺   𝑥,𝐹,𝑦
Allowed substitution hints:   𝐴(𝑥)   𝐵(𝑥,𝑦)   𝑅(𝑥,𝑦)   𝐺(𝑥)

Proof of Theorem uzrdglem
StepHypRef Expression
1 om2uz.1 . . . . . 6 𝐶 ∈ ℤ
2 om2uz.2 . . . . . 6 𝐺 = (rec((𝑥 ∈ V ↦ (𝑥 + 1)), 𝐶) ↾ ω)
31, 2om2uzf1oi 13322 . . . . 5 𝐺:ω–1-1-onto→(ℤ𝐶)
4 f1ocnvdm 7041 . . . . 5 ((𝐺:ω–1-1-onto→(ℤ𝐶) ∧ 𝐵 ∈ (ℤ𝐶)) → (𝐺𝐵) ∈ ω)
53, 4mpan 688 . . . 4 (𝐵 ∈ (ℤ𝐶) → (𝐺𝐵) ∈ ω)
6 uzrdg.1 . . . . 5 𝐴 ∈ V
7 uzrdg.2 . . . . 5 𝑅 = (rec((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩), ⟨𝐶, 𝐴⟩) ↾ ω)
81, 2, 6, 7om2uzrdg 13325 . . . 4 ((𝐺𝐵) ∈ ω → (𝑅‘(𝐺𝐵)) = ⟨(𝐺‘(𝐺𝐵)), (2nd ‘(𝑅‘(𝐺𝐵)))⟩)
95, 8syl 17 . . 3 (𝐵 ∈ (ℤ𝐶) → (𝑅‘(𝐺𝐵)) = ⟨(𝐺‘(𝐺𝐵)), (2nd ‘(𝑅‘(𝐺𝐵)))⟩)
10 f1ocnvfv2 7034 . . . . 5 ((𝐺:ω–1-1-onto→(ℤ𝐶) ∧ 𝐵 ∈ (ℤ𝐶)) → (𝐺‘(𝐺𝐵)) = 𝐵)
113, 10mpan 688 . . . 4 (𝐵 ∈ (ℤ𝐶) → (𝐺‘(𝐺𝐵)) = 𝐵)
1211opeq1d 4809 . . 3 (𝐵 ∈ (ℤ𝐶) → ⟨(𝐺‘(𝐺𝐵)), (2nd ‘(𝑅‘(𝐺𝐵)))⟩ = ⟨𝐵, (2nd ‘(𝑅‘(𝐺𝐵)))⟩)
139, 12eqtrd 2856 . 2 (𝐵 ∈ (ℤ𝐶) → (𝑅‘(𝐺𝐵)) = ⟨𝐵, (2nd ‘(𝑅‘(𝐺𝐵)))⟩)
14 frfnom 8070 . . . 4 (rec((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩), ⟨𝐶, 𝐴⟩) ↾ ω) Fn ω
157fneq1i 6450 . . . 4 (𝑅 Fn ω ↔ (rec((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩), ⟨𝐶, 𝐴⟩) ↾ ω) Fn ω)
1614, 15mpbir 233 . . 3 𝑅 Fn ω
17 fnfvelrn 6848 . . 3 ((𝑅 Fn ω ∧ (𝐺𝐵) ∈ ω) → (𝑅‘(𝐺𝐵)) ∈ ran 𝑅)
1816, 5, 17sylancr 589 . 2 (𝐵 ∈ (ℤ𝐶) → (𝑅‘(𝐺𝐵)) ∈ ran 𝑅)
1913, 18eqeltrrd 2914 1 (𝐵 ∈ (ℤ𝐶) → ⟨𝐵, (2nd ‘(𝑅‘(𝐺𝐵)))⟩ ∈ ran 𝑅)
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1537  wcel 2114  Vcvv 3494  cop 4573  cmpt 5146  ccnv 5554  ran crn 5556  cres 5557   Fn wfn 6350  1-1-ontowf1o 6354  cfv 6355  (class class class)co 7156  cmpo 7158  ωcom 7580  2nd c2nd 7688  reccrdg 8045  1c1 10538   + caddc 10540  cz 11982  cuz 12244
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2793  ax-sep 5203  ax-nul 5210  ax-pow 5266  ax-pr 5330  ax-un 7461  ax-cnex 10593  ax-resscn 10594  ax-1cn 10595  ax-icn 10596  ax-addcl 10597  ax-addrcl 10598  ax-mulcl 10599  ax-mulrcl 10600  ax-mulcom 10601  ax-addass 10602  ax-mulass 10603  ax-distr 10604  ax-i2m1 10605  ax-1ne0 10606  ax-1rid 10607  ax-rnegex 10608  ax-rrecex 10609  ax-cnre 10610  ax-pre-lttri 10611  ax-pre-lttrn 10612  ax-pre-ltadd 10613  ax-pre-mulgt0 10614
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-nel 3124  df-ral 3143  df-rex 3144  df-reu 3145  df-rab 3147  df-v 3496  df-sbc 3773  df-csb 3884  df-dif 3939  df-un 3941  df-in 3943  df-ss 3952  df-pss 3954  df-nul 4292  df-if 4468  df-pw 4541  df-sn 4568  df-pr 4570  df-tp 4572  df-op 4574  df-uni 4839  df-iun 4921  df-br 5067  df-opab 5129  df-mpt 5147  df-tr 5173  df-id 5460  df-eprel 5465  df-po 5474  df-so 5475  df-fr 5514  df-we 5516  df-xp 5561  df-rel 5562  df-cnv 5563  df-co 5564  df-dm 5565  df-rn 5566  df-res 5567  df-ima 5568  df-pred 6148  df-ord 6194  df-on 6195  df-lim 6196  df-suc 6197  df-iota 6314  df-fun 6357  df-fn 6358  df-f 6359  df-f1 6360  df-fo 6361  df-f1o 6362  df-fv 6363  df-riota 7114  df-ov 7159  df-oprab 7160  df-mpo 7161  df-om 7581  df-2nd 7690  df-wrecs 7947  df-recs 8008  df-rdg 8046  df-er 8289  df-en 8510  df-dom 8511  df-sdom 8512  df-pnf 10677  df-mnf 10678  df-xr 10679  df-ltxr 10680  df-le 10681  df-sub 10872  df-neg 10873  df-nn 11639  df-n0 11899  df-z 11983  df-uz 12245
This theorem is referenced by:  uzrdgfni  13327  uzrdgsuci  13329
  Copyright terms: Public domain W3C validator