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

Theorem expsne0 28499
Description: A non-negative surreal integer power is nonzero if its base is nonzero. (Contributed by Scott Fenton, 7-Aug-2025.)
Assertion
Ref Expression
expsne0 ((𝐴 No 𝐴 ≠ 0s𝑁 ∈ ℕ0s) → (𝐴s𝑁) ≠ 0s )

Proof of Theorem expsne0
Dummy variables 𝑛 𝑚 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 oveq2 7393 . . . . . . . . 9 (𝑚 = 0s → (𝐴s𝑚) = (𝐴s 0s ))
21eqeq1d 2758 . . . . . . . 8 (𝑚 = 0s → ((𝐴s𝑚) = 0s ↔ (𝐴s 0s ) = 0s ))
32imbi1d 343 . . . . . . 7 (𝑚 = 0s → (((𝐴s𝑚) = 0s𝐴 = 0s ) ↔ ((𝐴s 0s ) = 0s𝐴 = 0s )))
43imbi2d 342 . . . . . 6 (𝑚 = 0s → ((𝐴 No → ((𝐴s𝑚) = 0s𝐴 = 0s )) ↔ (𝐴 No → ((𝐴s 0s ) = 0s𝐴 = 0s ))))
5 oveq2 7393 . . . . . . . . 9 (𝑚 = 𝑛 → (𝐴s𝑚) = (𝐴s𝑛))
65eqeq1d 2758 . . . . . . . 8 (𝑚 = 𝑛 → ((𝐴s𝑚) = 0s ↔ (𝐴s𝑛) = 0s ))
76imbi1d 343 . . . . . . 7 (𝑚 = 𝑛 → (((𝐴s𝑚) = 0s𝐴 = 0s ) ↔ ((𝐴s𝑛) = 0s𝐴 = 0s )))
87imbi2d 342 . . . . . 6 (𝑚 = 𝑛 → ((𝐴 No → ((𝐴s𝑚) = 0s𝐴 = 0s )) ↔ (𝐴 No → ((𝐴s𝑛) = 0s𝐴 = 0s ))))
9 oveq2 7393 . . . . . . . . 9 (𝑚 = (𝑛 +s 1s ) → (𝐴s𝑚) = (𝐴s(𝑛 +s 1s )))
109eqeq1d 2758 . . . . . . . 8 (𝑚 = (𝑛 +s 1s ) → ((𝐴s𝑚) = 0s ↔ (𝐴s(𝑛 +s 1s )) = 0s ))
1110imbi1d 343 . . . . . . 7 (𝑚 = (𝑛 +s 1s ) → (((𝐴s𝑚) = 0s𝐴 = 0s ) ↔ ((𝐴s(𝑛 +s 1s )) = 0s𝐴 = 0s )))
1211imbi2d 342 . . . . . 6 (𝑚 = (𝑛 +s 1s ) → ((𝐴 No → ((𝐴s𝑚) = 0s𝐴 = 0s )) ↔ (𝐴 No → ((𝐴s(𝑛 +s 1s )) = 0s𝐴 = 0s ))))
13 oveq2 7393 . . . . . . . . 9 (𝑚 = 𝑁 → (𝐴s𝑚) = (𝐴s𝑁))
1413eqeq1d 2758 . . . . . . . 8 (𝑚 = 𝑁 → ((𝐴s𝑚) = 0s ↔ (𝐴s𝑁) = 0s ))
1514imbi1d 343 . . . . . . 7 (𝑚 = 𝑁 → (((𝐴s𝑚) = 0s𝐴 = 0s ) ↔ ((𝐴s𝑁) = 0s𝐴 = 0s )))
1615imbi2d 342 . . . . . 6 (𝑚 = 𝑁 → ((𝐴 No → ((𝐴s𝑚) = 0s𝐴 = 0s )) ↔ (𝐴 No → ((𝐴s𝑁) = 0s𝐴 = 0s ))))
17 1ne0s 27883 . . . . . . . . 9 1s ≠ 0s
18 exps0 28490 . . . . . . . . . 10 (𝐴 No → (𝐴s 0s ) = 1s )
1918neeq1d 3010 . . . . . . . . 9 (𝐴 No → ((𝐴s 0s ) ≠ 0s ↔ 1s ≠ 0s ))
2017, 19mpbiri 260 . . . . . . . 8 (𝐴 No → (𝐴s 0s ) ≠ 0s )
2120neneqd 2956 . . . . . . 7 (𝐴 No → ¬ (𝐴s 0s ) = 0s )
2221pm2.21d 121 . . . . . 6 (𝐴 No → ((𝐴s 0s ) = 0s𝐴 = 0s ))
23 expsp1 28492 . . . . . . . . . . . . 13 ((𝐴 No 𝑛 ∈ ℕ0s) → (𝐴s(𝑛 +s 1s )) = ((𝐴s𝑛) ·s 𝐴))
2423eqeq1d 2758 . . . . . . . . . . . 12 ((𝐴 No 𝑛 ∈ ℕ0s) → ((𝐴s(𝑛 +s 1s )) = 0s ↔ ((𝐴s𝑛) ·s 𝐴) = 0s ))
25 expscl 28494 . . . . . . . . . . . . 13 ((𝐴 No 𝑛 ∈ ℕ0s) → (𝐴s𝑛) ∈ No )
26 simpl 485 . . . . . . . . . . . . 13 ((𝐴 No 𝑛 ∈ ℕ0s) → 𝐴 No )
2725, 26muls0ord 28248 . . . . . . . . . . . 12 ((𝐴 No 𝑛 ∈ ℕ0s) → (((𝐴s𝑛) ·s 𝐴) = 0s ↔ ((𝐴s𝑛) = 0s𝐴 = 0s )))
2824, 27bitrd 281 . . . . . . . . . . 11 ((𝐴 No 𝑛 ∈ ℕ0s) → ((𝐴s(𝑛 +s 1s )) = 0s ↔ ((𝐴s𝑛) = 0s𝐴 = 0s )))
2928adantr 483 . . . . . . . . . 10 (((𝐴 No 𝑛 ∈ ℕ0s) ∧ ((𝐴s𝑛) = 0s𝐴 = 0s )) → ((𝐴s(𝑛 +s 1s )) = 0s ↔ ((𝐴s𝑛) = 0s𝐴 = 0s )))
30 simpr 487 . . . . . . . . . . 11 (((𝐴 No 𝑛 ∈ ℕ0s) ∧ ((𝐴s𝑛) = 0s𝐴 = 0s )) → ((𝐴s𝑛) = 0s𝐴 = 0s ))
31 idd 24 . . . . . . . . . . 11 (((𝐴 No 𝑛 ∈ ℕ0s) ∧ ((𝐴s𝑛) = 0s𝐴 = 0s )) → (𝐴 = 0s𝐴 = 0s ))
3230, 31jaod 868 . . . . . . . . . 10 (((𝐴 No 𝑛 ∈ ℕ0s) ∧ ((𝐴s𝑛) = 0s𝐴 = 0s )) → (((𝐴s𝑛) = 0s𝐴 = 0s ) → 𝐴 = 0s ))
3329, 32sylbid 242 . . . . . . . . 9 (((𝐴 No 𝑛 ∈ ℕ0s) ∧ ((𝐴s𝑛) = 0s𝐴 = 0s )) → ((𝐴s(𝑛 +s 1s )) = 0s𝐴 = 0s ))
3433ex 415 . . . . . . . 8 ((𝐴 No 𝑛 ∈ ℕ0s) → (((𝐴s𝑛) = 0s𝐴 = 0s ) → ((𝐴s(𝑛 +s 1s )) = 0s𝐴 = 0s )))
3534expcom 416 . . . . . . 7 (𝑛 ∈ ℕ0s → (𝐴 No → (((𝐴s𝑛) = 0s𝐴 = 0s ) → ((𝐴s(𝑛 +s 1s )) = 0s𝐴 = 0s ))))
3635a2d 29 . . . . . 6 (𝑛 ∈ ℕ0s → ((𝐴 No → ((𝐴s𝑛) = 0s𝐴 = 0s )) → (𝐴 No → ((𝐴s(𝑛 +s 1s )) = 0s𝐴 = 0s ))))
374, 8, 12, 16, 22, 36n0sind 28396 . . . . 5 (𝑁 ∈ ℕ0s → (𝐴 No → ((𝐴s𝑁) = 0s𝐴 = 0s )))
3837imp 409 . . . 4 ((𝑁 ∈ ℕ0s𝐴 No ) → ((𝐴s𝑁) = 0s𝐴 = 0s ))
3938necon3d 2972 . . 3 ((𝑁 ∈ ℕ0s𝐴 No ) → (𝐴 ≠ 0s → (𝐴s𝑁) ≠ 0s ))
4039ex 415 . 2 (𝑁 ∈ ℕ0s → (𝐴 No → (𝐴 ≠ 0s → (𝐴s𝑁) ≠ 0s )))
41403imp231 1121 1 ((𝐴 No 𝐴 ≠ 0s𝑁 ∈ ℕ0s) → (𝐴s𝑁) ≠ 0s )
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 398  wo 856  w3a 1095   = wceq 1554  wcel 2136  wne 2951  (class class class)co 7385   No csur 27674   0s c0s 27868   1s c1s 27869   +s cadds 28022   ·s cmuls 28169  0scn0s 28375  scexps 28475
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1809  ax-4 1823  ax-5 1924  ax-6 1981  ax-7 2022  ax-8 2138  ax-9 2146  ax-10 2169  ax-11 2185  ax-12 2206  ax-ext 2728  ax-rep 5221  ax-sep 5240  ax-nul 5250  ax-pow 5316  ax-pr 5384  ax-un 7707
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 857  df-3or 1096  df-3an 1097  df-tru 1557  df-fal 1567  df-ex 1794  df-nf 1798  df-sb 2085  df-mo 2560  df-eu 2590  df-clab 2735  df-cleq 2748  df-clel 2831  df-nfc 2905  df-ne 2952  df-ral 3071  df-rex 3081  df-rmo 3361  df-reu 3362  df-rab 3409  df-v 3450  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4281  df-if 4475  df-pw 4551  df-sn 4577  df-pr 4579  df-tp 4581  df-op 4583  df-ot 4585  df-uni 4860  df-int 4900  df-iun 4945  df-br 5095  df-opab 5157  df-mpt 5176  df-tr 5202  df-id 5535  df-eprel 5540  df-po 5548  df-so 5549  df-fr 5593  df-se 5594  df-we 5595  df-xp 5646  df-rel 5647  df-cnv 5648  df-co 5649  df-dm 5650  df-rn 5651  df-res 5652  df-ima 5653  df-pred 6277  df-ord 6338  df-on 6339  df-lim 6340  df-suc 6341  df-iota 6466  df-fun 6512  df-fn 6513  df-f 6514  df-f1 6515  df-fo 6516  df-f1o 6517  df-fv 6518  df-riota 7342  df-ov 7388  df-oprab 7389  df-mpo 7390  df-om 7836  df-1st 7959  df-2nd 7960  df-frecs 8250  df-wrecs 8281  df-recs 8330  df-rdg 8369  df-1o 8425  df-2o 8426  df-oadd 8429  df-nadd 8624  df-no 27677  df-lts 27678  df-bday 27679  df-les 27779  df-slts 27821  df-cuts 27823  df-0s 27870  df-1s 27871  df-made 27890  df-old 27891  df-left 27893  df-right 27894  df-norec 28001  df-norec2 28012  df-adds 28023  df-negs 28084  df-subs 28085  df-muls 28170  df-seqs 28347  df-n0s 28377  df-nns 28378  df-zs 28442  df-exps 28476
This theorem is referenced by:  pw2divscld  28502  pw2divmulsd  28503  pw2divscan2d  28505  pw2divsassd  28506  pw2divsrecd  28510  pw2cut  28523  z12zsodd  28545
  Copyright terms: Public domain W3C validator