Mathbox for Steven Nguyen |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > dvdsexpnn | Structured version Visualization version GIF version |
Description: dvdssqlem 16281 generalized to positive integer exponents. (Contributed by SN, 20-Aug-2024.) |
Ref | Expression |
---|---|
dvdsexpnn | ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ) → (𝐴 ∥ 𝐵 ↔ (𝐴↑𝑁) ∥ (𝐵↑𝑁))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nnz 12352 | . . 3 ⊢ (𝐴 ∈ ℕ → 𝐴 ∈ ℤ) | |
2 | nnz 12352 | . . 3 ⊢ (𝐵 ∈ ℕ → 𝐵 ∈ ℤ) | |
3 | nnnn0 12250 | . . 3 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℕ0) | |
4 | dvdsexpim 40336 | . . 3 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ ∧ 𝑁 ∈ ℕ0) → (𝐴 ∥ 𝐵 → (𝐴↑𝑁) ∥ (𝐵↑𝑁))) | |
5 | 1, 2, 3, 4 | syl3an 1159 | . 2 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ) → (𝐴 ∥ 𝐵 → (𝐴↑𝑁) ∥ (𝐵↑𝑁))) |
6 | gcdnncl 16224 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → (𝐴 gcd 𝐵) ∈ ℕ) | |
7 | 6 | nnrpd 12780 | . . . . . . 7 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → (𝐴 gcd 𝐵) ∈ ℝ+) |
8 | 7 | 3adant3 1131 | . . . . . 6 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ) → (𝐴 gcd 𝐵) ∈ ℝ+) |
9 | 8 | adantr 481 | . . . . 5 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ) ∧ (𝐴↑𝑁) ∥ (𝐵↑𝑁)) → (𝐴 gcd 𝐵) ∈ ℝ+) |
10 | simpl1 1190 | . . . . . 6 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ) ∧ (𝐴↑𝑁) ∥ (𝐵↑𝑁)) → 𝐴 ∈ ℕ) | |
11 | 10 | nnrpd 12780 | . . . . 5 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ) ∧ (𝐴↑𝑁) ∥ (𝐵↑𝑁)) → 𝐴 ∈ ℝ+) |
12 | simpl3 1192 | . . . . 5 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ) ∧ (𝐴↑𝑁) ∥ (𝐵↑𝑁)) → 𝑁 ∈ ℕ) | |
13 | expgcd 40342 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ0) → ((𝐴 gcd 𝐵)↑𝑁) = ((𝐴↑𝑁) gcd (𝐵↑𝑁))) | |
14 | 3, 13 | syl3an3 1164 | . . . . . . 7 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ) → ((𝐴 gcd 𝐵)↑𝑁) = ((𝐴↑𝑁) gcd (𝐵↑𝑁))) |
15 | 14 | adantr 481 | . . . . . 6 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ) ∧ (𝐴↑𝑁) ∥ (𝐵↑𝑁)) → ((𝐴 gcd 𝐵)↑𝑁) = ((𝐴↑𝑁) gcd (𝐵↑𝑁))) |
16 | simp1 1135 | . . . . . . . . 9 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ) → 𝐴 ∈ ℕ) | |
17 | 3 | 3ad2ant3 1134 | . . . . . . . . 9 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ) → 𝑁 ∈ ℕ0) |
18 | 16, 17 | nnexpcld 13970 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ) → (𝐴↑𝑁) ∈ ℕ) |
19 | simp2 1136 | . . . . . . . . 9 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ) → 𝐵 ∈ ℕ) | |
20 | 19, 17 | nnexpcld 13970 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ) → (𝐵↑𝑁) ∈ ℕ) |
21 | gcdeq 16273 | . . . . . . . 8 ⊢ (((𝐴↑𝑁) ∈ ℕ ∧ (𝐵↑𝑁) ∈ ℕ) → (((𝐴↑𝑁) gcd (𝐵↑𝑁)) = (𝐴↑𝑁) ↔ (𝐴↑𝑁) ∥ (𝐵↑𝑁))) | |
22 | 18, 20, 21 | syl2anc 584 | . . . . . . 7 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ) → (((𝐴↑𝑁) gcd (𝐵↑𝑁)) = (𝐴↑𝑁) ↔ (𝐴↑𝑁) ∥ (𝐵↑𝑁))) |
23 | 22 | biimpar 478 | . . . . . 6 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ) ∧ (𝐴↑𝑁) ∥ (𝐵↑𝑁)) → ((𝐴↑𝑁) gcd (𝐵↑𝑁)) = (𝐴↑𝑁)) |
24 | 15, 23 | eqtrd 2778 | . . . . 5 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ) ∧ (𝐴↑𝑁) ∥ (𝐵↑𝑁)) → ((𝐴 gcd 𝐵)↑𝑁) = (𝐴↑𝑁)) |
25 | 9, 11, 12, 24 | exp11nnd 40332 | . . . 4 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ) ∧ (𝐴↑𝑁) ∥ (𝐵↑𝑁)) → (𝐴 gcd 𝐵) = 𝐴) |
26 | gcddvds 16220 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → ((𝐴 gcd 𝐵) ∥ 𝐴 ∧ (𝐴 gcd 𝐵) ∥ 𝐵)) | |
27 | 26 | simprd 496 | . . . . . . 7 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (𝐴 gcd 𝐵) ∥ 𝐵) |
28 | 1, 2, 27 | syl2an 596 | . . . . . 6 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → (𝐴 gcd 𝐵) ∥ 𝐵) |
29 | 28 | 3adant3 1131 | . . . . 5 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ) → (𝐴 gcd 𝐵) ∥ 𝐵) |
30 | 29 | adantr 481 | . . . 4 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ) ∧ (𝐴↑𝑁) ∥ (𝐵↑𝑁)) → (𝐴 gcd 𝐵) ∥ 𝐵) |
31 | 25, 30 | eqbrtrrd 5097 | . . 3 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ) ∧ (𝐴↑𝑁) ∥ (𝐵↑𝑁)) → 𝐴 ∥ 𝐵) |
32 | 31 | ex 413 | . 2 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ) → ((𝐴↑𝑁) ∥ (𝐵↑𝑁) → 𝐴 ∥ 𝐵)) |
33 | 5, 32 | impbid 211 | 1 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ) → (𝐴 ∥ 𝐵 ↔ (𝐴↑𝑁) ∥ (𝐵↑𝑁))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 ∧ w3a 1086 = wceq 1539 ∈ wcel 2106 class class class wbr 5073 (class class class)co 7267 ℕcn 11983 ℕ0cn0 12243 ℤcz 12329 ℝ+crp 12740 ↑cexp 13792 ∥ cdvds 15973 gcd cgcd 16211 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 ax-sep 5221 ax-nul 5228 ax-pow 5286 ax-pr 5350 ax-un 7578 ax-cnex 10937 ax-resscn 10938 ax-1cn 10939 ax-icn 10940 ax-addcl 10941 ax-addrcl 10942 ax-mulcl 10943 ax-mulrcl 10944 ax-mulcom 10945 ax-addass 10946 ax-mulass 10947 ax-distr 10948 ax-i2m1 10949 ax-1ne0 10950 ax-1rid 10951 ax-rnegex 10952 ax-rrecex 10953 ax-cnre 10954 ax-pre-lttri 10955 ax-pre-lttrn 10956 ax-pre-ltadd 10957 ax-pre-mulgt0 10958 ax-pre-sup 10959 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ne 2944 df-nel 3050 df-ral 3069 df-rex 3070 df-reu 3071 df-rmo 3072 df-rab 3073 df-v 3431 df-sbc 3716 df-csb 3832 df-dif 3889 df-un 3891 df-in 3893 df-ss 3903 df-pss 3905 df-nul 4257 df-if 4460 df-pw 4535 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4840 df-iun 4926 df-br 5074 df-opab 5136 df-mpt 5157 df-tr 5191 df-id 5484 df-eprel 5490 df-po 5498 df-so 5499 df-fr 5539 df-we 5541 df-xp 5590 df-rel 5591 df-cnv 5592 df-co 5593 df-dm 5594 df-rn 5595 df-res 5596 df-ima 5597 df-pred 6195 df-ord 6262 df-on 6263 df-lim 6264 df-suc 6265 df-iota 6384 df-fun 6428 df-fn 6429 df-f 6430 df-f1 6431 df-fo 6432 df-f1o 6433 df-fv 6434 df-riota 7224 df-ov 7270 df-oprab 7271 df-mpo 7272 df-om 7703 df-2nd 7821 df-frecs 8084 df-wrecs 8115 df-recs 8189 df-rdg 8228 df-er 8485 df-en 8721 df-dom 8722 df-sdom 8723 df-sup 9188 df-inf 9189 df-pnf 11021 df-mnf 11022 df-xr 11023 df-ltxr 11024 df-le 11025 df-sub 11217 df-neg 11218 df-div 11643 df-nn 11984 df-2 12046 df-3 12047 df-n0 12244 df-z 12330 df-uz 12593 df-rp 12741 df-fl 13522 df-mod 13600 df-seq 13732 df-exp 13793 df-cj 14820 df-re 14821 df-im 14822 df-sqrt 14956 df-abs 14957 df-dvds 15974 df-gcd 16212 |
This theorem is referenced by: dvdsexpnn0 40349 fltdvdsabdvdsc 40483 fltaccoprm 40485 |
Copyright terms: Public domain | W3C validator |