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

Theorem expsval 28439
Description: The value of surreal exponentiation. (Contributed by Scott Fenton, 24-Jul-2025.)
Assertion
Ref Expression
expsval ((𝐴 No 𝐵 ∈ ℤs) → (𝐴s𝐵) = if(𝐵 = 0s , 1s , if( 0s <s 𝐵, (seqs 1s ( ·s , (ℕs × {𝐴}))‘𝐵), ( 1s /su (seqs 1s ( ·s , (ℕs × {𝐴}))‘( -us𝐵))))))

Proof of Theorem expsval
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eqidd 2742 . . . . . 6 (𝑥 = 𝐴 → 1s = 1s )
2 eqidd 2742 . . . . . 6 (𝑥 = 𝐴 → ·s = ·s )
3 sneq 4568 . . . . . . 7 (𝑥 = 𝐴 → {𝑥} = {𝐴})
43xpeq2d 5651 . . . . . 6 (𝑥 = 𝐴 → (ℕs × {𝑥}) = (ℕs × {𝐴}))
51, 2, 4seqseq123d 28300 . . . . 5 (𝑥 = 𝐴 → seqs 1s ( ·s , (ℕs × {𝑥})) = seqs 1s ( ·s , (ℕs × {𝐴})))
65fveq1d 6833 . . . 4 (𝑥 = 𝐴 → (seqs 1s ( ·s , (ℕs × {𝑥}))‘𝑦) = (seqs 1s ( ·s , (ℕs × {𝐴}))‘𝑦))
75fveq1d 6833 . . . . 5 (𝑥 = 𝐴 → (seqs 1s ( ·s , (ℕs × {𝑥}))‘( -us𝑦)) = (seqs 1s ( ·s , (ℕs × {𝐴}))‘( -us𝑦)))
87oveq2d 7376 . . . 4 (𝑥 = 𝐴 → ( 1s /su (seqs 1s ( ·s , (ℕs × {𝑥}))‘( -us𝑦))) = ( 1s /su (seqs 1s ( ·s , (ℕs × {𝐴}))‘( -us𝑦))))
96, 8ifeq12d 4479 . . 3 (𝑥 = 𝐴 → if( 0s <s 𝑦, (seqs 1s ( ·s , (ℕs × {𝑥}))‘𝑦), ( 1s /su (seqs 1s ( ·s , (ℕs × {𝑥}))‘( -us𝑦)))) = if( 0s <s 𝑦, (seqs 1s ( ·s , (ℕs × {𝐴}))‘𝑦), ( 1s /su (seqs 1s ( ·s , (ℕs × {𝐴}))‘( -us𝑦)))))
109ifeq2d 4478 . 2 (𝑥 = 𝐴 → if(𝑦 = 0s , 1s , if( 0s <s 𝑦, (seqs 1s ( ·s , (ℕs × {𝑥}))‘𝑦), ( 1s /su (seqs 1s ( ·s , (ℕs × {𝑥}))‘( -us𝑦))))) = if(𝑦 = 0s , 1s , if( 0s <s 𝑦, (seqs 1s ( ·s , (ℕs × {𝐴}))‘𝑦), ( 1s /su (seqs 1s ( ·s , (ℕs × {𝐴}))‘( -us𝑦))))))
11 eqeq1 2745 . . 3 (𝑦 = 𝐵 → (𝑦 = 0s𝐵 = 0s ))
12 breq2 5079 . . . 4 (𝑦 = 𝐵 → ( 0s <s 𝑦 ↔ 0s <s 𝐵))
13 fveq2 6831 . . . 4 (𝑦 = 𝐵 → (seqs 1s ( ·s , (ℕs × {𝐴}))‘𝑦) = (seqs 1s ( ·s , (ℕs × {𝐴}))‘𝐵))
14 2fveq3 6836 . . . . 5 (𝑦 = 𝐵 → (seqs 1s ( ·s , (ℕs × {𝐴}))‘( -us𝑦)) = (seqs 1s ( ·s , (ℕs × {𝐴}))‘( -us𝐵)))
1514oveq2d 7376 . . . 4 (𝑦 = 𝐵 → ( 1s /su (seqs 1s ( ·s , (ℕs × {𝐴}))‘( -us𝑦))) = ( 1s /su (seqs 1s ( ·s , (ℕs × {𝐴}))‘( -us𝐵))))
1612, 13, 15ifbieq12d 4486 . . 3 (𝑦 = 𝐵 → if( 0s <s 𝑦, (seqs 1s ( ·s , (ℕs × {𝐴}))‘𝑦), ( 1s /su (seqs 1s ( ·s , (ℕs × {𝐴}))‘( -us𝑦)))) = if( 0s <s 𝐵, (seqs 1s ( ·s , (ℕs × {𝐴}))‘𝐵), ( 1s /su (seqs 1s ( ·s , (ℕs × {𝐴}))‘( -us𝐵)))))
1711, 16ifbieq2d 4484 . 2 (𝑦 = 𝐵 → if(𝑦 = 0s , 1s , if( 0s <s 𝑦, (seqs 1s ( ·s , (ℕs × {𝐴}))‘𝑦), ( 1s /su (seqs 1s ( ·s , (ℕs × {𝐴}))‘( -us𝑦))))) = if(𝐵 = 0s , 1s , if( 0s <s 𝐵, (seqs 1s ( ·s , (ℕs × {𝐴}))‘𝐵), ( 1s /su (seqs 1s ( ·s , (ℕs × {𝐴}))‘( -us𝐵))))))
18 df-exps 28427 . 2 s = (𝑥 No , 𝑦 ∈ ℤs ↦ if(𝑦 = 0s , 1s , if( 0s <s 𝑦, (seqs 1s ( ·s , (ℕs × {𝑥}))‘𝑦), ( 1s /su (seqs 1s ( ·s , (ℕs × {𝑥}))‘( -us𝑦))))))
19 1no 27824 . . . 4 1s No
2019elexi 3455 . . 3 1s ∈ V
21 fvex 6844 . . . 4 (seqs 1s ( ·s , (ℕs × {𝐴}))‘𝐵) ∈ V
22 ovex 7393 . . . 4 ( 1s /su (seqs 1s ( ·s , (ℕs × {𝐴}))‘( -us𝐵))) ∈ V
2321, 22ifex 4508 . . 3 if( 0s <s 𝐵, (seqs 1s ( ·s , (ℕs × {𝐴}))‘𝐵), ( 1s /su (seqs 1s ( ·s , (ℕs × {𝐴}))‘( -us𝐵)))) ∈ V
2420, 23ifex 4508 . 2 if(𝐵 = 0s , 1s , if( 0s <s 𝐵, (seqs 1s ( ·s , (ℕs × {𝐴}))‘𝐵), ( 1s /su (seqs 1s ( ·s , (ℕs × {𝐴}))‘( -us𝐵))))) ∈ V
2510, 17, 18, 24ovmpo 7520 1 ((𝐴 No 𝐵 ∈ ℤs) → (𝐴s𝐵) = if(𝐵 = 0s , 1s , if( 0s <s 𝐵, (seqs 1s ( ·s , (ℕs × {𝐴}))‘𝐵), ( 1s /su (seqs 1s ( ·s , (ℕs × {𝐴}))‘( -us𝐵))))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 397   = wceq 1548  wcel 2121  ifcif 4457  {csn 4558   class class class wbr 5075   × cxp 5619  cfv 6489  (class class class)co 7360   No csur 27625   <s clts 27626   0s c0s 27819   1s c1s 27820   -us cnegs 28033   ·s cmuls 28120   /su cdivs 28201  seqscseqs 28297  scnns 28327  sczs 28392  scexps 28426
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1975  ax-7 2016  ax-8 2123  ax-9 2131  ax-10 2154  ax-11 2170  ax-12 2191  ax-ext 2713  ax-rep 5202  ax-sep 5221  ax-nul 5231  ax-pow 5297  ax-pr 5365  ax-un 7682
This theorem depends on definitions:  df-bi 209  df-an 398  df-or 855  df-3or 1094  df-3an 1095  df-tru 1551  df-fal 1561  df-ex 1788  df-nf 1792  df-sb 2075  df-mo 2545  df-eu 2575  df-clab 2720  df-cleq 2733  df-clel 2816  df-nfc 2890  df-ne 2937  df-ral 3056  df-rex 3066  df-rmo 3346  df-reu 3347  df-rab 3394  df-v 3435  df-sbc 3726  df-csb 3834  df-dif 3888  df-un 3890  df-in 3892  df-ss 3902  df-pss 3905  df-nul 4265  df-if 4458  df-pw 4534  df-sn 4559  df-pr 4561  df-tp 4563  df-op 4565  df-uni 4842  df-int 4881  df-br 5076  df-opab 5138  df-mpt 5157  df-tr 5183  df-id 5516  df-eprel 5521  df-po 5529  df-so 5530  df-fr 5574  df-we 5576  df-xp 5627  df-rel 5628  df-cnv 5629  df-co 5630  df-dm 5631  df-rn 5632  df-res 5633  df-ima 5634  df-pred 6256  df-ord 6317  df-on 6318  df-suc 6320  df-iota 6445  df-fun 6491  df-fn 6492  df-f 6493  df-f1 6494  df-fo 6495  df-f1o 6496  df-fv 6497  df-riota 7317  df-ov 7363  df-oprab 7364  df-mpo 7365  df-frecs 8225  df-wrecs 8256  df-recs 8305  df-rdg 8343  df-1o 8399  df-2o 8400  df-no 27628  df-lts 27629  df-bday 27630  df-slts 27772  df-cuts 27774  df-0s 27821  df-1s 27822  df-seqs 28298  df-exps 28427
This theorem is referenced by:  expnnsval  28440  exps0  28441
  Copyright terms: Public domain W3C validator