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

Theorem expsp1 28816
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 28748 . 2 (𝑁 ∈ ℕ0s ↔ (𝑁 ∈ ℕs ∨ 𝑁 = 0s ))
2 1no 28197 . . . . . . 7 1s ∈ No
32a1i 11 . . . . . 6 ((𝐴 ∈ No ∧ 𝑁 ∈ ℕs) → 1s ∈ No)
4 dfnns2 28759 . . . . . . 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 28698 . . . . 5 ((𝐴 ∈ No ∧ 𝑁 ∈ ℕs) → (seqs 1s ( ·s , (ℕs × {𝐴}))‘(𝑁 +s 1s )) = ((seqs 1s ( ·s , (ℕs × {𝐴}))‘𝑁) ·s ((ℕs × {𝐴})‘(𝑁 +s 1s ))))
8 peano2nns 28737 . . . . . . 7 (𝑁 ∈ ℕs → (𝑁 +s 1s ) ∈ ℕs)
9 fvconst2g 7208 . . . . . . 7 ((𝐴 ∈ No ∧ (𝑁 +s 1s ) ∈ ℕs) → ((ℕs × {𝐴})‘(𝑁 +s 1s )) = 𝐴)
108, 9sylan2 605 . . . . . 6 ((𝐴 ∈ No ∧ 𝑁 ∈ ℕs) → ((ℕs × {𝐴})‘(𝑁 +s 1s )) = 𝐴)
1110oveq2d 7436 . . . . 5 ((𝐴 ∈ No ∧ 𝑁 ∈ ℕs) → ((seqs 1s ( ·s , (ℕs × {𝐴}))‘𝑁) ·s ((ℕs × {𝐴})‘(𝑁 +s 1s ))) = ((seqs 1s ( ·s , (ℕs × {𝐴}))‘𝑁) ·s 𝐴))
127, 11eqtrd 2795 . . . 4 ((𝐴 ∈ No ∧ 𝑁 ∈ ℕs) → (seqs 1s ( ·s , (ℕs × {𝐴}))‘(𝑁 +s 1s )) = ((seqs 1s ( ·s , (ℕs × {𝐴}))‘𝑁) ·s 𝐴))
13 expnnsval 28813 . . . . 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 28813 . . . . 5 ((𝐴 ∈ No ∧ 𝑁 ∈ ℕs) → (𝐴↑s𝑁) = (seqs 1s ( ·s , (ℕs × {𝐴}))‘𝑁))
1615oveq1d 7435 . . . 4 ((𝐴 ∈ No ∧ 𝑁 ∈ ℕs) → ((𝐴↑s𝑁) ·s 𝐴) = ((seqs 1s ( ·s , (ℕs × {𝐴}))‘𝑁) ·s 𝐴))
1712, 14, 163eqtr4d 2805 . . 3 ((𝐴 ∈ No ∧ 𝑁 ∈ ℕs) → (𝐴↑s(𝑁 +s 1s )) = ((𝐴↑s𝑁) ·s 𝐴))
18 mulslid 28529 . . . . 5 (𝐴 ∈ No → ( 1s ·s 𝐴) = 𝐴)
1918adantr 486 . . . 4 ((𝐴 ∈ No ∧ 𝑁 = 0s ) → ( 1s ·s 𝐴) = 𝐴)
20 oveq2 7428 . . . . . 6 (𝑁 = 0s → (𝐴↑s𝑁) = (𝐴↑s 0s ))
21 exps0 28814 . . . . . 6 (𝐴 ∈ No → (𝐴↑s 0s ) = 1s )
2220, 21sylan9eqr 2817 . . . . 5 ((𝐴 ∈ No ∧ 𝑁 = 0s ) → (𝐴↑s𝑁) = 1s )
2322oveq1d 7435 . . . 4 ((𝐴 ∈ No ∧ 𝑁 = 0s ) → ((𝐴↑s𝑁) ·s 𝐴) = ( 1s ·s 𝐴))
24 oveq1 7427 . . . . . . 7 (𝑁 = 0s → (𝑁 +s 1s ) = ( 0s +s 1s ))
25 addslid 28355 . . . . . . . 8 ( 1s ∈ No → ( 0s +s 1s ) = 1s )
262, 25ax-mp 5 . . . . . . 7 ( 0s +s 1s ) = 1s
2724, 26eqtrdi 2811 . . . . . 6 (𝑁 = 0s → (𝑁 +s 1s ) = 1s )
2827oveq2d 7436 . . . . 5 (𝑁 = 0s → (𝐴↑s(𝑁 +s 1s )) = (𝐴↑s 1s ))
29 exps1 28815 . . . . 5 (𝐴 ∈ No → (𝐴↑s 1s ) = 𝐴)
3028, 29sylan9eqr 2817 . . . 4 ((𝐴 ∈ No ∧ 𝑁 = 0s ) → (𝐴↑s(𝑁 +s 1s )) = 𝐴)
3119, 23, 303eqtr4rd 2806 . . 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 1569   ∈ wcel 2144  Vcvv 3450  {csn 4583   ↦ cmpt 5185   × cxp 5648   “ cima 5653  ‘cfv 6538  (class class class)co 7420  ωcom 7877  reccrdg 8418  Nocsur 27998   0s c0s 28192   1s c1s 28193   +s cadds 28346   ·s cmuls 28493  seqscseqs 28670  ℕ0scn0s 28699  ℕscnns 28700  ↑scexps 28799
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7751
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-pss 4014  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-tp 4588  df-op 4590  df-ot 4592  df-uni 4867  df-int 4907  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5545  df-eprel 5550  df-po 5558  df-so 5559  df-fr 5603  df-se 5604  df-we 5605  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-pred 6304  df-ord 6365  df-on 6366  df-lim 6367  df-suc 6368  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-riota 7377  df-ov 7423  df-oprab 7424  df-mpo 7425  df-om 7878  df-1st 8001  df-2nd 8002  df-frecs 8300  df-wrecs 8331  df-recs 8380  df-rdg 8419  df-1o 8477  df-2o 8478  df-oadd 8481  df-nadd 8676  df-no 28001  df-lts 28002  df-bday 28003  df-les 28103  df-slts 28145  df-cuts 28147  df-0s 28194  df-1s 28195  df-made 28214  df-old 28215  df-left 28217  df-right 28218  df-norec 28325  df-norec2 28336  df-adds 28347  df-negs 28408  df-subs 28409  df-muls 28494  df-seqs 28671  df-n0s 28701  df-nns 28702  df-zs 28766  df-exps 28800
This theorem is used by:  expscllem  28817  expadds  28822  expsne0  28823  expsgt0  28824  pw2recs  28825  pw2cut  28847  bdaypw2n0bndlem  28850  bdayfinbndlem1  28854  z12zsodd  28869
  Copyright terms: Public domain W3C validator