| Mathbox for Steven Nguyen |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > dvdsexpnn | Structured version Visualization version GIF version | ||
| Description: dvdssqlem 16630 generalized to positive integer exponents. (Contributed by SN, 20-Aug-2024.) |
| Ref | Expression |
|---|---|
| dvdsexpnn | ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ) → (𝐴 ∥ 𝐵 ↔ (𝐴↑𝑁) ∥ (𝐵↑𝑁))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nnz 12618 | . . 3 ⊢ (𝐴 ∈ ℕ → 𝐴 ∈ ℤ) | |
| 2 | nnz 12618 | . . 3 ⊢ (𝐵 ∈ ℕ → 𝐵 ∈ ℤ) | |
| 3 | nnnn0 12517 | . . 3 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℕ0) | |
| 4 | dvdsexpim 16619 | . . 3 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ ∧ 𝑁 ∈ ℕ0) → (𝐴 ∥ 𝐵 → (𝐴↑𝑁) ∥ (𝐵↑𝑁))) | |
| 5 | 1, 2, 3, 4 | syl3an 1177 | . 2 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ) → (𝐴 ∥ 𝐵 → (𝐴↑𝑁) ∥ (𝐵↑𝑁))) |
| 6 | gcdnncl 16571 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → (𝐴 gcd 𝐵) ∈ ℕ) | |
| 7 | 6 | nnrpd 13064 | . . . . . . 7 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → (𝐴 gcd 𝐵) ∈ ℝ+) |
| 8 | 7 | 3adant3 1149 | . . . . . 6 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ) → (𝐴 gcd 𝐵) ∈ ℝ+) |
| 9 | 8 | adantr 485 | . . . . 5 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ) ∧ (𝐴↑𝑁) ∥ (𝐵↑𝑁)) → (𝐴 gcd 𝐵) ∈ ℝ+) |
| 10 | simpl1 1209 | . . . . . 6 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ) ∧ (𝐴↑𝑁) ∥ (𝐵↑𝑁)) → 𝐴 ∈ ℕ) | |
| 11 | 10 | nnrpd 13064 | . . . . 5 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ) ∧ (𝐴↑𝑁) ∥ (𝐵↑𝑁)) → 𝐴 ∈ ℝ+) |
| 12 | simpl3 1211 | . . . . 5 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ) ∧ (𝐴↑𝑁) ∥ (𝐵↑𝑁)) → 𝑁 ∈ ℕ) | |
| 13 | expgcd 16627 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ0) → ((𝐴 gcd 𝐵)↑𝑁) = ((𝐴↑𝑁) gcd (𝐵↑𝑁))) | |
| 14 | 3, 13 | syl3an3 1182 | . . . . . . 7 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ) → ((𝐴 gcd 𝐵)↑𝑁) = ((𝐴↑𝑁) gcd (𝐵↑𝑁))) |
| 15 | 14 | adantr 485 | . . . . . 6 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ) ∧ (𝐴↑𝑁) ∥ (𝐵↑𝑁)) → ((𝐴 gcd 𝐵)↑𝑁) = ((𝐴↑𝑁) gcd (𝐵↑𝑁))) |
| 16 | simp1 1153 | . . . . . . . . 9 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ) → 𝐴 ∈ ℕ) | |
| 17 | 3 | 3ad2ant3 1152 | . . . . . . . . 9 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ) → 𝑁 ∈ ℕ0) |
| 18 | 16, 17 | nnexpcld 14288 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ) → (𝐴↑𝑁) ∈ ℕ) |
| 19 | simp2 1154 | . . . . . . . . 9 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ) → 𝐵 ∈ ℕ) | |
| 20 | 19, 17 | nnexpcld 14288 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ) → (𝐵↑𝑁) ∈ ℕ) |
| 21 | gcdeq 16617 | . . . . . . . 8 ⊢ (((𝐴↑𝑁) ∈ ℕ ∧ (𝐵↑𝑁) ∈ ℕ) → (((𝐴↑𝑁) gcd (𝐵↑𝑁)) = (𝐴↑𝑁) ↔ (𝐴↑𝑁) ∥ (𝐵↑𝑁))) | |
| 22 | 18, 20, 21 | syl2anc 595 | . . . . . . 7 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ) → (((𝐴↑𝑁) gcd (𝐵↑𝑁)) = (𝐴↑𝑁) ↔ (𝐴↑𝑁) ∥ (𝐵↑𝑁))) |
| 23 | 22 | biimpar 482 | . . . . . 6 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ) ∧ (𝐴↑𝑁) ∥ (𝐵↑𝑁)) → ((𝐴↑𝑁) gcd (𝐵↑𝑁)) = (𝐴↑𝑁)) |
| 24 | 15, 23 | eqtrd 2797 | . . . . 5 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ) ∧ (𝐴↑𝑁) ∥ (𝐵↑𝑁)) → ((𝐴 gcd 𝐵)↑𝑁) = (𝐴↑𝑁)) |
| 25 | 9, 11, 12, 24 | exp11nnd 14304 | . . . 4 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ) ∧ (𝐴↑𝑁) ∥ (𝐵↑𝑁)) → (𝐴 gcd 𝐵) = 𝐴) |
| 26 | gcddvds 16567 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → ((𝐴 gcd 𝐵) ∥ 𝐴 ∧ (𝐴 gcd 𝐵) ∥ 𝐵)) | |
| 27 | 26 | simprd 500 | . . . . . . 7 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (𝐴 gcd 𝐵) ∥ 𝐵) |
| 28 | 1, 2, 27 | syl2an 607 | . . . . . 6 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → (𝐴 gcd 𝐵) ∥ 𝐵) |
| 29 | 28 | 3adant3 1149 | . . . . 5 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ) → (𝐴 gcd 𝐵) ∥ 𝐵) |
| 30 | 29 | adantr 485 | . . . 4 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ) ∧ (𝐴↑𝑁) ∥ (𝐵↑𝑁)) → (𝐴 gcd 𝐵) ∥ 𝐵) |
| 31 | 25, 30 | eqbrtrrd 5134 | . . 3 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ) ∧ (𝐴↑𝑁) ∥ (𝐵↑𝑁)) → 𝐴 ∥ 𝐵) |
| 32 | 31 | ex 417 | . 2 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ) → ((𝐴↑𝑁) ∥ (𝐵↑𝑁) → 𝐴 ∥ 𝐵)) |
| 33 | 5, 32 | impbid 215 | 1 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ) → (𝐴 ∥ 𝐵 ↔ (𝐴↑𝑁) ∥ (𝐵↑𝑁))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 400 ∧ w3a 1102 = wceq 1569 ∈ wcel 2142 class class class wbr 5108 (class class class)co 7412 ℕcn 12239 ℕ0cn0 12510 ℤcz 12597 ℝ+crp 13022 ↑cexp 14104 ∥ cdvds 16316 gcd cgcd 16558 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-sep 5256 ax-nul 5268 ax-pow 5335 ax-pr 5403 ax-un 7734 ax-cnex 11162 ax-resscn 11163 ax-1cn 11164 ax-icn 11165 ax-addcl 11166 ax-addrcl 11167 ax-mulcl 11168 ax-mulrcl 11169 ax-mulcom 11170 ax-addass 11171 ax-mulass 11172 ax-distr 11173 ax-i2m1 11174 ax-1ne0 11175 ax-1rid 11176 ax-rnegex 11177 ax-rrecex 11178 ax-cnre 11179 ax-pre-lttri 11180 ax-pre-lttrn 11181 ax-pre-ltadd 11182 ax-pre-mulgt0 11183 ax-pre-sup 11184 |
| This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1103 df-3an 1104 df-tru 1572 df-fal 1582 df-ex 1809 df-nf 1813 df-sb 2096 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3064 df-ral 3079 df-rex 3089 df-rmo 3368 df-reu 3369 df-rab 3416 df-v 3456 df-sbc 3744 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4487 df-pw 4563 df-sn 4589 df-pr 4591 df-op 4595 df-uni 4872 df-iun 4957 df-br 5109 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5555 df-eprel 5560 df-po 5568 df-so 5569 df-fr 5613 df-we 5615 df-xp 5666 df-rel 5667 df-cnv 5668 df-co 5669 df-dm 5670 df-rn 5671 df-res 5672 df-ima 5673 df-pred 6302 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7861 df-2nd 7985 df-frecs 8276 df-wrecs 8307 df-recs 8356 df-rdg 8395 df-er 8692 df-en 8942 df-dom 8943 df-sdom 8944 df-sup 9400 df-inf 9401 df-pnf 11251 df-mnf 11252 df-xr 11253 df-ltxr 11254 df-le 11255 df-sub 11449 df-neg 11450 df-div 11878 df-nn 12240 df-2 12309 df-3 12310 df-n0 12511 df-z 12598 df-uz 12869 df-rp 13023 df-fl 13832 df-mod 13910 df-seq 14045 df-exp 14105 df-cj 15157 df-re 15158 df-im 15159 df-sqrt 15293 df-abs 15294 df-dvds 16317 df-gcd 16559 |
| This theorem is used by: dvdsexpnn0 43123 fltdvdsabdvdsc 43398 fltaccoprm 43400 |
| Copyright terms: Public domain | W3C validator |