Theorem noseqrdglem 28706

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

Step	Hyp	Ref	Expression
1		om2noseq.1	. . . . . 6 ⊢ (𝜑 → 𝐶 ∈ No)
2		om2noseq.2	. . . . . 6 ⊢ (𝜑 → 𝐺 = (rec((𝑥 ∈ V ↦ (𝑥 +s 1s )), 𝐶) ↾ ω))
3		om2noseq.3	. . . . . 6 ⊢ (𝜑 → 𝑍 = (rec((𝑥 ∈ V ↦ (𝑥 +s 1s )), 𝐶) “ ω))
4	1, 2, 3	om2noseqf1o 28702	. . . . 5 ⊢ (𝜑 → 𝐺:ω–1-1-onto→𝑍)
5		f1ocnvdm 7303	. . . . 5 ⊢ ((𝐺:ω–1-1-onto→𝑍 ∧ 𝐵 ∈ 𝑍) → (◡𝐺‘𝐵) ∈ ω)
6	4, 5	sylan 592	. . . 4 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝑍) → (◡𝐺‘𝐵) ∈ ω)
7		noseqrdg.1	. . . . 5 ⊢ (𝜑 → 𝐴 ∈ 𝑉)
8		noseqrdg.2	. . . . 5 ⊢ (𝜑 → 𝑅 = (rec((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 +s 1s ), (𝑥𝐹𝑦)⟩), ⟨𝐶, 𝐴⟩) ↾ ω))
9	1, 2, 3, 7, 8	om2noseqrdg 28705	. . . 4 ⊢ ((𝜑 ∧ (◡𝐺‘𝐵) ∈ ω) → (𝑅‘(◡𝐺‘𝐵)) = ⟨(𝐺‘(◡𝐺‘𝐵)), (2nd ‘(𝑅‘(◡𝐺‘𝐵)))⟩)
10	6, 9	syldan 603	. . 3 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝑍) → (𝑅‘(◡𝐺‘𝐵)) = ⟨(𝐺‘(◡𝐺‘𝐵)), (2nd ‘(𝑅‘(◡𝐺‘𝐵)))⟩)
11		f1ocnvfv2 7295	. . . . 5 ⊢ ((𝐺:ω–1-1-onto→𝑍 ∧ 𝐵 ∈ 𝑍) → (𝐺‘(◡𝐺‘𝐵)) = 𝐵)
12	4, 11	sylan 592	. . . 4 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝑍) → (𝐺‘(◡𝐺‘𝐵)) = 𝐵)
13	12	opeq1d 4849	. . 3 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝑍) → ⟨(𝐺‘(◡𝐺‘𝐵)), (2nd ‘(𝑅‘(◡𝐺‘𝐵)))⟩ = ⟨𝐵, (2nd ‘(𝑅‘(◡𝐺‘𝐵)))⟩)
14	10, 13	eqtrd 2798	. 2 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝑍) → (𝑅‘(◡𝐺‘𝐵)) = ⟨𝐵, (2nd ‘(𝑅‘(◡𝐺‘𝐵)))⟩)
15		frfnom 8457	. . . . 5 ⊢ (rec((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 +s 1s ), (𝑥𝐹𝑦)⟩), ⟨𝐶, 𝐴⟩) ↾ ω) Fn ω
16	8	fneq1d 6643	. . . . 5 ⊢ (𝜑 → (𝑅 Fn ω ↔ (rec((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 +s 1s ), (𝑥𝐹𝑦)⟩), ⟨𝐶, 𝐴⟩) ↾ ω) Fn ω))
17	15, 16	mpbiri 261	. . . 4 ⊢ (𝜑 → 𝑅 Fn ω)
18	17	adantr 486	. . 3 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝑍) → 𝑅 Fn ω)
19	18, 6	fnfvelrnd 7093	. 2 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝑍) → (𝑅‘(◡𝐺‘𝐵)) ∈ ran 𝑅)
20	14, 19	eqeltrrd 2865	1 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝑍) → ⟨𝐵, (2nd ‘(𝑅‘(◡𝐺‘𝐵)))⟩ ∈ ran 𝑅)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1569   ∈ wcel 2146  Vcvv 3454  ⟨cop 4838   ↦ cmpt 5189  ^◡ccnv 5654  ran crn 5656   ↾ cres 5657   “ cima 5658   Fn wfn 6542  –1-1-onto→wf1o 6546  ‘cfv 6547  (class class class)co 7430   ∈ cmpo 7432  ωcom 7887  2^nd c2nd 8010  reccrdg 8431  Nocsur 28012   1_s c1s 28207   +_s cadds 28360

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2196  ax-12 2215  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7761

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2101  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 4839  df-ot 4862  df-uni 4871  df-int 4911  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-tr 5216  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-se 5609  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-pred 6311  df-ord 6372  df-on 6373  df-lim 6374  df-suc 6375  df-iota 6501  df-fun 6549  df-fn 6550  df-f 6551  df-f1 6552  df-fo 6553  df-f1o 6554  df-fv 6555  df-riota 7387  df-ov 7433  df-oprab 7434  df-mpo 7435  df-om 7888  df-1st 8011  df-2nd 8012  df-frecs 8313  df-wrecs 8344  df-recs 8393  df-rdg 8432  df-1o 8490  df-2o 8491  df-oadd 8494  df-nadd 8689  df-no 28015  df-lts 28016  df-bday 28017  df-les 28117  df-slts 28159  df-cuts 28161  df-0s 28208  df-1s 28209  df-made 28228  df-old 28229  df-left 28231  df-right 28232  df-norec2 28350  df-adds 28361

This theorem is used by:  noseqrdgfn  28707  noseqrdgsuc  28709