Theorem noseqrdglem 28551

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 28547	. . . . 5 ⊢ (𝜑 → 𝐺:ω–1-1-onto→𝑍)
5		f1ocnvdm 7292	. . . . 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 28550	. . . 4 ⊢ ((𝜑 ∧ (◡𝐺‘𝐵) ∈ ω) → (𝑅‘(◡𝐺‘𝐵)) = ⟨(𝐺‘(◡𝐺‘𝐵)), (2nd ‘(𝑅‘(◡𝐺‘𝐵)))⟩)
10	6, 9	syldan 603	. . 3 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝑍) → (𝑅‘(◡𝐺‘𝐵)) = ⟨(𝐺‘(◡𝐺‘𝐵)), (2nd ‘(𝑅‘(◡𝐺‘𝐵)))⟩)
11		f1ocnvfv2 7284	. . . . 5 ⊢ ((𝐺:ω–1-1-onto→𝑍 ∧ 𝐵 ∈ 𝑍) → (𝐺‘(◡𝐺‘𝐵)) = 𝐵)
12	4, 11	sylan 592	. . . 4 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝑍) → (𝐺‘(◡𝐺‘𝐵)) = 𝐵)
13	12	opeq1d 4846	. . 3 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝑍) → ⟨(𝐺‘(◡𝐺‘𝐵)), (2nd ‘(𝑅‘(◡𝐺‘𝐵)))⟩ = ⟨𝐵, (2nd ‘(𝑅‘(◡𝐺‘𝐵)))⟩)
14	10, 13	eqtrd 2800	. 2 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝑍) → (𝑅‘(◡𝐺‘𝐵)) = ⟨𝐵, (2nd ‘(𝑅‘(◡𝐺‘𝐵)))⟩)
15		frfnom 8428	. . . . 5 ⊢ (rec((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 +s 1s ), (𝑥𝐹𝑦)⟩), ⟨𝐶, 𝐴⟩) ↾ ω) Fn ω
16	8	fneq1d 6632	. . . . 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 7081	. 2 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝑍) → (𝑅‘(◡𝐺‘𝐵)) ∈ ran 𝑅)
20	14, 19	eqeltrrd 2866	1 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝑍) → ⟨𝐵, (2nd ‘(𝑅‘(◡𝐺‘𝐵)))⟩ ∈ ran 𝑅)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2146  Vcvv 3457  ⟨cop 4597   ↦ cmpt 5194  ^◡ccnv 5662  ran crn 5664   ↾ cres 5665   “ cima 5666   Fn wfn 6535  –1-1-onto→wf1o 6539  ‘cfv 6540  (class class class)co 7419   ∈ cmpo 7421  ωcom 7868  2^nd c2nd 7991  reccrdg 8402   No csur 27857   1_s c1s 28052   +_s cadds 28205

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 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-rep 5240  ax-sep 5259  ax-nul 5271  ax-pow 5338  ax-pr 5406  ax-un 7742

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 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-rmo 3371  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-pss 3926  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-tp 4596  df-op 4598  df-ot 4600  df-uni 4875  df-int 4915  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-tr 5221  df-id 5558  df-eprel 5563  df-po 5571  df-so 5572  df-fr 5616  df-se 5617  df-we 5618  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-pred 6306  df-ord 6367  df-on 6368  df-lim 6369  df-suc 6370  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-riota 7376  df-ov 7422  df-oprab 7423  df-mpo 7424  df-om 7869  df-1st 7992  df-2nd 7993  df-frecs 8284  df-wrecs 8315  df-recs 8364  df-rdg 8403  df-1o 8459  df-2o 8460  df-oadd 8463  df-nadd 8658  df-no 27860  df-lts 27861  df-bday 27862  df-les 27962  df-slts 28004  df-cuts 28006  df-0s 28053  df-1s 28054  df-made 28073  df-old 28074  df-left 28076  df-right 28077  df-norec2 28195  df-adds 28206

This theorem is used by:  noseqrdgfn  28552  noseqrdgsuc  28554