Theorem seqsp1 28754

Description: The value of the surreal sequence builder at a successor. (Contributed by Scott Fenton, 19-Apr-2025.)

Hypotheses

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

Assertion

Ref	Expression
seqsp1	⊢ (𝜑 → (seqs𝑀( + , 𝐹)‘(𝑁 +s 1s )) = ((seqs𝑀( + , 𝐹)‘𝑁) + (𝐹‘(𝑁 +s 1s ))))

Proof of Theorem seqsp1

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

Step	Hyp	Ref	Expression
1		seqsp1.3	. . 3 ⊢ (𝜑 → 𝑁 ∈ 𝑍)
2		seqsp1.1	. . . 4 ⊢ (𝜑 → 𝑀 ∈ No)
3		eqidd 2764	. . . 4 ⊢ (𝜑 → (rec((𝑦 ∈ V ↦ (𝑦 +s 1s )), 𝑀) ↾ ω) = (rec((𝑦 ∈ V ↦ (𝑦 +s 1s )), 𝑀) ↾ ω))
4		seqsp1.2	. . . . 5 ⊢ (𝜑 → 𝑍 = (rec((𝑥 ∈ V ↦ (𝑥 +s 1s )), 𝑀) “ ω))
5		oveq1 7458	. . . . . . . 8 ⊢ (𝑥 = 𝑦 → (𝑥 +s 1s ) = (𝑦 +s 1s ))
6	5	cbvmptv 5215	. . . . . . 7 ⊢ (𝑥 ∈ V ↦ (𝑥 +s 1s )) = (𝑦 ∈ V ↦ (𝑦 +s 1s ))
7		rdgeq1 8457	. . . . . . 7 ⊢ ((𝑥 ∈ V ↦ (𝑥 +s 1s )) = (𝑦 ∈ V ↦ (𝑦 +s 1s )) → rec((𝑥 ∈ V ↦ (𝑥 +s 1s )), 𝑀) = rec((𝑦 ∈ V ↦ (𝑦 +s 1s )), 𝑀))
8	6, 7	ax-mp 5	. . . . . 6 ⊢ rec((𝑥 ∈ V ↦ (𝑥 +s 1s )), 𝑀) = rec((𝑦 ∈ V ↦ (𝑦 +s 1s )), 𝑀)
9	8	imaeq1i 6067	. . . . 5 ⊢ (rec((𝑥 ∈ V ↦ (𝑥 +s 1s )), 𝑀) “ ω) = (rec((𝑦 ∈ V ↦ (𝑦 +s 1s )), 𝑀) “ ω)
10	4, 9	eqtrdi 2814	. . . 4 ⊢ (𝜑 → 𝑍 = (rec((𝑦 ∈ V ↦ (𝑦 +s 1s )), 𝑀) “ ω))
11		fvexd 6931	. . . 4 ⊢ (𝜑 → (𝐹‘𝑀) ∈ V)
12		eqidd 2764	. . . 4 ⊢ (𝜑 → (rec((𝑦 ∈ V, 𝑧 ∈ V ↦ ⟨(𝑦 +s 1s ), (𝑦(𝑤 ∈ V, 𝑡 ∈ V ↦ (𝑡 + (𝐹‘(𝑤 +s 1s ))))𝑧)⟩), ⟨𝑀, (𝐹‘𝑀)⟩) ↾ ω) = (rec((𝑦 ∈ V, 𝑧 ∈ V ↦ ⟨(𝑦 +s 1s ), (𝑦(𝑤 ∈ V, 𝑡 ∈ V ↦ (𝑡 + (𝐹‘(𝑤 +s 1s ))))𝑧)⟩), ⟨𝑀, (𝐹‘𝑀)⟩) ↾ ω))
13	12	seqsval 28731	. . . 4 ⊢ (𝜑 → seqs𝑀( + , 𝐹) = ran (rec((𝑦 ∈ V, 𝑧 ∈ V ↦ ⟨(𝑦 +s 1s ), (𝑦(𝑤 ∈ V, 𝑡 ∈ V ↦ (𝑡 + (𝐹‘(𝑤 +s 1s ))))𝑧)⟩), ⟨𝑀, (𝐹‘𝑀)⟩) ↾ ω))
14	2, 3, 10, 11, 12, 13	noseqrdgsuc 28751	. . 3 ⊢ ((𝜑 ∧ 𝑁 ∈ 𝑍) → (seqs𝑀( + , 𝐹)‘(𝑁 +s 1s )) = (𝑁(𝑤 ∈ V, 𝑡 ∈ V ↦ (𝑡 + (𝐹‘(𝑤 +s 1s ))))(seqs𝑀( + , 𝐹)‘𝑁)))
15	1, 14	mpdan 700	. 2 ⊢ (𝜑 → (seqs𝑀( + , 𝐹)‘(𝑁 +s 1s )) = (𝑁(𝑤 ∈ V, 𝑡 ∈ V ↦ (𝑡 + (𝐹‘(𝑤 +s 1s ))))(seqs𝑀( + , 𝐹)‘𝑁)))
16	1	elexd 3477	. . 3 ⊢ (𝜑 → 𝑁 ∈ V)
17		fvex 6929	. . 3 ⊢ (seqs𝑀( + , 𝐹)‘𝑁) ∈ V
18		fvoveq1 7474	. . . . 5 ⊢ (𝑤 = 𝑁 → (𝐹‘(𝑤 +s 1s )) = (𝐹‘(𝑁 +s 1s )))
19	18	oveq2d 7467	. . . 4 ⊢ (𝑤 = 𝑁 → (𝑡 + (𝐹‘(𝑤 +s 1s ))) = (𝑡 + (𝐹‘(𝑁 +s 1s ))))
20		oveq1 7458	. . . 4 ⊢ (𝑡 = (seqs𝑀( + , 𝐹)‘𝑁) → (𝑡 + (𝐹‘(𝑁 +s 1s ))) = ((seqs𝑀( + , 𝐹)‘𝑁) + (𝐹‘(𝑁 +s 1s ))))
21		eqid 2763	. . . 4 ⊢ (𝑤 ∈ V, 𝑡 ∈ V ↦ (𝑡 + (𝐹‘(𝑤 +s 1s )))) = (𝑤 ∈ V, 𝑡 ∈ V ↦ (𝑡 + (𝐹‘(𝑤 +s 1s ))))
22		ovex 7484	. . . 4 ⊢ ((seqs𝑀( + , 𝐹)‘𝑁) + (𝐹‘(𝑁 +s 1s ))) ∈ V
23	19, 20, 21, 22	ovmpo 7612	. . 3 ⊢ ((𝑁 ∈ V ∧ (seqs𝑀( + , 𝐹)‘𝑁) ∈ V) → (𝑁(𝑤 ∈ V, 𝑡 ∈ V ↦ (𝑡 + (𝐹‘(𝑤 +s 1s ))))(seqs𝑀( + , 𝐹)‘𝑁)) = ((seqs𝑀( + , 𝐹)‘𝑁) + (𝐹‘(𝑁 +s 1s ))))
24	16, 17, 23	sylancl 598	. 2 ⊢ (𝜑 → (𝑁(𝑤 ∈ V, 𝑡 ∈ V ↦ (𝑡 + (𝐹‘(𝑤 +s 1s ))))(seqs𝑀( + , 𝐹)‘𝑁)) = ((seqs𝑀( + , 𝐹)‘𝑁) + (𝐹‘(𝑁 +s 1s ))))
25	15, 24	eqtrd 2798	1 ⊢ (𝜑 → (seqs𝑀( + , 𝐹)‘(𝑁 +s 1s )) = ((seqs𝑀( + , 𝐹)‘𝑁) + (𝐹‘(𝑁 +s 1s ))))

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2147  Vcvv 3454  ⟨cop 4840   ↦ cmpt 5192   ↾ cres 5660   “ cima 5661  ‘cfv 6566  (class class class)co 7451   ∈ cmpo 7453  ωcom 7911  reccrdg 8455  Nocsur 28054   1_s c1s 28249   +_s cadds 28402  seq_scseqs 28726

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5238  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783

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 2102  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 4841  df-ot 4864  df-uni 4873  df-int 4913  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-se 5612  df-we 5613  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-pred 6330  df-ord 6391  df-on 6392  df-lim 6393  df-suc 6394  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-riota 7408  df-ov 7454  df-oprab 7455  df-mpo 7456  df-om 7912  df-1st 8035  df-2nd 8036  df-frecs 8337  df-wrecs 8368  df-recs 8417  df-rdg 8456  df-1o 8514  df-2o 8515  df-oadd 8518  df-nadd 8713  df-no 28057  df-lts 28058  df-bday 28059  df-les 28159  df-slts 28201  df-cuts 28203  df-0s 28250  df-1s 28251  df-made 28270  df-old 28271  df-left 28273  df-right 28274  df-norec2 28392  df-adds 28403  df-seqs 28727

This theorem is used by:  expsp1  28872