![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > expsub | Structured version Visualization version GIF version |
Description: Exponent subtraction law for nonnegative integer exponentiation. (Contributed by NM, 2-Aug-2006.) (Revised by Mario Carneiro, 4-Jun-2014.) |
Ref | Expression |
---|---|
expsub | ⊢ (((𝐴 ∈ ℂ ∧ 𝐴 ≠ 0) ∧ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ)) → (𝐴↑(𝑀 − 𝑁)) = ((𝐴↑𝑀) / (𝐴↑𝑁))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | znegcl 12005 | . . 3 ⊢ (𝑁 ∈ ℤ → -𝑁 ∈ ℤ) | |
2 | expaddz 13469 | . . 3 ⊢ (((𝐴 ∈ ℂ ∧ 𝐴 ≠ 0) ∧ (𝑀 ∈ ℤ ∧ -𝑁 ∈ ℤ)) → (𝐴↑(𝑀 + -𝑁)) = ((𝐴↑𝑀) · (𝐴↑-𝑁))) | |
3 | 1, 2 | sylanr2 682 | . 2 ⊢ (((𝐴 ∈ ℂ ∧ 𝐴 ≠ 0) ∧ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ)) → (𝐴↑(𝑀 + -𝑁)) = ((𝐴↑𝑀) · (𝐴↑-𝑁))) |
4 | zcn 11974 | . . . . 5 ⊢ (𝑀 ∈ ℤ → 𝑀 ∈ ℂ) | |
5 | zcn 11974 | . . . . 5 ⊢ (𝑁 ∈ ℤ → 𝑁 ∈ ℂ) | |
6 | negsub 10923 | . . . . 5 ⊢ ((𝑀 ∈ ℂ ∧ 𝑁 ∈ ℂ) → (𝑀 + -𝑁) = (𝑀 − 𝑁)) | |
7 | 4, 5, 6 | syl2an 598 | . . . 4 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 + -𝑁) = (𝑀 − 𝑁)) |
8 | 7 | adantl 485 | . . 3 ⊢ (((𝐴 ∈ ℂ ∧ 𝐴 ≠ 0) ∧ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ)) → (𝑀 + -𝑁) = (𝑀 − 𝑁)) |
9 | 8 | oveq2d 7151 | . 2 ⊢ (((𝐴 ∈ ℂ ∧ 𝐴 ≠ 0) ∧ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ)) → (𝐴↑(𝑀 + -𝑁)) = (𝐴↑(𝑀 − 𝑁))) |
10 | expnegz 13459 | . . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 𝐴 ≠ 0 ∧ 𝑁 ∈ ℤ) → (𝐴↑-𝑁) = (1 / (𝐴↑𝑁))) | |
11 | 10 | 3expa 1115 | . . . . 5 ⊢ (((𝐴 ∈ ℂ ∧ 𝐴 ≠ 0) ∧ 𝑁 ∈ ℤ) → (𝐴↑-𝑁) = (1 / (𝐴↑𝑁))) |
12 | 11 | adantrl 715 | . . . 4 ⊢ (((𝐴 ∈ ℂ ∧ 𝐴 ≠ 0) ∧ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ)) → (𝐴↑-𝑁) = (1 / (𝐴↑𝑁))) |
13 | 12 | oveq2d 7151 | . . 3 ⊢ (((𝐴 ∈ ℂ ∧ 𝐴 ≠ 0) ∧ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ)) → ((𝐴↑𝑀) · (𝐴↑-𝑁)) = ((𝐴↑𝑀) · (1 / (𝐴↑𝑁)))) |
14 | expclz 13450 | . . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 𝐴 ≠ 0 ∧ 𝑀 ∈ ℤ) → (𝐴↑𝑀) ∈ ℂ) | |
15 | 14 | 3expa 1115 | . . . . 5 ⊢ (((𝐴 ∈ ℂ ∧ 𝐴 ≠ 0) ∧ 𝑀 ∈ ℤ) → (𝐴↑𝑀) ∈ ℂ) |
16 | 15 | adantrr 716 | . . . 4 ⊢ (((𝐴 ∈ ℂ ∧ 𝐴 ≠ 0) ∧ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ)) → (𝐴↑𝑀) ∈ ℂ) |
17 | expclz 13450 | . . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 𝐴 ≠ 0 ∧ 𝑁 ∈ ℤ) → (𝐴↑𝑁) ∈ ℂ) | |
18 | 17 | 3expa 1115 | . . . . 5 ⊢ (((𝐴 ∈ ℂ ∧ 𝐴 ≠ 0) ∧ 𝑁 ∈ ℤ) → (𝐴↑𝑁) ∈ ℂ) |
19 | 18 | adantrl 715 | . . . 4 ⊢ (((𝐴 ∈ ℂ ∧ 𝐴 ≠ 0) ∧ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ)) → (𝐴↑𝑁) ∈ ℂ) |
20 | expne0i 13457 | . . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 𝐴 ≠ 0 ∧ 𝑁 ∈ ℤ) → (𝐴↑𝑁) ≠ 0) | |
21 | 20 | 3expa 1115 | . . . . 5 ⊢ (((𝐴 ∈ ℂ ∧ 𝐴 ≠ 0) ∧ 𝑁 ∈ ℤ) → (𝐴↑𝑁) ≠ 0) |
22 | 21 | adantrl 715 | . . . 4 ⊢ (((𝐴 ∈ ℂ ∧ 𝐴 ≠ 0) ∧ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ)) → (𝐴↑𝑁) ≠ 0) |
23 | 16, 19, 22 | divrecd 11408 | . . 3 ⊢ (((𝐴 ∈ ℂ ∧ 𝐴 ≠ 0) ∧ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ)) → ((𝐴↑𝑀) / (𝐴↑𝑁)) = ((𝐴↑𝑀) · (1 / (𝐴↑𝑁)))) |
24 | 13, 23 | eqtr4d 2836 | . 2 ⊢ (((𝐴 ∈ ℂ ∧ 𝐴 ≠ 0) ∧ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ)) → ((𝐴↑𝑀) · (𝐴↑-𝑁)) = ((𝐴↑𝑀) / (𝐴↑𝑁))) |
25 | 3, 9, 24 | 3eqtr3d 2841 | 1 ⊢ (((𝐴 ∈ ℂ ∧ 𝐴 ≠ 0) ∧ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ)) → (𝐴↑(𝑀 − 𝑁)) = ((𝐴↑𝑀) / (𝐴↑𝑁))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 399 = wceq 1538 ∈ wcel 2111 ≠ wne 2987 (class class class)co 7135 ℂcc 10524 0cc0 10526 1c1 10527 + caddc 10529 · cmul 10531 − cmin 10859 -cneg 10860 / cdiv 11286 ℤcz 11969 ↑cexp 13425 |
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 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441 ax-cnex 10582 ax-resscn 10583 ax-1cn 10584 ax-icn 10585 ax-addcl 10586 ax-addrcl 10587 ax-mulcl 10588 ax-mulrcl 10589 ax-mulcom 10590 ax-addass 10591 ax-mulass 10592 ax-distr 10593 ax-i2m1 10594 ax-1ne0 10595 ax-1rid 10596 ax-rnegex 10597 ax-rrecex 10598 ax-cnre 10599 ax-pre-lttri 10600 ax-pre-lttrn 10601 ax-pre-ltadd 10602 ax-pre-mulgt0 10603 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1085 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-nel 3092 df-ral 3111 df-rex 3112 df-reu 3113 df-rmo 3114 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-pss 3900 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-tp 4530 df-op 4532 df-uni 4801 df-iun 4883 df-br 5031 df-opab 5093 df-mpt 5111 df-tr 5137 df-id 5425 df-eprel 5430 df-po 5438 df-so 5439 df-fr 5478 df-we 5480 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-pred 6116 df-ord 6162 df-on 6163 df-lim 6164 df-suc 6165 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-riota 7093 df-ov 7138 df-oprab 7139 df-mpo 7140 df-om 7561 df-2nd 7672 df-wrecs 7930 df-recs 7991 df-rdg 8029 df-er 8272 df-en 8493 df-dom 8494 df-sdom 8495 df-pnf 10666 df-mnf 10667 df-xr 10668 df-ltxr 10669 df-le 10670 df-sub 10861 df-neg 10862 df-div 11287 df-nn 11626 df-n0 11886 df-z 11970 df-uz 12232 df-seq 13365 df-exp 13426 |
This theorem is referenced by: expm1 13475 expsubd 13517 ltexp2a 13526 leexp2a 13532 iexpcyc 13565 expmulnbnd 13592 dvdsprmpweqle 16212 m1expaddsub 18618 psgnuni 18619 aaliou3lem8 24941 hgt750lem 32032 fmtnoprmfac2lem1 44083 digexp 45021 dignn0flhalflem1 45029 |
Copyright terms: Public domain | W3C validator |