Metamath Proof Explorer


Theorem expgcd

Description: Exponentiation distributes over gcd. sqgcd extended to nonnegative exponents. (Contributed by Steven Nguyen, 4-Apr-2023)

Ref Expression
Assertion expgcd ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ N ∈ ℕ 0 → A gcd B N = A N gcd B N

Proof

Step Hyp Ref Expression
1 gcdnncl ⊢ A ∈ ℕ ∧ B ∈ ℕ → A gcd B ∈ ℕ
2 1 3adant3 ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ N ∈ ℕ 0 → A gcd B ∈ ℕ
3 simp3 ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ N ∈ ℕ 0 → N ∈ ℕ 0
4 2 3 nnexpcld ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ N ∈ ℕ 0 → A gcd B N ∈ ℕ
5 4 nncnd ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ N ∈ ℕ 0 → A gcd B N ∈ ℂ
6 5 mulridd ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ N ∈ ℕ 0 → A gcd B N ⋅ 1 = A gcd B N
7 nnexpcl ⊢ A ∈ ℕ ∧ N ∈ ℕ 0 → A N ∈ ℕ
8 7 3adant2 ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ N ∈ ℕ 0 → A N ∈ ℕ
9 8 nnzd ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ N ∈ ℕ 0 → A N ∈ ℤ
10 nnexpcl ⊢ B ∈ ℕ ∧ N ∈ ℕ 0 → B N ∈ ℕ
11 10 3adant1 ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ N ∈ ℕ 0 → B N ∈ ℕ
12 11 nnzd ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ N ∈ ℕ 0 → B N ∈ ℤ
13 simpl ⊢ A ∈ ℕ ∧ B ∈ ℕ → A ∈ ℕ
14 13 nnzd ⊢ A ∈ ℕ ∧ B ∈ ℕ → A ∈ ℤ
15 simpr ⊢ A ∈ ℕ ∧ B ∈ ℕ → B ∈ ℕ
16 15 nnzd ⊢ A ∈ ℕ ∧ B ∈ ℕ → B ∈ ℤ
17 gcddvds ⊢ A ∈ ℤ ∧ B ∈ ℤ → A gcd B ∥ A ∧ A gcd B ∥ B
18 14 16 17 syl2anc ⊢ A ∈ ℕ ∧ B ∈ ℕ → A gcd B ∥ A ∧ A gcd B ∥ B
19 18 3adant3 ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ N ∈ ℕ 0 → A gcd B ∥ A ∧ A gcd B ∥ B
20 19 simpld ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ N ∈ ℕ 0 → A gcd B ∥ A
21 2 nnzd ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ N ∈ ℕ 0 → A gcd B ∈ ℤ
22 simp1 ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ N ∈ ℕ 0 → A ∈ ℕ
23 22 nnzd ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ N ∈ ℕ 0 → A ∈ ℤ
24 dvdsexpim ⊢ A gcd B ∈ ℤ ∧ A ∈ ℤ ∧ N ∈ ℕ 0 → A gcd B ∥ A → A gcd B N ∥ A N
25 21 23 3 24 syl3anc ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ N ∈ ℕ 0 → A gcd B ∥ A → A gcd B N ∥ A N
26 20 25 mpd ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ N ∈ ℕ 0 → A gcd B N ∥ A N
27 19 simprd ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ N ∈ ℕ 0 → A gcd B ∥ B
28 simp2 ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ N ∈ ℕ 0 → B ∈ ℕ
29 28 nnzd ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ N ∈ ℕ 0 → B ∈ ℤ
30 dvdsexpim ⊢ A gcd B ∈ ℤ ∧ B ∈ ℤ ∧ N ∈ ℕ 0 → A gcd B ∥ B → A gcd B N ∥ B N
31 21 29 3 30 syl3anc ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ N ∈ ℕ 0 → A gcd B ∥ B → A gcd B N ∥ B N
32 27 31 mpd ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ N ∈ ℕ 0 → A gcd B N ∥ B N
33 gcddiv ⊢ A N ∈ ℤ ∧ B N ∈ ℤ ∧ A gcd B N ∈ ℕ ∧ A gcd B N ∥ A N ∧ A gcd B N ∥ B N → A N gcd B N A gcd B N = A N A gcd B N gcd B N A gcd B N
34 9 12 4 26 32 33 syl32anc ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ N ∈ ℕ 0 → A N gcd B N A gcd B N = A N A gcd B N gcd B N A gcd B N
35 nncn ⊢ A ∈ ℕ → A ∈ ℂ
36 35 3ad2ant1 ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ N ∈ ℕ 0 → A ∈ ℂ
37 2 nncnd ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ N ∈ ℕ 0 → A gcd B ∈ ℂ
38 2 nnne0d ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ N ∈ ℕ 0 → A gcd B ≠ 0
39 36 37 38 3 expdivd ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ N ∈ ℕ 0 → A A gcd B N = A N A gcd B N
40 nncn ⊢ B ∈ ℕ → B ∈ ℂ
41 40 3ad2ant2 ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ N ∈ ℕ 0 → B ∈ ℂ
42 41 37 38 3 expdivd ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ N ∈ ℕ 0 → B A gcd B N = B N A gcd B N
43 39 42 oveq12d ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ N ∈ ℕ 0 → A A gcd B N gcd B A gcd B N = A N A gcd B N gcd B N A gcd B N
44 gcddiv ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ A gcd B ∈ ℕ ∧ A gcd B ∥ A ∧ A gcd B ∥ B → A gcd B A gcd B = A A gcd B gcd B A gcd B
45 23 29 2 19 44 syl31anc ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ N ∈ ℕ 0 → A gcd B A gcd B = A A gcd B gcd B A gcd B
46 37 38 dividd ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ N ∈ ℕ 0 → A gcd B A gcd B = 1
47 45 46 eqtr3d ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ N ∈ ℕ 0 → A A gcd B gcd B A gcd B = 1
48 divgcdnn ⊢ A ∈ ℕ ∧ B ∈ ℤ → A A gcd B ∈ ℕ
49 22 29 48 syl2anc ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ N ∈ ℕ 0 → A A gcd B ∈ ℕ
50 49 nnnn0d ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ N ∈ ℕ 0 → A A gcd B ∈ ℕ 0
51 divgcdnnr ⊢ B ∈ ℕ ∧ A ∈ ℤ → B A gcd B ∈ ℕ
52 28 23 51 syl2anc ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ N ∈ ℕ 0 → B A gcd B ∈ ℕ
53 52 nnnn0d ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ N ∈ ℕ 0 → B A gcd B ∈ ℕ 0
54 nn0rppwr ⊢ A A gcd B ∈ ℕ 0 ∧ B A gcd B ∈ ℕ 0 ∧ N ∈ ℕ 0 → A A gcd B gcd B A gcd B = 1 → A A gcd B N gcd B A gcd B N = 1
55 50 53 3 54 syl3anc ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ N ∈ ℕ 0 → A A gcd B gcd B A gcd B = 1 → A A gcd B N gcd B A gcd B N = 1
56 47 55 mpd ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ N ∈ ℕ 0 → A A gcd B N gcd B A gcd B N = 1
57 34 43 56 3eqtr2d ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ N ∈ ℕ 0 → A N gcd B N A gcd B N = 1
58 gcdnncl ⊢ A N ∈ ℕ ∧ B N ∈ ℕ → A N gcd B N ∈ ℕ
59 58 nncnd ⊢ A N ∈ ℕ ∧ B N ∈ ℕ → A N gcd B N ∈ ℂ
60 8 11 59 syl2anc ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ N ∈ ℕ 0 → A N gcd B N ∈ ℂ
61 4 nnne0d ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ N ∈ ℕ 0 → A gcd B N ≠ 0
62 ax-1cn ⊢ 1 ∈ ℂ
63 divmul ⊢ A N gcd B N ∈ ℂ ∧ 1 ∈ ℂ ∧ A gcd B N ∈ ℂ ∧ A gcd B N ≠ 0 → A N gcd B N A gcd B N = 1 ↔ A gcd B N ⋅ 1 = A N gcd B N
64 62 63 mp3an2 ⊢ A N gcd B N ∈ ℂ ∧ A gcd B N ∈ ℂ ∧ A gcd B N ≠ 0 → A N gcd B N A gcd B N = 1 ↔ A gcd B N ⋅ 1 = A N gcd B N
65 60 5 61 64 syl12anc ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ N ∈ ℕ 0 → A N gcd B N A gcd B N = 1 ↔ A gcd B N ⋅ 1 = A N gcd B N
66 57 65 mpbid ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ N ∈ ℕ 0 → A gcd B N ⋅ 1 = A N gcd B N
67 6 66 eqtr3d ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ N ∈ ℕ 0 → A gcd B N = A N gcd B N