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

Theorem expsne0 28413
Description: A non-negative surreal integer power is non-zero if its base is non-zero. (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 7366 . . . . . . . . 9 (𝑚 = 0s → (𝐴s𝑚) = (𝐴s 0s ))
21eqeq1d 2737 . . . . . . . 8 (𝑚 = 0s → ((𝐴s𝑚) = 0s ↔ (𝐴s 0s ) = 0s ))
32imbi1d 341 . . . . . . 7 (𝑚 = 0s → (((𝐴s𝑚) = 0s𝐴 = 0s ) ↔ ((𝐴s 0s ) = 0s𝐴 = 0s )))
43imbi2d 340 . . . . . 6 (𝑚 = 0s → ((𝐴 No → ((𝐴s𝑚) = 0s𝐴 = 0s )) ↔ (𝐴 No → ((𝐴s 0s ) = 0s𝐴 = 0s ))))
5 oveq2 7366 . . . . . . . . 9 (𝑚 = 𝑛 → (𝐴s𝑚) = (𝐴s𝑛))
65eqeq1d 2737 . . . . . . . 8 (𝑚 = 𝑛 → ((𝐴s𝑚) = 0s ↔ (𝐴s𝑛) = 0s ))
76imbi1d 341 . . . . . . 7 (𝑚 = 𝑛 → (((𝐴s𝑚) = 0s𝐴 = 0s ) ↔ ((𝐴s𝑛) = 0s𝐴 = 0s )))
87imbi2d 340 . . . . . 6 (𝑚 = 𝑛 → ((𝐴 No → ((𝐴s𝑚) = 0s𝐴 = 0s )) ↔ (𝐴 No → ((𝐴s𝑛) = 0s𝐴 = 0s ))))
9 oveq2 7366 . . . . . . . . 9 (𝑚 = (𝑛 +s 1s ) → (𝐴s𝑚) = (𝐴s(𝑛 +s 1s )))
109eqeq1d 2737 . . . . . . . 8 (𝑚 = (𝑛 +s 1s ) → ((𝐴s𝑚) = 0s ↔ (𝐴s(𝑛 +s 1s )) = 0s ))
1110imbi1d 341 . . . . . . 7 (𝑚 = (𝑛 +s 1s ) → (((𝐴s𝑚) = 0s𝐴 = 0s ) ↔ ((𝐴s(𝑛 +s 1s )) = 0s𝐴 = 0s )))
1211imbi2d 340 . . . . . 6 (𝑚 = (𝑛 +s 1s ) → ((𝐴 No → ((𝐴s𝑚) = 0s𝐴 = 0s )) ↔ (𝐴 No → ((𝐴s(𝑛 +s 1s )) = 0s𝐴 = 0s ))))
13 oveq2 7366 . . . . . . . . 9 (𝑚 = 𝑁 → (𝐴s𝑚) = (𝐴s𝑁))
1413eqeq1d 2737 . . . . . . . 8 (𝑚 = 𝑁 → ((𝐴s𝑚) = 0s ↔ (𝐴s𝑁) = 0s ))
1514imbi1d 341 . . . . . . 7 (𝑚 = 𝑁 → (((𝐴s𝑚) = 0s𝐴 = 0s ) ↔ ((𝐴s𝑁) = 0s𝐴 = 0s )))
1615imbi2d 340 . . . . . 6 (𝑚 = 𝑁 → ((𝐴 No → ((𝐴s𝑚) = 0s𝐴 = 0s )) ↔ (𝐴 No → ((𝐴s𝑁) = 0s𝐴 = 0s ))))
17 1sne0s 27816 . . . . . . . . 9 1s ≠ 0s
18 exps0 28404 . . . . . . . . . 10 (𝐴 No → (𝐴s 0s ) = 1s )
1918neeq1d 2990 . . . . . . . . 9 (𝐴 No → ((𝐴s 0s ) ≠ 0s ↔ 1s ≠ 0s ))
2017, 19mpbiri 258 . . . . . . . 8 (𝐴 No → (𝐴s 0s ) ≠ 0s )
2120neneqd 2936 . . . . . . 7 (𝐴 No → ¬ (𝐴s 0s ) = 0s )
2221pm2.21d 121 . . . . . 6 (𝐴 No → ((𝐴s 0s ) = 0s𝐴 = 0s ))
23 expsp1 28406 . . . . . . . . . . . . 13 ((𝐴 No 𝑛 ∈ ℕ0s) → (𝐴s(𝑛 +s 1s )) = ((𝐴s𝑛) ·s 𝐴))
2423eqeq1d 2737 . . . . . . . . . . . 12 ((𝐴 No 𝑛 ∈ ℕ0s) → ((𝐴s(𝑛 +s 1s )) = 0s ↔ ((𝐴s𝑛) ·s 𝐴) = 0s ))
25 expscl 28408 . . . . . . . . . . . . 13 ((𝐴 No 𝑛 ∈ ℕ0s) → (𝐴s𝑛) ∈ No )
26 simpl 482 . . . . . . . . . . . . 13 ((𝐴 No 𝑛 ∈ ℕ0s) → 𝐴 No )
2725, 26muls0ord 28165 . . . . . . . . . . . 12 ((𝐴 No 𝑛 ∈ ℕ0s) → (((𝐴s𝑛) ·s 𝐴) = 0s ↔ ((𝐴s𝑛) = 0s𝐴 = 0s )))
2824, 27bitrd 279 . . . . . . . . . . 11 ((𝐴 No 𝑛 ∈ ℕ0s) → ((𝐴s(𝑛 +s 1s )) = 0s ↔ ((𝐴s𝑛) = 0s𝐴 = 0s )))
2928adantr 480 . . . . . . . . . 10 (((𝐴 No 𝑛 ∈ ℕ0s) ∧ ((𝐴s𝑛) = 0s𝐴 = 0s )) → ((𝐴s(𝑛 +s 1s )) = 0s ↔ ((𝐴s𝑛) = 0s𝐴 = 0s )))
30 simpr 484 . . . . . . . . . . 11 (((𝐴 No 𝑛 ∈ ℕ0s) ∧ ((𝐴s𝑛) = 0s𝐴 = 0s )) → ((𝐴s𝑛) = 0s𝐴 = 0s ))
31 idd 24 . . . . . . . . . . 11 (((𝐴 No 𝑛 ∈ ℕ0s) ∧ ((𝐴s𝑛) = 0s𝐴 = 0s )) → (𝐴 = 0s𝐴 = 0s ))
3230, 31jaod 860 . . . . . . . . . 10 (((𝐴 No 𝑛 ∈ ℕ0s) ∧ ((𝐴s𝑛) = 0s𝐴 = 0s )) → (((𝐴s𝑛) = 0s𝐴 = 0s ) → 𝐴 = 0s ))
3329, 32sylbid 240 . . . . . . . . 9 (((𝐴 No 𝑛 ∈ ℕ0s) ∧ ((𝐴s𝑛) = 0s𝐴 = 0s )) → ((𝐴s(𝑛 +s 1s )) = 0s𝐴 = 0s ))
3433ex 412 . . . . . . . 8 ((𝐴 No 𝑛 ∈ ℕ0s) → (((𝐴s𝑛) = 0s𝐴 = 0s ) → ((𝐴s(𝑛 +s 1s )) = 0s𝐴 = 0s )))
3534expcom 413 . . . . . . 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 28311 . . . . 5 (𝑁 ∈ ℕ0s → (𝐴 No → ((𝐴s𝑁) = 0s𝐴 = 0s )))
3837imp 406 . . . 4 ((𝑁 ∈ ℕ0s𝐴 No ) → ((𝐴s𝑁) = 0s𝐴 = 0s ))
3938necon3d 2952 . . 3 ((𝑁 ∈ ℕ0s𝐴 No ) → (𝐴 ≠ 0s → (𝐴s𝑁) ≠ 0s ))
4039ex 412 . 2 (𝑁 ∈ ℕ0s → (𝐴 No → (𝐴 ≠ 0s → (𝐴s𝑁) ≠ 0s )))
41403imp231 1113 1 ((𝐴 No 𝐴 ≠ 0s𝑁 ∈ ℕ0s) → (𝐴s𝑁) ≠ 0s )
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  wo 848  w3a 1087   = wceq 1542  wcel 2114  wne 2931  (class class class)co 7358   No csur 27609   0s c0s 27801   1s c1s 27802   +s cadds 27939   ·s cmuls 28086  0scnn0s 28291  scexps 28389
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2183  ax-ext 2707  ax-rep 5223  ax-sep 5240  ax-nul 5250  ax-pow 5309  ax-pr 5376  ax-un 7680
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2538  df-eu 2568  df-clab 2714  df-cleq 2727  df-clel 2810  df-nfc 2884  df-ne 2932  df-ral 3051  df-rex 3060  df-rmo 3349  df-reu 3350  df-rab 3399  df-v 3441  df-sbc 3740  df-csb 3849  df-dif 3903  df-un 3905  df-in 3907  df-ss 3917  df-pss 3920  df-nul 4285  df-if 4479  df-pw 4555  df-sn 4580  df-pr 4582  df-tp 4584  df-op 4586  df-ot 4588  df-uni 4863  df-int 4902  df-iun 4947  df-br 5098  df-opab 5160  df-mpt 5179  df-tr 5205  df-id 5518  df-eprel 5523  df-po 5531  df-so 5532  df-fr 5576  df-se 5577  df-we 5578  df-xp 5629  df-rel 5630  df-cnv 5631  df-co 5632  df-dm 5633  df-rn 5634  df-res 5635  df-ima 5636  df-pred 6258  df-ord 6319  df-on 6320  df-lim 6321  df-suc 6322  df-iota 6447  df-fun 6493  df-fn 6494  df-f 6495  df-f1 6496  df-fo 6497  df-f1o 6498  df-fv 6499  df-riota 7315  df-ov 7361  df-oprab 7362  df-mpo 7363  df-om 7809  df-1st 7933  df-2nd 7934  df-frecs 8223  df-wrecs 8254  df-recs 8303  df-rdg 8341  df-1o 8397  df-2o 8398  df-oadd 8401  df-nadd 8594  df-no 27612  df-slt 27613  df-bday 27614  df-sle 27715  df-sslt 27756  df-scut 27758  df-0s 27803  df-1s 27804  df-made 27823  df-old 27824  df-left 27826  df-right 27827  df-norec 27918  df-norec2 27929  df-adds 27940  df-negs 28001  df-subs 28002  df-muls 28087  df-seqs 28263  df-n0s 28293  df-nns 28294  df-zs 28356  df-exps 28390
This theorem is referenced by:  pw2divscld  28416  pw2divsmuld  28417  pw2divscan2d  28419  pw2divsassd  28420  pw2divsrecd  28424  pw2cut  28437  zs12zodd  28459
  Copyright terms: Public domain W3C validator