| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > dvdsexpim | Structured version Visualization version GIF version | ||
| Description: If two numbers are divisible, so are their nonnegative exponents. Similar to dvdssqim 16523 for nonnegative exponents. (Contributed by Steven Nguyen, 2-Apr-2023.) |
| Ref | Expression |
|---|---|
| dvdsexpim | ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ ∧ 𝑁 ∈ ℕ0) → (𝐴 ∥ 𝐵 → (𝐴↑𝑁) ∥ (𝐵↑𝑁))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | divides 16223 | . . 3 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (𝐴 ∥ 𝐵 ↔ ∃𝑘 ∈ ℤ (𝑘 · 𝐴) = 𝐵)) | |
| 2 | 1 | 3adant3 1133 | . 2 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ ∧ 𝑁 ∈ ℕ0) → (𝐴 ∥ 𝐵 ↔ ∃𝑘 ∈ ℤ (𝑘 · 𝐴) = 𝐵)) |
| 3 | zexpcl 14038 | . . . . . . . . 9 ⊢ ((𝑘 ∈ ℤ ∧ 𝑁 ∈ ℕ0) → (𝑘↑𝑁) ∈ ℤ) | |
| 4 | 3 | ancoms 458 | . . . . . . . 8 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑘 ∈ ℤ) → (𝑘↑𝑁) ∈ ℤ) |
| 5 | 4 | adantll 715 | . . . . . . 7 ⊢ (((𝐴 ∈ ℤ ∧ 𝑁 ∈ ℕ0) ∧ 𝑘 ∈ ℤ) → (𝑘↑𝑁) ∈ ℤ) |
| 6 | zexpcl 14038 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℤ ∧ 𝑁 ∈ ℕ0) → (𝐴↑𝑁) ∈ ℤ) | |
| 7 | 6 | adantr 480 | . . . . . . 7 ⊢ (((𝐴 ∈ ℤ ∧ 𝑁 ∈ ℕ0) ∧ 𝑘 ∈ ℤ) → (𝐴↑𝑁) ∈ ℤ) |
| 8 | dvdsmul2 16247 | . . . . . . 7 ⊢ (((𝑘↑𝑁) ∈ ℤ ∧ (𝐴↑𝑁) ∈ ℤ) → (𝐴↑𝑁) ∥ ((𝑘↑𝑁) · (𝐴↑𝑁))) | |
| 9 | 5, 7, 8 | syl2anc 585 | . . . . . 6 ⊢ (((𝐴 ∈ ℤ ∧ 𝑁 ∈ ℕ0) ∧ 𝑘 ∈ ℤ) → (𝐴↑𝑁) ∥ ((𝑘↑𝑁) · (𝐴↑𝑁))) |
| 10 | zcn 12529 | . . . . . . . 8 ⊢ (𝑘 ∈ ℤ → 𝑘 ∈ ℂ) | |
| 11 | 10 | adantl 481 | . . . . . . 7 ⊢ (((𝐴 ∈ ℤ ∧ 𝑁 ∈ ℕ0) ∧ 𝑘 ∈ ℤ) → 𝑘 ∈ ℂ) |
| 12 | zcn 12529 | . . . . . . . 8 ⊢ (𝐴 ∈ ℤ → 𝐴 ∈ ℂ) | |
| 13 | 12 | ad2antrr 727 | . . . . . . 7 ⊢ (((𝐴 ∈ ℤ ∧ 𝑁 ∈ ℕ0) ∧ 𝑘 ∈ ℤ) → 𝐴 ∈ ℂ) |
| 14 | simplr 769 | . . . . . . 7 ⊢ (((𝐴 ∈ ℤ ∧ 𝑁 ∈ ℕ0) ∧ 𝑘 ∈ ℤ) → 𝑁 ∈ ℕ0) | |
| 15 | 11, 13, 14 | mulexpd 14123 | . . . . . 6 ⊢ (((𝐴 ∈ ℤ ∧ 𝑁 ∈ ℕ0) ∧ 𝑘 ∈ ℤ) → ((𝑘 · 𝐴)↑𝑁) = ((𝑘↑𝑁) · (𝐴↑𝑁))) |
| 16 | 9, 15 | breqtrrd 5114 | . . . . 5 ⊢ (((𝐴 ∈ ℤ ∧ 𝑁 ∈ ℕ0) ∧ 𝑘 ∈ ℤ) → (𝐴↑𝑁) ∥ ((𝑘 · 𝐴)↑𝑁)) |
| 17 | oveq1 7374 | . . . . . 6 ⊢ ((𝑘 · 𝐴) = 𝐵 → ((𝑘 · 𝐴)↑𝑁) = (𝐵↑𝑁)) | |
| 18 | 17 | breq2d 5098 | . . . . 5 ⊢ ((𝑘 · 𝐴) = 𝐵 → ((𝐴↑𝑁) ∥ ((𝑘 · 𝐴)↑𝑁) ↔ (𝐴↑𝑁) ∥ (𝐵↑𝑁))) |
| 19 | 16, 18 | syl5ibcom 245 | . . . 4 ⊢ (((𝐴 ∈ ℤ ∧ 𝑁 ∈ ℕ0) ∧ 𝑘 ∈ ℤ) → ((𝑘 · 𝐴) = 𝐵 → (𝐴↑𝑁) ∥ (𝐵↑𝑁))) |
| 20 | 19 | rexlimdva 3139 | . . 3 ⊢ ((𝐴 ∈ ℤ ∧ 𝑁 ∈ ℕ0) → (∃𝑘 ∈ ℤ (𝑘 · 𝐴) = 𝐵 → (𝐴↑𝑁) ∥ (𝐵↑𝑁))) |
| 21 | 20 | 3adant2 1132 | . 2 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ ∧ 𝑁 ∈ ℕ0) → (∃𝑘 ∈ ℤ (𝑘 · 𝐴) = 𝐵 → (𝐴↑𝑁) ∥ (𝐵↑𝑁))) |
| 22 | 2, 21 | sylbid 240 | 1 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ ∧ 𝑁 ∈ ℕ0) → (𝐴 ∥ 𝐵 → (𝐴↑𝑁) ∥ (𝐵↑𝑁))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 ∃wrex 3062 class class class wbr 5086 (class class class)co 7367 ℂcc 11036 · cmul 11043 ℕ0cn0 12437 ℤcz 12524 ↑cexp 14023 ∥ cdvds 16221 |
| 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 2185 ax-ext 2709 ax-sep 5232 ax-nul 5242 ax-pow 5308 ax-pr 5376 ax-un 7689 ax-cnex 11094 ax-resscn 11095 ax-1cn 11096 ax-icn 11097 ax-addcl 11098 ax-addrcl 11099 ax-mulcl 11100 ax-mulrcl 11101 ax-mulcom 11102 ax-addass 11103 ax-mulass 11104 ax-distr 11105 ax-i2m1 11106 ax-1ne0 11107 ax-1rid 11108 ax-rnegex 11109 ax-rrecex 11110 ax-cnre 11111 ax-pre-lttri 11112 ax-pre-lttrn 11113 ax-pre-ltadd 11114 ax-pre-mulgt0 11115 |
| 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 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-iun 4936 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6266 df-ord 6327 df-on 6328 df-lim 6329 df-suc 6330 df-iota 6455 df-fun 6501 df-fn 6502 df-f 6503 df-f1 6504 df-fo 6505 df-f1o 6506 df-fv 6507 df-riota 7324 df-ov 7370 df-oprab 7371 df-mpo 7372 df-om 7818 df-2nd 7943 df-frecs 8231 df-wrecs 8262 df-recs 8311 df-rdg 8349 df-er 8643 df-en 8894 df-dom 8895 df-sdom 8896 df-pnf 11181 df-mnf 11182 df-xr 11183 df-ltxr 11184 df-le 11185 df-sub 11379 df-neg 11380 df-nn 12175 df-n0 12438 df-z 12525 df-uz 12789 df-seq 13964 df-exp 14024 df-dvds 16222 |
| This theorem is referenced by: expgcd 16532 dvdsexpad 42764 dvdsexpnn 42765 fltaccoprm 43073 |
| Copyright terms: Public domain | W3C validator |