Theorem noseqrdg0 28208

Description: Initial value of a recursive definition 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 ), (𝑥𝐹𝑦)⟩), ⟨𝐶, 𝐴⟩) ↾ ω))
noseqrdg.3	⊢ (𝜑 → 𝑆 = ran 𝑅)

Assertion

Ref	Expression
noseqrdg0	⊢ (𝜑 → (𝑆‘𝐶) = 𝐴)

Distinct variable groups:   𝑥,𝐶   𝑥,𝐹,𝑦

Allowed substitution hints:   𝜑(𝑥,𝑦)   𝐴(𝑥,𝑦)   𝐶(𝑦)   𝑅(𝑥,𝑦)   𝑆(𝑥,𝑦)   𝐺(𝑥,𝑦)   𝑉(𝑥,𝑦)   𝑍(𝑥,𝑦)

Proof of Theorem noseqrdg0

Step	Hyp	Ref	Expression
1		om2noseq.1	. . . 4 ⊢ (𝜑 → 𝐶 ∈ No )
2		om2noseq.2	. . . 4 ⊢ (𝜑 → 𝐺 = (rec((𝑥 ∈ V ↦ (𝑥 +s 1s )), 𝐶) ↾ ω))
3		om2noseq.3	. . . 4 ⊢ (𝜑 → 𝑍 = (rec((𝑥 ∈ V ↦ (𝑥 +s 1s )), 𝐶) “ ω))
4		noseqrdg.1	. . . 4 ⊢ (𝜑 → 𝐴 ∈ 𝑉)
5		noseqrdg.2	. . . 4 ⊢ (𝜑 → 𝑅 = (rec((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 +s 1s ), (𝑥𝐹𝑦)⟩), ⟨𝐶, 𝐴⟩) ↾ ω))
6		noseqrdg.3	. . . 4 ⊢ (𝜑 → 𝑆 = ran 𝑅)
7	1, 2, 3, 4, 5, 6	noseqrdgfn 28207	. . 3 ⊢ (𝜑 → 𝑆 Fn 𝑍)
8	7	fnfund 6622	. 2 ⊢ (𝜑 → Fun 𝑆)
9		frfnom 8406	. . . . 5 ⊢ (rec((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 +s 1s ), (𝑥𝐹𝑦)⟩), ⟨𝐶, 𝐴⟩) ↾ ω) Fn ω
10	5	fneq1d 6614	. . . . 5 ⊢ (𝜑 → (𝑅 Fn ω ↔ (rec((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 +s 1s ), (𝑥𝐹𝑦)⟩), ⟨𝐶, 𝐴⟩) ↾ ω) Fn ω))
11	9, 10	mpbiri 258	. . . 4 ⊢ (𝜑 → 𝑅 Fn ω)
12		peano1 7868	. . . 4 ⊢ ∅ ∈ ω
13		fnfvelrn 7055	. . . 4 ⊢ ((𝑅 Fn ω ∧ ∅ ∈ ω) → (𝑅‘∅) ∈ ran 𝑅)
14	11, 12, 13	sylancl 586	. . 3 ⊢ (𝜑 → (𝑅‘∅) ∈ ran 𝑅)
15	5	fveq1d 6863	. . . 4 ⊢ (𝜑 → (𝑅‘∅) = ((rec((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 +s 1s ), (𝑥𝐹𝑦)⟩), ⟨𝐶, 𝐴⟩) ↾ ω)‘∅))
16		opex 5427	. . . . 5 ⊢ ⟨𝐶, 𝐴⟩ ∈ V
17		fr0g 8407	. . . . 5 ⊢ (⟨𝐶, 𝐴⟩ ∈ V → ((rec((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 +s 1s ), (𝑥𝐹𝑦)⟩), ⟨𝐶, 𝐴⟩) ↾ ω)‘∅) = ⟨𝐶, 𝐴⟩)
18	16, 17	ax-mp 5	. . . 4 ⊢ ((rec((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 +s 1s ), (𝑥𝐹𝑦)⟩), ⟨𝐶, 𝐴⟩) ↾ ω)‘∅) = ⟨𝐶, 𝐴⟩
19	15, 18	eqtr2di 2782	. . 3 ⊢ (𝜑 → ⟨𝐶, 𝐴⟩ = (𝑅‘∅))
20	14, 19, 6	3eltr4d 2844	. 2 ⊢ (𝜑 → ⟨𝐶, 𝐴⟩ ∈ 𝑆)
21		funopfv 6913	. 2 ⊢ (Fun 𝑆 → (⟨𝐶, 𝐴⟩ ∈ 𝑆 → (𝑆‘𝐶) = 𝐴))
22	8, 20, 21	sylc 65	1 ⊢ (𝜑 → (𝑆‘𝐶) = 𝐴)

Syntax hints:   → wi 4   = wceq 1540   ∈ wcel 2109  Vcvv 3450  ∅c0 4299  ⟨cop 4598   ↦ cmpt 5191  ran crn 5642   ↾ cres 5643   “ cima 5644  Fun wfun 6508   Fn wfn 6509  ‘cfv 6514  (class class class)co 7390   ∈ cmpo 7392  ωcom 7845  reccrdg 8380   No csur 27558   1_s c1s 27742   +_s cadds 27873

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2702  ax-rep 5237  ax-sep 5254  ax-nul 5264  ax-pow 5323  ax-pr 5390  ax-un 7714

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2534  df-eu 2563  df-clab 2709  df-cleq 2722  df-clel 2804  df-nfc 2879  df-ne 2927  df-ral 3046  df-rex 3055  df-rmo 3356  df-reu 3357  df-rab 3409  df-v 3452  df-sbc 3757  df-csb 3866  df-dif 3920  df-un 3922  df-in 3924  df-ss 3934  df-pss 3937  df-nul 4300  df-if 4492  df-pw 4568  df-sn 4593  df-pr 4595  df-tp 4597  df-op 4599  df-ot 4601  df-uni 4875  df-int 4914  df-iun 4960  df-br 5111  df-opab 5173  df-mpt 5192  df-tr 5218  df-id 5536  df-eprel 5541  df-po 5549  df-so 5550  df-fr 5594  df-se 5595  df-we 5596  df-xp 5647  df-rel 5648  df-cnv 5649  df-co 5650  df-dm 5651  df-rn 5652  df-res 5653  df-ima 5654  df-pred 6277  df-ord 6338  df-on 6339  df-lim 6340  df-suc 6341  df-iota 6467  df-fun 6516  df-fn 6517  df-f 6518  df-f1 6519  df-fo 6520  df-f1o 6521  df-fv 6522  df-riota 7347  df-ov 7393  df-oprab 7394  df-mpo 7395  df-om 7846  df-1st 7971  df-2nd 7972  df-frecs 8263  df-wrecs 8294  df-recs 8343  df-rdg 8381  df-1o 8437  df-2o 8438  df-oadd 8441  df-nadd 8633  df-no 27561  df-slt 27562  df-bday 27563  df-sle 27664  df-sslt 27700  df-scut 27702  df-0s 27743  df-1s 27744  df-made 27762  df-old 27763  df-left 27765  df-right 27766  df-norec2 27863  df-adds 27874

This theorem is referenced by:  seqs1  28211