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

Theorem expsval 28520
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 2765 . . . . . 6 (𝑥 = 𝐴 → 1s = 1s )
2 eqidd 2765 . . . . . 6 (𝑥 = 𝐴 → ·s = ·s )
3 sneq 4594 . . . . . . 7 (𝑥 = 𝐴 → {𝑥} = {𝐴})
43xpeq2d 5679 . . . . . 6 (𝑥 = 𝐴 → (ℕs × {𝑥}) = (ℕs × {𝐴}))
51, 2, 4seqseq123d 28381 . . . . 5 (𝑥 = 𝐴 → seqs 1s ( ·s , (ℕs × {𝑥})) = seqs 1s ( ·s , (ℕs × {𝐴})))
65fveq1d 6871 . . . 4 (𝑥 = 𝐴 → (seqs 1s ( ·s , (ℕs × {𝑥}))‘𝑦) = (seqs 1s ( ·s , (ℕs × {𝐴}))‘𝑦))
75fveq1d 6871 . . . . 5 (𝑥 = 𝐴 → (seqs 1s ( ·s , (ℕs × {𝑥}))‘( -us𝑦)) = (seqs 1s ( ·s , (ℕs × {𝐴}))‘( -us𝑦)))
87oveq2d 7414 . . . 4 (𝑥 = 𝐴 → ( 1s /su (seqs 1s ( ·s , (ℕs × {𝑥}))‘( -us𝑦))) = ( 1s /su (seqs 1s ( ·s , (ℕs × {𝐴}))‘( -us𝑦))))
96, 8ifeq12d 4504 . . 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 4503 . 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 2768 . . 3 (𝑦 = 𝐵 → (𝑦 = 0s𝐵 = 0s ))
12 breq2 5106 . . . 4 (𝑦 = 𝐵 → ( 0s <s 𝑦 ↔ 0s <s 𝐵))
13 fveq2 6869 . . . 4 (𝑦 = 𝐵 → (seqs 1s ( ·s , (ℕs × {𝐴}))‘𝑦) = (seqs 1s ( ·s , (ℕs × {𝐴}))‘𝐵))
14 2fveq3 6874 . . . . 5 (𝑦 = 𝐵 → (seqs 1s ( ·s , (ℕs × {𝐴}))‘( -us𝑦)) = (seqs 1s ( ·s , (ℕs × {𝐴}))‘( -us𝐵)))
1514oveq2d 7414 . . . 4 (𝑦 = 𝐵 → ( 1s /su (seqs 1s ( ·s , (ℕs × {𝐴}))‘( -us𝑦))) = ( 1s /su (seqs 1s ( ·s , (ℕs × {𝐴}))‘( -us𝐵))))
1612, 13, 15ifbieq12d 4511 . . 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 4509 . 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 28508 . 2 s = (𝑥 No , 𝑦 ∈ ℤs ↦ if(𝑦 = 0s , 1s , if( 0s <s 𝑦, (seqs 1s ( ·s , (ℕs × {𝑥}))‘𝑦), ( 1s /su (seqs 1s ( ·s , (ℕs × {𝑥}))‘( -us𝑦))))))
19 1no 27905 . . . 4 1s No
2019elexi 3478 . . 3 1s ∈ V
21 fvex 6882 . . . 4 (seqs 1s ( ·s , (ℕs × {𝐴}))‘𝐵) ∈ V
22 ovex 7431 . . . 4 ( 1s /su (seqs 1s ( ·s , (ℕs × {𝐴}))‘( -us𝐵))) ∈ V
2321, 22ifex 4533 . . 3 if( 0s <s 𝐵, (seqs 1s ( ·s , (ℕs × {𝐴}))‘𝐵), ( 1s /su (seqs 1s ( ·s , (ℕs × {𝐴}))‘( -us𝐵)))) ∈ V
2420, 23ifex 4533 . 2 if(𝐵 = 0s , 1s , if( 0s <s 𝐵, (seqs 1s ( ·s , (ℕs × {𝐴}))‘𝐵), ( 1s /su (seqs 1s ( ·s , (ℕs × {𝐴}))‘( -us𝐵))))) ∈ V
2510, 17, 18, 24ovmpo 7558 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 399   = wceq 1562  wcel 2144  ifcif 4482  {csn 4584   class class class wbr 5102   × cxp 5647  cfv 6523  (class class class)co 7398   No csur 27706   <s clts 27707   0s c0s 27900   1s c1s 27901   -us cnegs 28114   ·s cmuls 28201   /su cdivs 28282  seqscseqs 28378  scnns 28408  sczs 28473  scexps 28507
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1817  ax-4 1831  ax-5 1932  ax-6 1989  ax-7 2030  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2214  ax-ext 2736  ax-rep 5229  ax-sep 5248  ax-nul 5258  ax-pow 5324  ax-pr 5392  ax-un 7720
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3or 1100  df-3an 1101  df-tru 1565  df-fal 1575  df-ex 1802  df-nf 1806  df-sb 2093  df-mo 2568  df-eu 2598  df-clab 2743  df-cleq 2756  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3079  df-rex 3089  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3458  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-pss 3926  df-nul 4288  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-tp 4589  df-op 4591  df-uni 4868  df-int 4908  df-br 5103  df-opab 5165  df-mpt 5184  df-tr 5210  df-id 5544  df-eprel 5549  df-po 5557  df-so 5558  df-fr 5602  df-we 5604  df-xp 5655  df-rel 5656  df-cnv 5657  df-co 5658  df-dm 5659  df-rn 5660  df-res 5661  df-ima 5662  df-pred 6290  df-ord 6351  df-on 6352  df-suc 6354  df-iota 6479  df-fun 6525  df-fn 6526  df-f 6527  df-f1 6528  df-fo 6529  df-f1o 6530  df-fv 6531  df-riota 7355  df-ov 7401  df-oprab 7402  df-mpo 7403  df-frecs 8264  df-wrecs 8295  df-recs 8344  df-rdg 8383  df-1o 8439  df-2o 8440  df-no 27709  df-lts 27710  df-bday 27711  df-slts 27853  df-cuts 27855  df-0s 27902  df-1s 27903  df-seqs 28379  df-exps 28508
This theorem is referenced by:  expnnsval  28521  exps0  28522
  Copyright terms: Public domain W3C validator