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

Theorem noseqrdglem 28748
Description: A helper lemma for the value of a recursive defintion generator on surreal sequences. (Contributed by Scott Fenton, 18-Apr-2025.)
Hypotheses
Ref Expression
om2noseq.1 (𝜑 → 𝐶 ∈ No)
om2noseq.2 (𝜑 → 𝐺 = (rec((𝑥 ∈ V ↦ (𝑥 +s 1s )), 𝐶) ↾ ω))
om2noseq.3 (𝜑 → 𝑍 = (rec((𝑥 ∈ V ↦ (𝑥 +s 1s )), 𝐶) “ ω))
noseqrdg.1 (𝜑 → 𝐴 ∈ 𝑉)
noseqrdg.2 (𝜑 → 𝑅 = (rec((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 +s 1s ), (𝑥𝐹𝑦)⟩), ⟨𝐶, 𝐴⟩) ↾ ω))
Assertion
Ref Expression
noseqrdglem ((𝜑 ∧ 𝐵 ∈ 𝑍) → ⟨𝐵, (2nd ‘(𝑅‘(◡𝐺‘𝐵)))⟩ ∈ ran 𝑅)
Distinct variable groups:   𝑥,𝐹,𝑦   𝑥,𝐶
Allowed substitution hints:   𝜑(𝑥, 𝑦)   𝐴(𝑥, 𝑦)   𝐵(𝑥, 𝑦)   𝐶(𝑦)   𝑅(𝑥, 𝑦)   𝐺(𝑥, 𝑦)   𝑉(𝑥, 𝑦)   𝑍(𝑥, 𝑦)

Proof of Theorem noseqrdglem
StepHypRef Expression
1 om2noseq.1 . . . . . 6 (𝜑 → 𝐶 ∈ No)
2 om2noseq.2 . . . . . 6 (𝜑 → 𝐺 = (rec((𝑥 ∈ V ↦ (𝑥 +s 1s )), 𝐶) ↾ ω))
3 om2noseq.3 . . . . . 6 (𝜑 → 𝑍 = (rec((𝑥 ∈ V ↦ (𝑥 +s 1s )), 𝐶) “ ω))
41, 2, 3om2noseqf1o 28744 . . . . 5 (𝜑 → 𝐺:ω⟶1-1onto𝑍)
5 f1ocnvdm 7324 . . . . 5 ((𝐺:ω⟶1-1onto𝑍 ∧ 𝐵 ∈ 𝑍) → (◡𝐺‘𝐵) ∈ ω)
64, 5sylan 592 . . . 4 ((𝜑 ∧ 𝐵 ∈ 𝑍) → (◡𝐺‘𝐵) ∈ ω)
7 noseqrdg.1 . . . . 5 (𝜑 → 𝐴 ∈ 𝑉)
8 noseqrdg.2 . . . . 5 (𝜑 → 𝑅 = (rec((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 +s 1s ), (𝑥𝐹𝑦)⟩), ⟨𝐶, 𝐴⟩) ↾ ω))
91, 2, 3, 7, 8om2noseqrdg 28747 . . . 4 ((𝜑 ∧ (◡𝐺‘𝐵) ∈ ω) → (𝑅‘(◡𝐺‘𝐵)) = ⟨(𝐺‘(◡𝐺‘𝐵)), (2nd ‘(𝑅‘(◡𝐺‘𝐵)))⟩)
106, 9syldan 603 . . 3 ((𝜑 ∧ 𝐵 ∈ 𝑍) → (𝑅‘(◡𝐺‘𝐵)) = ⟨(𝐺‘(◡𝐺‘𝐵)), (2nd ‘(𝑅‘(◡𝐺‘𝐵)))⟩)
11 f1ocnvfv2 7316 . . . . 5 ((𝐺:ω⟶1-1onto𝑍 ∧ 𝐵 ∈ 𝑍) → (𝐺‘(◡𝐺‘𝐵)) = 𝐵)
124, 11sylan 592 . . . 4 ((𝜑 ∧ 𝐵 ∈ 𝑍) → (𝐺‘(◡𝐺‘𝐵)) = 𝐵)
1312opeq1d 4851 . . 3 ((𝜑 ∧ 𝐵 ∈ 𝑍) → ⟨(𝐺‘(◡𝐺‘𝐵)), (2nd ‘(𝑅‘(◡𝐺‘𝐵)))⟩ = ⟨𝐵, (2nd ‘(𝑅‘(◡𝐺‘𝐵)))⟩)
1410, 13eqtrd 2798 . 2 ((𝜑 ∧ 𝐵 ∈ 𝑍) → (𝑅‘(◡𝐺‘𝐵)) = ⟨𝐵, (2nd ‘(𝑅‘(◡𝐺‘𝐵)))⟩)
15 frfnom 8481 . . . . 5 (rec((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 +s 1s ), (𝑥𝐹𝑦)⟩), ⟨𝐶, 𝐴⟩) ↾ ω) Fn ω
168fneq1d 6662 . . . . 5 (𝜑 → (𝑅 Fn ω ↔ (rec((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 +s 1s ), (𝑥𝐹𝑦)⟩), ⟨𝐶, 𝐴⟩) ↾ ω) Fn ω))
1715, 16mpbiri 261 . . . 4 (𝜑 → 𝑅 Fn ω)
1817adantr 486 . . 3 ((𝜑 ∧ 𝐵 ∈ 𝑍) → 𝑅 Fn ω)
1918, 6fnfvelrnd 7114 . 2 ((𝜑 ∧ 𝐵 ∈ 𝑍) → (𝑅‘(◡𝐺‘𝐵)) ∈ ran 𝑅)
2014, 19eqeltrrd 2865 1 ((𝜑 ∧ 𝐵 ∈ 𝑍) → ⟨𝐵, (2nd ‘(𝑅‘(◡𝐺‘𝐵)))⟩ ∈ ran 𝑅)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  Vcvv 3454  ⟨cop 4840   ↦ cmpt 5192  ◡ccnv 5657  ran crn 5659   ↾ cres 5660   “ cima 5661   Fn wfn 6561  ⟶1-1ontowf1o 6565  ‘cfv 6566  (class class class)co 7451   ∈ cmpo 7453  ωcom 7911  2nd c2nd 8034  reccrdg 8455  Nocsur 28054   1s c1s 28249   +s cadds 28402
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5238  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-tp 4593  df-op 4841  df-ot 4864  df-uni 4873  df-int 4913  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-se 5612  df-we 5613  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-pred 6330  df-ord 6391  df-on 6392  df-lim 6393  df-suc 6394  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-riota 7408  df-ov 7454  df-oprab 7455  df-mpo 7456  df-om 7912  df-1st 8035  df-2nd 8036  df-frecs 8337  df-wrecs 8368  df-recs 8417  df-rdg 8456  df-1o 8514  df-2o 8515  df-oadd 8518  df-nadd 8713  df-no 28057  df-lts 28058  df-bday 28059  df-les 28159  df-slts 28201  df-cuts 28203  df-0s 28250  df-1s 28251  df-made 28270  df-old 28271  df-left 28273  df-right 28274  df-norec2 28392  df-adds 28403
This theorem is used by:  noseqrdgfn  28749  noseqrdgsuc  28751
  Copyright terms: Public domain W3C validator