![]() |
Mathbox for Steven Nguyen |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > dvdsexpnn | Structured version Visualization version GIF version |
Description: dvdssqlem 16468 generalized to positive integer exponents. (Contributed by SN, 20-Aug-2024.) |
Ref | Expression |
---|---|
dvdsexpnn | ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ) → (𝐴 ∥ 𝐵 ↔ (𝐴↑𝑁) ∥ (𝐵↑𝑁))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nnz 12544 | . . 3 ⊢ (𝐴 ∈ ℕ → 𝐴 ∈ ℤ) | |
2 | nnz 12544 | . . 3 ⊢ (𝐵 ∈ ℕ → 𝐵 ∈ ℤ) | |
3 | nnnn0 12444 | . . 3 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℕ0) | |
4 | dvdsexpim 40905 | . . 3 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ ∧ 𝑁 ∈ ℕ0) → (𝐴 ∥ 𝐵 → (𝐴↑𝑁) ∥ (𝐵↑𝑁))) | |
5 | 1, 2, 3, 4 | syl3an 1160 | . 2 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ) → (𝐴 ∥ 𝐵 → (𝐴↑𝑁) ∥ (𝐵↑𝑁))) |
6 | gcdnncl 16413 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → (𝐴 gcd 𝐵) ∈ ℕ) | |
7 | 6 | nnrpd 12979 | . . . . . . 7 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → (𝐴 gcd 𝐵) ∈ ℝ+) |
8 | 7 | 3adant3 1132 | . . . . . 6 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ) → (𝐴 gcd 𝐵) ∈ ℝ+) |
9 | 8 | adantr 481 | . . . . 5 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ) ∧ (𝐴↑𝑁) ∥ (𝐵↑𝑁)) → (𝐴 gcd 𝐵) ∈ ℝ+) |
10 | simpl1 1191 | . . . . . 6 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ) ∧ (𝐴↑𝑁) ∥ (𝐵↑𝑁)) → 𝐴 ∈ ℕ) | |
11 | 10 | nnrpd 12979 | . . . . 5 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ) ∧ (𝐴↑𝑁) ∥ (𝐵↑𝑁)) → 𝐴 ∈ ℝ+) |
12 | simpl3 1193 | . . . . 5 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ) ∧ (𝐴↑𝑁) ∥ (𝐵↑𝑁)) → 𝑁 ∈ ℕ) | |
13 | expgcd 40911 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ0) → ((𝐴 gcd 𝐵)↑𝑁) = ((𝐴↑𝑁) gcd (𝐵↑𝑁))) | |
14 | 3, 13 | syl3an3 1165 | . . . . . . 7 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ) → ((𝐴 gcd 𝐵)↑𝑁) = ((𝐴↑𝑁) gcd (𝐵↑𝑁))) |
15 | 14 | adantr 481 | . . . . . 6 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ) ∧ (𝐴↑𝑁) ∥ (𝐵↑𝑁)) → ((𝐴 gcd 𝐵)↑𝑁) = ((𝐴↑𝑁) gcd (𝐵↑𝑁))) |
16 | simp1 1136 | . . . . . . . . 9 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ) → 𝐴 ∈ ℕ) | |
17 | 3 | 3ad2ant3 1135 | . . . . . . . . 9 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ) → 𝑁 ∈ ℕ0) |
18 | 16, 17 | nnexpcld 14173 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ) → (𝐴↑𝑁) ∈ ℕ) |
19 | simp2 1137 | . . . . . . . . 9 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ) → 𝐵 ∈ ℕ) | |
20 | 19, 17 | nnexpcld 14173 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ) → (𝐵↑𝑁) ∈ ℕ) |
21 | gcdeq 16460 | . . . . . . . 8 ⊢ (((𝐴↑𝑁) ∈ ℕ ∧ (𝐵↑𝑁) ∈ ℕ) → (((𝐴↑𝑁) gcd (𝐵↑𝑁)) = (𝐴↑𝑁) ↔ (𝐴↑𝑁) ∥ (𝐵↑𝑁))) | |
22 | 18, 20, 21 | syl2anc 584 | . . . . . . 7 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ) → (((𝐴↑𝑁) gcd (𝐵↑𝑁)) = (𝐴↑𝑁) ↔ (𝐴↑𝑁) ∥ (𝐵↑𝑁))) |
23 | 22 | biimpar 478 | . . . . . 6 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ) ∧ (𝐴↑𝑁) ∥ (𝐵↑𝑁)) → ((𝐴↑𝑁) gcd (𝐵↑𝑁)) = (𝐴↑𝑁)) |
24 | 15, 23 | eqtrd 2771 | . . . . 5 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ) ∧ (𝐴↑𝑁) ∥ (𝐵↑𝑁)) → ((𝐴 gcd 𝐵)↑𝑁) = (𝐴↑𝑁)) |
25 | 9, 11, 12, 24 | exp11nnd 40901 | . . . 4 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ) ∧ (𝐴↑𝑁) ∥ (𝐵↑𝑁)) → (𝐴 gcd 𝐵) = 𝐴) |
26 | gcddvds 16409 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → ((𝐴 gcd 𝐵) ∥ 𝐴 ∧ (𝐴 gcd 𝐵) ∥ 𝐵)) | |
27 | 26 | simprd 496 | . . . . . . 7 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (𝐴 gcd 𝐵) ∥ 𝐵) |
28 | 1, 2, 27 | syl2an 596 | . . . . . 6 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → (𝐴 gcd 𝐵) ∥ 𝐵) |
29 | 28 | 3adant3 1132 | . . . . 5 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ) → (𝐴 gcd 𝐵) ∥ 𝐵) |
30 | 29 | adantr 481 | . . . 4 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ) ∧ (𝐴↑𝑁) ∥ (𝐵↑𝑁)) → (𝐴 gcd 𝐵) ∥ 𝐵) |
31 | 25, 30 | eqbrtrrd 5149 | . . 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 1087 = wceq 1541 ∈ wcel 2106 class class class wbr 5125 (class class class)co 7377 ℕcn 12177 ℕ0cn0 12437 ℤcz 12523 ℝ+crp 12939 ↑cexp 13992 ∥ cdvds 16162 gcd cgcd 16400 |
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 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2702 ax-sep 5276 ax-nul 5283 ax-pow 5340 ax-pr 5404 ax-un 7692 ax-cnex 11131 ax-resscn 11132 ax-1cn 11133 ax-icn 11134 ax-addcl 11135 ax-addrcl 11136 ax-mulcl 11137 ax-mulrcl 11138 ax-mulcom 11139 ax-addass 11140 ax-mulass 11141 ax-distr 11142 ax-i2m1 11143 ax-1ne0 11144 ax-1rid 11145 ax-rnegex 11146 ax-rrecex 11147 ax-cnre 11148 ax-pre-lttri 11149 ax-pre-lttrn 11150 ax-pre-ltadd 11151 ax-pre-mulgt0 11152 ax-pre-sup 11153 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2533 df-eu 2562 df-clab 2709 df-cleq 2723 df-clel 2809 df-nfc 2884 df-ne 2940 df-nel 3046 df-ral 3061 df-rex 3070 df-rmo 3364 df-reu 3365 df-rab 3419 df-v 3461 df-sbc 3758 df-csb 3874 df-dif 3931 df-un 3933 df-in 3935 df-ss 3945 df-pss 3947 df-nul 4303 df-if 4507 df-pw 4582 df-sn 4607 df-pr 4609 df-op 4613 df-uni 4886 df-iun 4976 df-br 5126 df-opab 5188 df-mpt 5209 df-tr 5243 df-id 5551 df-eprel 5557 df-po 5565 df-so 5566 df-fr 5608 df-we 5610 df-xp 5659 df-rel 5660 df-cnv 5661 df-co 5662 df-dm 5663 df-rn 5664 df-res 5665 df-ima 5666 df-pred 6273 df-ord 6340 df-on 6341 df-lim 6342 df-suc 6343 df-iota 6468 df-fun 6518 df-fn 6519 df-f 6520 df-f1 6521 df-fo 6522 df-f1o 6523 df-fv 6524 df-riota 7333 df-ov 7380 df-oprab 7381 df-mpo 7382 df-om 7823 df-2nd 7942 df-frecs 8232 df-wrecs 8263 df-recs 8337 df-rdg 8376 df-er 8670 df-en 8906 df-dom 8907 df-sdom 8908 df-sup 9402 df-inf 9403 df-pnf 11215 df-mnf 11216 df-xr 11217 df-ltxr 11218 df-le 11219 df-sub 11411 df-neg 11412 df-div 11837 df-nn 12178 df-2 12240 df-3 12241 df-n0 12438 df-z 12524 df-uz 12788 df-rp 12940 df-fl 13722 df-mod 13800 df-seq 13932 df-exp 13993 df-cj 15011 df-re 15012 df-im 15013 df-sqrt 15147 df-abs 15148 df-dvds 16163 df-gcd 16401 |
This theorem is referenced by: dvdsexpnn0 40918 fltdvdsabdvdsc 41067 fltaccoprm 41069 |
Copyright terms: Public domain | W3C validator |