MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  seqsp1 Structured version   Visualization version   GIF version

Theorem seqsp1 28321
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.
StepHypRef Expression
1 seqsp1.3 . . 3 (𝜑𝑁𝑍)
2 seqsp1.1 . . . 4 (𝜑𝑀 No )
3 eqidd 2740 . . . 4 (𝜑 → (rec((𝑦 ∈ V ↦ (𝑦 +s 1s )), 𝑀) ↾ ω) = (rec((𝑦 ∈ V ↦ (𝑦 +s 1s )), 𝑀) ↾ ω))
4 seqsp1.2 . . . . 5 (𝜑𝑍 = (rec((𝑥 ∈ V ↦ (𝑥 +s 1s )), 𝑀) “ ω))
5 oveq1 7363 . . . . . . . 8 (𝑥 = 𝑦 → (𝑥 +s 1s ) = (𝑦 +s 1s ))
65cbvmptv 5176 . . . . . . 7 (𝑥 ∈ V ↦ (𝑥 +s 1s )) = (𝑦 ∈ V ↦ (𝑦 +s 1s ))
7 rdgeq1 8340 . . . . . . 7 ((𝑥 ∈ V ↦ (𝑥 +s 1s )) = (𝑦 ∈ V ↦ (𝑦 +s 1s )) → rec((𝑥 ∈ V ↦ (𝑥 +s 1s )), 𝑀) = rec((𝑦 ∈ V ↦ (𝑦 +s 1s )), 𝑀))
86, 7ax-mp 5 . . . . . 6 rec((𝑥 ∈ V ↦ (𝑥 +s 1s )), 𝑀) = rec((𝑦 ∈ V ↦ (𝑦 +s 1s )), 𝑀)
98imaeq1i 6009 . . . . 5 (rec((𝑥 ∈ V ↦ (𝑥 +s 1s )), 𝑀) “ ω) = (rec((𝑦 ∈ V ↦ (𝑦 +s 1s )), 𝑀) “ ω)
104, 9eqtrdi 2790 . . . 4 (𝜑𝑍 = (rec((𝑦 ∈ V ↦ (𝑦 +s 1s )), 𝑀) “ ω))
11 fvexd 6842 . . . 4 (𝜑 → (𝐹𝑀) ∈ V)
12 eqidd 2740 . . . 4 (𝜑 → (rec((𝑦 ∈ V, 𝑧 ∈ V ↦ ⟨(𝑦 +s 1s ), (𝑦(𝑤 ∈ V, 𝑡 ∈ V ↦ (𝑡 + (𝐹‘(𝑤 +s 1s ))))𝑧)⟩), ⟨𝑀, (𝐹𝑀)⟩) ↾ ω) = (rec((𝑦 ∈ V, 𝑧 ∈ V ↦ ⟨(𝑦 +s 1s ), (𝑦(𝑤 ∈ V, 𝑡 ∈ V ↦ (𝑡 + (𝐹‘(𝑤 +s 1s ))))𝑧)⟩), ⟨𝑀, (𝐹𝑀)⟩) ↾ ω))
1312seqsval 28298 . . . 4 (𝜑 → seqs𝑀( + , 𝐹) = ran (rec((𝑦 ∈ V, 𝑧 ∈ V ↦ ⟨(𝑦 +s 1s ), (𝑦(𝑤 ∈ V, 𝑡 ∈ V ↦ (𝑡 + (𝐹‘(𝑤 +s 1s ))))𝑧)⟩), ⟨𝑀, (𝐹𝑀)⟩) ↾ ω))
142, 3, 10, 11, 12, 13noseqrdgsuc 28318 . . 3 ((𝜑𝑁𝑍) → (seqs𝑀( + , 𝐹)‘(𝑁 +s 1s )) = (𝑁(𝑤 ∈ V, 𝑡 ∈ V ↦ (𝑡 + (𝐹‘(𝑤 +s 1s ))))(seqs𝑀( + , 𝐹)‘𝑁)))
151, 14mpdan 693 . 2 (𝜑 → (seqs𝑀( + , 𝐹)‘(𝑁 +s 1s )) = (𝑁(𝑤 ∈ V, 𝑡 ∈ V ↦ (𝑡 + (𝐹‘(𝑤 +s 1s ))))(seqs𝑀( + , 𝐹)‘𝑁)))
161elexd 3454 . . 3 (𝜑𝑁 ∈ V)
17 fvex 6840 . . 3 (seqs𝑀( + , 𝐹)‘𝑁) ∈ V
18 fvoveq1 7379 . . . . 5 (𝑤 = 𝑁 → (𝐹‘(𝑤 +s 1s )) = (𝐹‘(𝑁 +s 1s )))
1918oveq2d 7372 . . . 4 (𝑤 = 𝑁 → (𝑡 + (𝐹‘(𝑤 +s 1s ))) = (𝑡 + (𝐹‘(𝑁 +s 1s ))))
20 oveq1 7363 . . . 4 (𝑡 = (seqs𝑀( + , 𝐹)‘𝑁) → (𝑡 + (𝐹‘(𝑁 +s 1s ))) = ((seqs𝑀( + , 𝐹)‘𝑁) + (𝐹‘(𝑁 +s 1s ))))
21 eqid 2739 . . . 4 (𝑤 ∈ V, 𝑡 ∈ V ↦ (𝑡 + (𝐹‘(𝑤 +s 1s )))) = (𝑤 ∈ V, 𝑡 ∈ V ↦ (𝑡 + (𝐹‘(𝑤 +s 1s ))))
22 ovex 7389 . . . 4 ((seqs𝑀( + , 𝐹)‘𝑁) + (𝐹‘(𝑁 +s 1s ))) ∈ V
2319, 20, 21, 22ovmpo 7516 . . 3 ((𝑁 ∈ V ∧ (seqs𝑀( + , 𝐹)‘𝑁) ∈ V) → (𝑁(𝑤 ∈ V, 𝑡 ∈ V ↦ (𝑡 + (𝐹‘(𝑤 +s 1s ))))(seqs𝑀( + , 𝐹)‘𝑁)) = ((seqs𝑀( + , 𝐹)‘𝑁) + (𝐹‘(𝑁 +s 1s ))))
2416, 17, 23sylancl 592 . 2 (𝜑 → (𝑁(𝑤 ∈ V, 𝑡 ∈ V ↦ (𝑡 + (𝐹‘(𝑤 +s 1s ))))(seqs𝑀( + , 𝐹)‘𝑁)) = ((seqs𝑀( + , 𝐹)‘𝑁) + (𝐹‘(𝑁 +s 1s ))))
2515, 24eqtrd 2774 1 (𝜑 → (seqs𝑀( + , 𝐹)‘(𝑁 +s 1s )) = ((seqs𝑀( + , 𝐹)‘𝑁) + (𝐹‘(𝑁 +s 1s ))))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1547  wcel 2119  Vcvv 3431  cop 4561  cmpt 5153  cres 5620  cima 5621  cfv 6485  (class class class)co 7356  cmpo 7358  ωcom 7806  reccrdg 8338   No csur 27621   1s c1s 27816   +s cadds 27969  seqscseqs 28293
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2711  ax-rep 5199  ax-sep 5218  ax-nul 5228  ax-pow 5294  ax-pr 5362  ax-un 7678
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3or 1093  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2718  df-cleq 2731  df-clel 2814  df-nfc 2888  df-ne 2935  df-ral 3054  df-rex 3064  df-rmo 3344  df-reu 3345  df-rab 3392  df-v 3433  df-sbc 3724  df-csb 3832  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-pss 3903  df-nul 4262  df-if 4455  df-pw 4531  df-sn 4556  df-pr 4558  df-tp 4560  df-op 4562  df-ot 4564  df-uni 4839  df-int 4878  df-iun 4923  df-br 5073  df-opab 5135  df-mpt 5154  df-tr 5180  df-id 5513  df-eprel 5518  df-po 5526  df-so 5527  df-fr 5571  df-se 5572  df-we 5573  df-xp 5624  df-rel 5625  df-cnv 5626  df-co 5627  df-dm 5628  df-rn 5629  df-res 5630  df-ima 5631  df-pred 6252  df-ord 6313  df-on 6314  df-lim 6315  df-suc 6316  df-iota 6441  df-fun 6487  df-fn 6488  df-f 6489  df-f1 6490  df-fo 6491  df-f1o 6492  df-fv 6493  df-riota 7313  df-ov 7359  df-oprab 7360  df-mpo 7361  df-om 7807  df-1st 7931  df-2nd 7932  df-frecs 8221  df-wrecs 8252  df-recs 8301  df-rdg 8339  df-1o 8395  df-2o 8396  df-oadd 8399  df-nadd 8592  df-no 27624  df-lts 27625  df-bday 27626  df-les 27727  df-slts 27768  df-cuts 27770  df-0s 27817  df-1s 27818  df-made 27837  df-old 27838  df-left 27840  df-right 27841  df-norec2 27959  df-adds 27970  df-seqs 28294
This theorem is referenced by:  expsp1  28439
  Copyright terms: Public domain W3C validator