Theorem noseqrdg0 28235

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 28234	. . 3 ⊢ (𝜑 → 𝑆 Fn 𝑍)
8	7	fnfund 6582	. 2 ⊢ (𝜑 → Fun 𝑆)
9		frfnom 8354	. . . . 5 ⊢ (rec((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 +s 1s ), (𝑥𝐹𝑦)⟩), ⟨𝐶, 𝐴⟩) ↾ ω) Fn ω
10	5	fneq1d 6574	. . . . 5 ⊢ (𝜑 → (𝑅 Fn ω ↔ (rec((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 +s 1s ), (𝑥𝐹𝑦)⟩), ⟨𝐶, 𝐴⟩) ↾ ω) Fn ω))
11	9, 10	mpbiri 258	. . . 4 ⊢ (𝜑 → 𝑅 Fn ω)
12		peano1 7819	. . . 4 ⊢ ∅ ∈ ω
13		fnfvelrn 7013	. . . 4 ⊢ ((𝑅 Fn ω ∧ ∅ ∈ ω) → (𝑅‘∅) ∈ ran 𝑅)
14	11, 12, 13	sylancl 586	. . 3 ⊢ (𝜑 → (𝑅‘∅) ∈ ran 𝑅)
15	5	fveq1d 6824	. . . 4 ⊢ (𝜑 → (𝑅‘∅) = ((rec((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 +s 1s ), (𝑥𝐹𝑦)⟩), ⟨𝐶, 𝐴⟩) ↾ ω)‘∅))
16		opex 5404	. . . . 5 ⊢ ⟨𝐶, 𝐴⟩ ∈ V
17		fr0g 8355	. . . . 5 ⊢ (⟨𝐶, 𝐴⟩ ∈ V → ((rec((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 +s 1s ), (𝑥𝐹𝑦)⟩), ⟨𝐶, 𝐴⟩) ↾ ω)‘∅) = ⟨𝐶, 𝐴⟩)
18	16, 17	ax-mp 5	. . . 4 ⊢ ((rec((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 +s 1s ), (𝑥𝐹𝑦)⟩), ⟨𝐶, 𝐴⟩) ↾ ω)‘∅) = ⟨𝐶, 𝐴⟩
19	15, 18	eqtr2di 2783	. . 3 ⊢ (𝜑 → ⟨𝐶, 𝐴⟩ = (𝑅‘∅))
20	14, 19, 6	3eltr4d 2846	. 2 ⊢ (𝜑 → ⟨𝐶, 𝐴⟩ ∈ 𝑆)
21		funopfv 6871	. 2 ⊢ (Fun 𝑆 → (⟨𝐶, 𝐴⟩ ∈ 𝑆 → (𝑆‘𝐶) = 𝐴))
22	8, 20, 21	sylc 65	1 ⊢ (𝜑 → (𝑆‘𝐶) = 𝐴)

Syntax hints:   → wi 4   = wceq 1541   ∈ wcel 2111  Vcvv 3436  ∅c0 4283  ⟨cop 4582   ↦ cmpt 5172  ran crn 5617   ↾ cres 5618   “ cima 5619  Fun wfun 6475   Fn wfn 6476  ‘cfv 6481  (class class class)co 7346   ∈ cmpo 7348  ωcom 7796  reccrdg 8328   No csur 27576   1_s c1s 27765   +_s cadds 27900

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 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-10 2144  ax-11 2160  ax-12 2180  ax-ext 2703  ax-rep 5217  ax-sep 5234  ax-nul 5244  ax-pow 5303  ax-pr 5370  ax-un 7668

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2535  df-eu 2564  df-clab 2710  df-cleq 2723  df-clel 2806  df-nfc 2881  df-ne 2929  df-ral 3048  df-rex 3057  df-rmo 3346  df-reu 3347  df-rab 3396  df-v 3438  df-sbc 3742  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4284  df-if 4476  df-pw 4552  df-sn 4577  df-pr 4579  df-tp 4581  df-op 4583  df-ot 4585  df-uni 4860  df-int 4898  df-iun 4943  df-br 5092  df-opab 5154  df-mpt 5173  df-tr 5199  df-id 5511  df-eprel 5516  df-po 5524  df-so 5525  df-fr 5569  df-se 5570  df-we 5571  df-xp 5622  df-rel 5623  df-cnv 5624  df-co 5625  df-dm 5626  df-rn 5627  df-res 5628  df-ima 5629  df-pred 6248  df-ord 6309  df-on 6310  df-lim 6311  df-suc 6312  df-iota 6437  df-fun 6483  df-fn 6484  df-f 6485  df-f1 6486  df-fo 6487  df-f1o 6488  df-fv 6489  df-riota 7303  df-ov 7349  df-oprab 7350  df-mpo 7351  df-om 7797  df-1st 7921  df-2nd 7922  df-frecs 8211  df-wrecs 8242  df-recs 8291  df-rdg 8329  df-1o 8385  df-2o 8386  df-oadd 8389  df-nadd 8581  df-no 27579  df-slt 27580  df-bday 27581  df-sle 27682  df-sslt 27719  df-scut 27721  df-0s 27766  df-1s 27767  df-made 27786  df-old 27787  df-left 27789  df-right 27790  df-norec2 27890  df-adds 27901

This theorem is referenced by:  seqs1  28238