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

Theorem expsp1 28695
Description: Value of a surreal number raised to a non-negative integer power plus one. (Contributed by Scott Fenton, 6-Aug-2025.)
Assertion
Ref Expression
expsp1 ((𝐴 No 𝑁 ∈ ℕ0s) → (𝐴s(𝑁 +s 1s )) = ((𝐴s𝑁) ·s 𝐴))

Proof of Theorem expsp1
StepHypRef Expression
1 eln0s 28627 . 2 (𝑁 ∈ ℕ0s ↔ (𝑁 ∈ ℕs𝑁 = 0s ))
2 1no 28076 . . . . . . 7 1s No
32a1i 11 . . . . . 6 ((𝐴 No 𝑁 ∈ ℕs) → 1s No )
4 dfnns2 28638 . . . . . . 7 s = (rec((𝑥 ∈ V ↦ (𝑥 +s 1s )), 1s ) “ ω)
54a1i 11 . . . . . 6 ((𝐴 No 𝑁 ∈ ℕs) → ℕs = (rec((𝑥 ∈ V ↦ (𝑥 +s 1s )), 1s ) “ ω))
6 simpr 490 . . . . . 6 ((𝐴 No 𝑁 ∈ ℕs) → 𝑁 ∈ ℕs)
73, 5, 6seqsp1 28577 . . . . 5 ((𝐴 No 𝑁 ∈ ℕs) → (seqs 1s ( ·s , (ℕs × {𝐴}))‘(𝑁 +s 1s )) = ((seqs 1s ( ·s , (ℕs × {𝐴}))‘𝑁) ·s ((ℕs × {𝐴})‘(𝑁 +s 1s ))))
8 peano2nns 28616 . . . . . . 7 (𝑁 ∈ ℕs → (𝑁 +s 1s ) ∈ ℕs)
9 fvconst2g 7204 . . . . . . 7 ((𝐴 No ∧ (𝑁 +s 1s ) ∈ ℕs) → ((ℕs × {𝐴})‘(𝑁 +s 1s )) = 𝐴)
108, 9sylan2 605 . . . . . 6 ((𝐴 No 𝑁 ∈ ℕs) → ((ℕs × {𝐴})‘(𝑁 +s 1s )) = 𝐴)
1110oveq2d 7432 . . . . 5 ((𝐴 No 𝑁 ∈ ℕs) → ((seqs 1s ( ·s , (ℕs × {𝐴}))‘𝑁) ·s ((ℕs × {𝐴})‘(𝑁 +s 1s ))) = ((seqs 1s ( ·s , (ℕs × {𝐴}))‘𝑁) ·s 𝐴))
127, 11eqtrd 2797 . . . 4 ((𝐴 No 𝑁 ∈ ℕs) → (seqs 1s ( ·s , (ℕs × {𝐴}))‘(𝑁 +s 1s )) = ((seqs 1s ( ·s , (ℕs × {𝐴}))‘𝑁) ·s 𝐴))
13 expnnsval 28692 . . . . 5 ((𝐴 No ∧ (𝑁 +s 1s ) ∈ ℕs) → (𝐴s(𝑁 +s 1s )) = (seqs 1s ( ·s , (ℕs × {𝐴}))‘(𝑁 +s 1s )))
148, 13sylan2 605 . . . 4 ((𝐴 No 𝑁 ∈ ℕs) → (𝐴s(𝑁 +s 1s )) = (seqs 1s ( ·s , (ℕs × {𝐴}))‘(𝑁 +s 1s )))
15 expnnsval 28692 . . . . 5 ((𝐴 No 𝑁 ∈ ℕs) → (𝐴s𝑁) = (seqs 1s ( ·s , (ℕs × {𝐴}))‘𝑁))
1615oveq1d 7431 . . . 4 ((𝐴 No 𝑁 ∈ ℕs) → ((𝐴s𝑁) ·s 𝐴) = ((seqs 1s ( ·s , (ℕs × {𝐴}))‘𝑁) ·s 𝐴))
1712, 14, 163eqtr4d 2807 . . 3 ((𝐴 No 𝑁 ∈ ℕs) → (𝐴s(𝑁 +s 1s )) = ((𝐴s𝑁) ·s 𝐴))
18 mulslid 28408 . . . . 5 (𝐴 No → ( 1s ·s 𝐴) = 𝐴)
1918adantr 486 . . . 4 ((𝐴 No 𝑁 = 0s ) → ( 1s ·s 𝐴) = 𝐴)
20 oveq2 7424 . . . . . 6 (𝑁 = 0s → (𝐴s𝑁) = (𝐴s 0s ))
21 exps0 28693 . . . . . 6 (𝐴 No → (𝐴s 0s ) = 1s )
2220, 21sylan9eqr 2819 . . . . 5 ((𝐴 No 𝑁 = 0s ) → (𝐴s𝑁) = 1s )
2322oveq1d 7431 . . . 4 ((𝐴 No 𝑁 = 0s ) → ((𝐴s𝑁) ·s 𝐴) = ( 1s ·s 𝐴))
24 oveq1 7423 . . . . . . 7 (𝑁 = 0s → (𝑁 +s 1s ) = ( 0s +s 1s ))
25 addslid 28234 . . . . . . . 8 ( 1s No → ( 0s +s 1s ) = 1s )
262, 25ax-mp 5 . . . . . . 7 ( 0s +s 1s ) = 1s
2724, 26eqtrdi 2813 . . . . . 6 (𝑁 = 0s → (𝑁 +s 1s ) = 1s )
2827oveq2d 7432 . . . . 5 (𝑁 = 0s → (𝐴s(𝑁 +s 1s )) = (𝐴s 1s ))
29 exps1 28694 . . . . 5 (𝐴 No → (𝐴s 1s ) = 𝐴)
3028, 29sylan9eqr 2819 . . . 4 ((𝐴 No 𝑁 = 0s ) → (𝐴s(𝑁 +s 1s )) = 𝐴)
3119, 23, 303eqtr4rd 2808 . . 3 ((𝐴 No 𝑁 = 0s ) → (𝐴s(𝑁 +s 1s )) = ((𝐴s𝑁) ·s 𝐴))
3217, 31jaodan 972 . 2 ((𝐴 No ∧ (𝑁 ∈ ℕs𝑁 = 0s )) → (𝐴s(𝑁 +s 1s )) = ((𝐴s𝑁) ·s 𝐴))
331, 32sylan2b 606 1 ((𝐴 No 𝑁 ∈ ℕ0s) → (𝐴s(𝑁 +s 1s )) = ((𝐴s𝑁) ·s 𝐴))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 401  wo 861   = wceq 1570  wcel 2145  Vcvv 3453  {csn 4587  cmpt 5190   × cxp 5657  cima 5662  cfv 6537  (class class class)co 7416  ωcom 7865  reccrdg 8401   No csur 27877   0s c0s 28071   1s c1s 28072   +s cadds 28225   ·s cmuls 28372  seqscseqs 28549  0scn0s 28578  scnns 28579  scexps 28678
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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-rep 5236  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7739
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 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rmo 3367  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-tp 4592  df-op 4594  df-ot 4596  df-uni 4871  df-int 4911  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-tr 5217  df-id 5554  df-eprel 5559  df-po 5567  df-so 5568  df-fr 5612  df-se 5613  df-we 5614  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 6303  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-riota 7373  df-ov 7419  df-oprab 7420  df-mpo 7421  df-om 7866  df-1st 7989  df-2nd 7990  df-frecs 8283  df-wrecs 8314  df-recs 8363  df-rdg 8402  df-1o 8458  df-2o 8459  df-oadd 8462  df-nadd 8657  df-no 27880  df-lts 27881  df-bday 27882  df-les 27982  df-slts 28024  df-cuts 28026  df-0s 28073  df-1s 28074  df-made 28093  df-old 28094  df-left 28096  df-right 28097  df-norec 28204  df-norec2 28215  df-adds 28226  df-negs 28287  df-subs 28288  df-muls 28373  df-seqs 28550  df-n0s 28580  df-nns 28581  df-zs 28645  df-exps 28679
This theorem is used by:  expscllem  28696  expadds  28701  expsne0  28702  expsgt0  28703  pw2recs  28704  pw2cut  28726  bdaypw2n0bndlem  28729  bdayfinbndlem1  28733  z12zsodd  28748
  Copyright terms: Public domain W3C validator