| 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 16485 for nonnegative exponents. (Contributed by Steven Nguyen, 2-Apr-2023.) |
| Ref | Expression |
|---|---|
| dvdsexpim | ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ ∧ 𝑁 ∈ ℕ0) → (𝐴 ∥ 𝐵 → (𝐴↑𝑁) ∥ (𝐵↑𝑁))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | divides 16185 | . . 3 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (𝐴 ∥ 𝐵 ↔ ∃𝑘 ∈ ℤ (𝑘 · 𝐴) = 𝐵)) | |
| 2 | 1 | 3adant3 1133 | . 2 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ ∧ 𝑁 ∈ ℕ0) → (𝐴 ∥ 𝐵 ↔ ∃𝑘 ∈ ℤ (𝑘 · 𝐴) = 𝐵)) |
| 3 | zexpcl 14003 | . . . . . . . . 9 ⊢ ((𝑘 ∈ ℤ ∧ 𝑁 ∈ ℕ0) → (𝑘↑𝑁) ∈ ℤ) | |
| 4 | 3 | ancoms 458 | . . . . . . . 8 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑘 ∈ ℤ) → (𝑘↑𝑁) ∈ ℤ) |
| 5 | 4 | adantll 715 | . . . . . . 7 ⊢ (((𝐴 ∈ ℤ ∧ 𝑁 ∈ ℕ0) ∧ 𝑘 ∈ ℤ) → (𝑘↑𝑁) ∈ ℤ) |
| 6 | zexpcl 14003 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℤ ∧ 𝑁 ∈ ℕ0) → (𝐴↑𝑁) ∈ ℤ) | |
| 7 | 6 | adantr 480 | . . . . . . 7 ⊢ (((𝐴 ∈ ℤ ∧ 𝑁 ∈ ℕ0) ∧ 𝑘 ∈ ℤ) → (𝐴↑𝑁) ∈ ℤ) |
| 8 | dvdsmul2 16209 | . . . . . . 7 ⊢ (((𝑘↑𝑁) ∈ ℤ ∧ (𝐴↑𝑁) ∈ ℤ) → (𝐴↑𝑁) ∥ ((𝑘↑𝑁) · (𝐴↑𝑁))) | |
| 9 | 5, 7, 8 | syl2anc 585 | . . . . . 6 ⊢ (((𝐴 ∈ ℤ ∧ 𝑁 ∈ ℕ0) ∧ 𝑘 ∈ ℤ) → (𝐴↑𝑁) ∥ ((𝑘↑𝑁) · (𝐴↑𝑁))) |
| 10 | zcn 12497 | . . . . . . . 8 ⊢ (𝑘 ∈ ℤ → 𝑘 ∈ ℂ) | |
| 11 | 10 | adantl 481 | . . . . . . 7 ⊢ (((𝐴 ∈ ℤ ∧ 𝑁 ∈ ℕ0) ∧ 𝑘 ∈ ℤ) → 𝑘 ∈ ℂ) |
| 12 | zcn 12497 | . . . . . . . 8 ⊢ (𝐴 ∈ ℤ → 𝐴 ∈ ℂ) | |
| 13 | 12 | ad2antrr 727 | . . . . . . 7 ⊢ (((𝐴 ∈ ℤ ∧ 𝑁 ∈ ℕ0) ∧ 𝑘 ∈ ℤ) → 𝐴 ∈ ℂ) |
| 14 | simplr 769 | . . . . . . 7 ⊢ (((𝐴 ∈ ℤ ∧ 𝑁 ∈ ℕ0) ∧ 𝑘 ∈ ℤ) → 𝑁 ∈ ℕ0) | |
| 15 | 11, 13, 14 | mulexpd 14088 | . . . . . 6 ⊢ (((𝐴 ∈ ℤ ∧ 𝑁 ∈ ℕ0) ∧ 𝑘 ∈ ℤ) → ((𝑘 · 𝐴)↑𝑁) = ((𝑘↑𝑁) · (𝐴↑𝑁))) |
| 16 | 9, 15 | breqtrrd 5127 | . . . . 5 ⊢ (((𝐴 ∈ ℤ ∧ 𝑁 ∈ ℕ0) ∧ 𝑘 ∈ ℤ) → (𝐴↑𝑁) ∥ ((𝑘 · 𝐴)↑𝑁)) |
| 17 | oveq1 7367 | . . . . . 6 ⊢ ((𝑘 · 𝐴) = 𝐵 → ((𝑘 · 𝐴)↑𝑁) = (𝐵↑𝑁)) | |
| 18 | 17 | breq2d 5111 | . . . . 5 ⊢ ((𝑘 · 𝐴) = 𝐵 → ((𝐴↑𝑁) ∥ ((𝑘 · 𝐴)↑𝑁) ↔ (𝐴↑𝑁) ∥ (𝐵↑𝑁))) |
| 19 | 16, 18 | syl5ibcom 245 | . . . 4 ⊢ (((𝐴 ∈ ℤ ∧ 𝑁 ∈ ℕ0) ∧ 𝑘 ∈ ℤ) → ((𝑘 · 𝐴) = 𝐵 → (𝐴↑𝑁) ∥ (𝐵↑𝑁))) |
| 20 | 19 | rexlimdva 3138 | . . 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 3061 class class class wbr 5099 (class class class)co 7360 ℂcc 11028 · cmul 11035 ℕ0cn0 12405 ℤcz 12492 ↑cexp 13988 ∥ cdvds 16183 |
| 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 5242 ax-nul 5252 ax-pow 5311 ax-pr 5378 ax-un 7682 ax-cnex 11086 ax-resscn 11087 ax-1cn 11088 ax-icn 11089 ax-addcl 11090 ax-addrcl 11091 ax-mulcl 11092 ax-mulrcl 11093 ax-mulcom 11094 ax-addass 11095 ax-mulass 11096 ax-distr 11097 ax-i2m1 11098 ax-1ne0 11099 ax-1rid 11100 ax-rnegex 11101 ax-rrecex 11102 ax-cnre 11103 ax-pre-lttri 11104 ax-pre-lttrn 11105 ax-pre-ltadd 11106 ax-pre-mulgt0 11107 |
| 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 3062 df-reu 3352 df-rab 3401 df-v 3443 df-sbc 3742 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4287 df-if 4481 df-pw 4557 df-sn 4582 df-pr 4584 df-op 4588 df-uni 4865 df-iun 4949 df-br 5100 df-opab 5162 df-mpt 5181 df-tr 5207 df-id 5520 df-eprel 5525 df-po 5533 df-so 5534 df-fr 5578 df-we 5580 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-pred 6260 df-ord 6321 df-on 6322 df-lim 6323 df-suc 6324 df-iota 6449 df-fun 6495 df-fn 6496 df-f 6497 df-f1 6498 df-fo 6499 df-f1o 6500 df-fv 6501 df-riota 7317 df-ov 7363 df-oprab 7364 df-mpo 7365 df-om 7811 df-2nd 7936 df-frecs 8225 df-wrecs 8256 df-recs 8305 df-rdg 8343 df-er 8637 df-en 8888 df-dom 8889 df-sdom 8890 df-pnf 11172 df-mnf 11173 df-xr 11174 df-ltxr 11175 df-le 11176 df-sub 11370 df-neg 11371 df-nn 12150 df-n0 12406 df-z 12493 df-uz 12756 df-seq 13929 df-exp 13989 df-dvds 16184 |
| This theorem is referenced by: expgcd 16494 dvdsexpad 42623 dvdsexpnn 42624 fltaccoprm 42919 |
| Copyright terms: Public domain | W3C validator |