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

Theorem expsval 28368
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 2737 . . . . . 6 (𝑥 = 𝐴 → 1s = 1s )
2 eqidd 2737 . . . . . 6 (𝑥 = 𝐴 → ·s = ·s )
3 sneq 4616 . . . . . . 7 (𝑥 = 𝐴 → {𝑥} = {𝐴})
43xpeq2d 5689 . . . . . 6 (𝑥 = 𝐴 → (ℕs × {𝑥}) = (ℕs × {𝐴}))
51, 2, 4seqseq123d 28237 . . . . 5 (𝑥 = 𝐴 → seqs 1s ( ·s , (ℕs × {𝑥})) = seqs 1s ( ·s , (ℕs × {𝐴})))
65fveq1d 6883 . . . 4 (𝑥 = 𝐴 → (seqs 1s ( ·s , (ℕs × {𝑥}))‘𝑦) = (seqs 1s ( ·s , (ℕs × {𝐴}))‘𝑦))
75fveq1d 6883 . . . . 5 (𝑥 = 𝐴 → (seqs 1s ( ·s , (ℕs × {𝑥}))‘( -us𝑦)) = (seqs 1s ( ·s , (ℕs × {𝐴}))‘( -us𝑦)))
87oveq2d 7426 . . . 4 (𝑥 = 𝐴 → ( 1s /su (seqs 1s ( ·s , (ℕs × {𝑥}))‘( -us𝑦))) = ( 1s /su (seqs 1s ( ·s , (ℕs × {𝐴}))‘( -us𝑦))))
96, 8ifeq12d 4527 . . 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 4526 . 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 2740 . . 3 (𝑦 = 𝐵 → (𝑦 = 0s𝐵 = 0s ))
12 breq2 5128 . . . 4 (𝑦 = 𝐵 → ( 0s <s 𝑦 ↔ 0s <s 𝐵))
13 fveq2 6881 . . . 4 (𝑦 = 𝐵 → (seqs 1s ( ·s , (ℕs × {𝐴}))‘𝑦) = (seqs 1s ( ·s , (ℕs × {𝐴}))‘𝐵))
14 2fveq3 6886 . . . . 5 (𝑦 = 𝐵 → (seqs 1s ( ·s , (ℕs × {𝐴}))‘( -us𝑦)) = (seqs 1s ( ·s , (ℕs × {𝐴}))‘( -us𝐵)))
1514oveq2d 7426 . . . 4 (𝑦 = 𝐵 → ( 1s /su (seqs 1s ( ·s , (ℕs × {𝐴}))‘( -us𝑦))) = ( 1s /su (seqs 1s ( ·s , (ℕs × {𝐴}))‘( -us𝐵))))
1612, 13, 15ifbieq12d 4534 . . 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 4532 . 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 28356 . 2 s = (𝑥 No , 𝑦 ∈ ℤs ↦ if(𝑦 = 0s , 1s , if( 0s <s 𝑦, (seqs 1s ( ·s , (ℕs × {𝑥}))‘𝑦), ( 1s /su (seqs 1s ( ·s , (ℕs × {𝑥}))‘( -us𝑦))))))
19 1sno 27796 . . . 4 1s No
2019elexi 3487 . . 3 1s ∈ V
21 fvex 6894 . . . 4 (seqs 1s ( ·s , (ℕs × {𝐴}))‘𝐵) ∈ V
22 ovex 7443 . . . 4 ( 1s /su (seqs 1s ( ·s , (ℕs × {𝐴}))‘( -us𝐵))) ∈ V
2321, 22ifex 4556 . . 3 if( 0s <s 𝐵, (seqs 1s ( ·s , (ℕs × {𝐴}))‘𝐵), ( 1s /su (seqs 1s ( ·s , (ℕs × {𝐴}))‘( -us𝐵)))) ∈ V
2420, 23ifex 4556 . 2 if(𝐵 = 0s , 1s , if( 0s <s 𝐵, (seqs 1s ( ·s , (ℕs × {𝐴}))‘𝐵), ( 1s /su (seqs 1s ( ·s , (ℕs × {𝐴}))‘( -us𝐵))))) ∈ V
2510, 17, 18, 24ovmpo 7572 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 395   = wceq 1540  wcel 2109  ifcif 4505  {csn 4606   class class class wbr 5124   × cxp 5657  cfv 6536  (class class class)co 7410   No csur 27608   <s cslt 27609   0s c0s 27791   1s c1s 27792   -us cnegs 27982   ·s cmuls 28066   /su cdivs 28147  seqscseqs 28234  scnns 28264  sczs 28323  scexps 28355
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2708  ax-rep 5254  ax-sep 5271  ax-nul 5281  ax-pow 5340  ax-pr 5407  ax-un 7734
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2540  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2810  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3062  df-rmo 3364  df-reu 3365  df-rab 3421  df-v 3466  df-sbc 3771  df-csb 3880  df-dif 3934  df-un 3936  df-in 3938  df-ss 3948  df-pss 3951  df-nul 4314  df-if 4506  df-pw 4582  df-sn 4607  df-pr 4609  df-tp 4611  df-op 4613  df-uni 4889  df-int 4928  df-br 5125  df-opab 5187  df-mpt 5207  df-tr 5235  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-we 5613  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-pred 6295  df-ord 6360  df-on 6361  df-suc 6363  df-iota 6489  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-riota 7367  df-ov 7413  df-oprab 7414  df-mpo 7415  df-frecs 8285  df-wrecs 8316  df-recs 8390  df-rdg 8429  df-1o 8485  df-2o 8486  df-no 27611  df-slt 27612  df-bday 27613  df-sslt 27750  df-scut 27752  df-0s 27793  df-1s 27794  df-seqs 28235  df-exps 28356
This theorem is referenced by:  expsnnval  28369  exps0  28370
  Copyright terms: Public domain W3C validator