Theorem seqsfn 28555

Description: The surreal sequence builder is a function. (Contributed by Scott Fenton, 19-Apr-2025.)

Hypotheses

Ref	Expression
seqsfn.1	⊢ (𝜑 → 𝑀 ∈ No )
seqsfn.2	⊢ (𝜑 → 𝑍 = (rec((𝑥 ∈ V ↦ (𝑥 +s 1s )), 𝑀) “ ω))

Assertion

Ref	Expression
seqsfn	⊢ (𝜑 → seqs𝑀( + , 𝐹) Fn 𝑍)

Proof of Theorem seqsfn

Dummy variables 𝑡 𝑤 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		seqsfn.1	. 2 ⊢ (𝜑 → 𝑀 ∈ No )
2		eqidd 2766	. 2 ⊢ (𝜑 → (rec((𝑦 ∈ V ↦ (𝑦 +s 1s )), 𝑀) ↾ ω) = (rec((𝑦 ∈ V ↦ (𝑦 +s 1s )), 𝑀) ↾ ω))
3		seqsfn.2	. . 3 ⊢ (𝜑 → 𝑍 = (rec((𝑥 ∈ V ↦ (𝑥 +s 1s )), 𝑀) “ ω))
4		oveq1 7426	. . . . . 6 ⊢ (𝑥 = 𝑦 → (𝑥 +s 1s ) = (𝑦 +s 1s ))
5	4	cbvmptv 5217	. . . . 5 ⊢ (𝑥 ∈ V ↦ (𝑥 +s 1s )) = (𝑦 ∈ V ↦ (𝑦 +s 1s ))
6		rdgeq1 8404	. . . . 5 ⊢ ((𝑥 ∈ V ↦ (𝑥 +s 1s )) = (𝑦 ∈ V ↦ (𝑦 +s 1s )) → rec((𝑥 ∈ V ↦ (𝑥 +s 1s )), 𝑀) = rec((𝑦 ∈ V ↦ (𝑦 +s 1s )), 𝑀))
7	5, 6	ax-mp 5	. . . 4 ⊢ rec((𝑥 ∈ V ↦ (𝑥 +s 1s )), 𝑀) = rec((𝑦 ∈ V ↦ (𝑦 +s 1s )), 𝑀)
8	7	imaeq1i 6061	. . 3 ⊢ (rec((𝑥 ∈ V ↦ (𝑥 +s 1s )), 𝑀) “ ω) = (rec((𝑦 ∈ V ↦ (𝑦 +s 1s )), 𝑀) “ ω)
9	3, 8	eqtrdi 2816	. 2 ⊢ (𝜑 → 𝑍 = (rec((𝑦 ∈ V ↦ (𝑦 +s 1s )), 𝑀) “ ω))
10		fvexd 6900	. 2 ⊢ (𝜑 → (𝐹‘𝑀) ∈ V)
11		eqidd 2766	. 2 ⊢ (𝜑 → (rec((𝑦 ∈ V, 𝑧 ∈ V ↦ ⟨(𝑦 +s 1s ), (𝑦(𝑤 ∈ V, 𝑡 ∈ V ↦ (𝑡 + (𝐹‘(𝑤 +s 1s ))))𝑧)⟩), ⟨𝑀, (𝐹‘𝑀)⟩) ↾ ω) = (rec((𝑦 ∈ V, 𝑧 ∈ V ↦ ⟨(𝑦 +s 1s ), (𝑦(𝑤 ∈ V, 𝑡 ∈ V ↦ (𝑡 + (𝐹‘(𝑤 +s 1s ))))𝑧)⟩), ⟨𝑀, (𝐹‘𝑀)⟩) ↾ ω))
12	11	seqsval 28534	. 2 ⊢ (𝜑 → seqs𝑀( + , 𝐹) = ran (rec((𝑦 ∈ V, 𝑧 ∈ V ↦ ⟨(𝑦 +s 1s ), (𝑦(𝑤 ∈ V, 𝑡 ∈ V ↦ (𝑡 + (𝐹‘(𝑤 +s 1s ))))𝑧)⟩), ⟨𝑀, (𝐹‘𝑀)⟩) ↾ ω))
13	1, 2, 9, 10, 11, 12	noseqrdgfn 28552	1 ⊢ (𝜑 → seqs𝑀( + , 𝐹) Fn 𝑍)

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2146  Vcvv 3457  ⟨cop 4597   ↦ cmpt 5194   ↾ cres 5665   “ cima 5666   Fn wfn 6535  ‘cfv 6540  (class class class)co 7419   ∈ cmpo 7421  ωcom 7868  reccrdg 8402   No csur 27857   1_s c1s 28052   +_s cadds 28205  seq_scseqs 28529

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  df-seqs 28530

This theorem is used by:  seqn0sfn  28606