Theorem nn0expgcd 16611

Description: Exponentiation distributes over GCD. nn0gcdsq 16799 extended to nonnegative exponents. expgcd 16610 extended to nonnegative bases. (Contributed by Steven Nguyen, 5-Apr-2023.)

Assertion

Ref	Expression
nn0expgcd	⊢ ((𝐴 ∈ ℕ0 ∧ 𝐵 ∈ ℕ0 ∧ 𝑁 ∈ ℕ0) → ((𝐴 gcd 𝐵)↑𝑁) = ((𝐴↑𝑁) gcd (𝐵↑𝑁)))

Proof of Theorem nn0expgcd

Step	Hyp	Ref	Expression
1		elnn0 12555	. . 3 ⊢ (𝐴 ∈ ℕ0 ↔ (𝐴 ∈ ℕ ∨ 𝐴 = 0))
2		elnn0 12555	. . 3 ⊢ (𝐵 ∈ ℕ0 ↔ (𝐵 ∈ ℕ ∨ 𝐵 = 0))
3		expgcd 16610	. . . . 5 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ0) → ((𝐴 gcd 𝐵)↑𝑁) = ((𝐴↑𝑁) gcd (𝐵↑𝑁)))
4	3	3expia 1121	. . . 4 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → (𝑁 ∈ ℕ0 → ((𝐴 gcd 𝐵)↑𝑁) = ((𝐴↑𝑁) gcd (𝐵↑𝑁))))
5		elnn0 12555	. . . . 5 ⊢ (𝑁 ∈ ℕ0 ↔ (𝑁 ∈ ℕ ∨ 𝑁 = 0))
6		0exp 14148	. . . . . . . . . . 11 ⊢ (𝑁 ∈ ℕ → (0↑𝑁) = 0)
7	6	3ad2ant3 1135	. . . . . . . . . 10 ⊢ ((𝐴 = 0 ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ) → (0↑𝑁) = 0)
8	7	oveq1d 7463	. . . . . . . . 9 ⊢ ((𝐴 = 0 ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ) → ((0↑𝑁) gcd (𝐵↑𝑁)) = (0 gcd (𝐵↑𝑁)))
9		simp2 1137	. . . . . . . . . . . 12 ⊢ ((𝐴 = 0 ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ) → 𝐵 ∈ ℕ)
10		nnnn0 12560	. . . . . . . . . . . . 13 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℕ0)
11	10	3ad2ant3 1135	. . . . . . . . . . . 12 ⊢ ((𝐴 = 0 ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ) → 𝑁 ∈ ℕ0)
12	9, 11	nnexpcld 14294	. . . . . . . . . . 11 ⊢ ((𝐴 = 0 ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ) → (𝐵↑𝑁) ∈ ℕ)
13	12	nnzd 12666	. . . . . . . . . 10 ⊢ ((𝐴 = 0 ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ) → (𝐵↑𝑁) ∈ ℤ)
14		gcd0id 16565	. . . . . . . . . 10 ⊢ ((𝐵↑𝑁) ∈ ℤ → (0 gcd (𝐵↑𝑁)) = (abs‘(𝐵↑𝑁)))
15	13, 14	syl 17	. . . . . . . . 9 ⊢ ((𝐴 = 0 ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ) → (0 gcd (𝐵↑𝑁)) = (abs‘(𝐵↑𝑁)))
16	12	nnred 12308	. . . . . . . . . 10 ⊢ ((𝐴 = 0 ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ) → (𝐵↑𝑁) ∈ ℝ)
17		0red 11293	. . . . . . . . . . 11 ⊢ ((𝐴 = 0 ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ) → 0 ∈ ℝ)
18	12	nngt0d 12342	. . . . . . . . . . 11 ⊢ ((𝐴 = 0 ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ) → 0 < (𝐵↑𝑁))
19	17, 16, 18	ltled 11438	. . . . . . . . . 10 ⊢ ((𝐴 = 0 ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ) → 0 ≤ (𝐵↑𝑁))
20	16, 19	absidd 15471	. . . . . . . . 9 ⊢ ((𝐴 = 0 ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ) → (abs‘(𝐵↑𝑁)) = (𝐵↑𝑁))
21	8, 15, 20	3eqtrrd 2785	. . . . . . . 8 ⊢ ((𝐴 = 0 ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ) → (𝐵↑𝑁) = ((0↑𝑁) gcd (𝐵↑𝑁)))
22		oveq1 7455	. . . . . . . . . . 11 ⊢ (𝐴 = 0 → (𝐴 gcd 𝐵) = (0 gcd 𝐵))
23	22	3ad2ant1 1133	. . . . . . . . . 10 ⊢ ((𝐴 = 0 ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ) → (𝐴 gcd 𝐵) = (0 gcd 𝐵))
24		nnz 12660	. . . . . . . . . . . 12 ⊢ (𝐵 ∈ ℕ → 𝐵 ∈ ℤ)
25	24	3ad2ant2 1134	. . . . . . . . . . 11 ⊢ ((𝐴 = 0 ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ) → 𝐵 ∈ ℤ)
26		gcd0id 16565	. . . . . . . . . . 11 ⊢ (𝐵 ∈ ℤ → (0 gcd 𝐵) = (abs‘𝐵))
27	25, 26	syl 17	. . . . . . . . . 10 ⊢ ((𝐴 = 0 ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ) → (0 gcd 𝐵) = (abs‘𝐵))
28		nnre 12300	. . . . . . . . . . . 12 ⊢ (𝐵 ∈ ℕ → 𝐵 ∈ ℝ)
29		0red 11293	. . . . . . . . . . . . 13 ⊢ (𝐵 ∈ ℕ → 0 ∈ ℝ)
30		nngt0 12324	. . . . . . . . . . . . 13 ⊢ (𝐵 ∈ ℕ → 0 < 𝐵)
31	29, 28, 30	ltled 11438	. . . . . . . . . . . 12 ⊢ (𝐵 ∈ ℕ → 0 ≤ 𝐵)
32	28, 31	absidd 15471	. . . . . . . . . . 11 ⊢ (𝐵 ∈ ℕ → (abs‘𝐵) = 𝐵)
33	32	3ad2ant2 1134	. . . . . . . . . 10 ⊢ ((𝐴 = 0 ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ) → (abs‘𝐵) = 𝐵)
34	23, 27, 33	3eqtrd 2784	. . . . . . . . 9 ⊢ ((𝐴 = 0 ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ) → (𝐴 gcd 𝐵) = 𝐵)
35	34	oveq1d 7463	. . . . . . . 8 ⊢ ((𝐴 = 0 ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ) → ((𝐴 gcd 𝐵)↑𝑁) = (𝐵↑𝑁))
36		oveq1 7455	. . . . . . . . . 10 ⊢ (𝐴 = 0 → (𝐴↑𝑁) = (0↑𝑁))
37	36	3ad2ant1 1133	. . . . . . . . 9 ⊢ ((𝐴 = 0 ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ) → (𝐴↑𝑁) = (0↑𝑁))
38	37	oveq1d 7463	. . . . . . . 8 ⊢ ((𝐴 = 0 ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ) → ((𝐴↑𝑁) gcd (𝐵↑𝑁)) = ((0↑𝑁) gcd (𝐵↑𝑁)))
39	21, 35, 38	3eqtr4d 2790	. . . . . . 7 ⊢ ((𝐴 = 0 ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ) → ((𝐴 gcd 𝐵)↑𝑁) = ((𝐴↑𝑁) gcd (𝐵↑𝑁)))
40	39	3expia 1121	. . . . . 6 ⊢ ((𝐴 = 0 ∧ 𝐵 ∈ ℕ) → (𝑁 ∈ ℕ → ((𝐴 gcd 𝐵)↑𝑁) = ((𝐴↑𝑁) gcd (𝐵↑𝑁))))
41		1z 12673	. . . . . . . . . 10 ⊢ 1 ∈ ℤ
42		gcd1 16574	. . . . . . . . . 10 ⊢ (1 ∈ ℤ → (1 gcd 1) = 1)
43	41, 42	ax-mp 5	. . . . . . . . 9 ⊢ (1 gcd 1) = 1
44	43	eqcomi 2749	. . . . . . . 8 ⊢ 1 = (1 gcd 1)
45		simp1 1136	. . . . . . . . . . . 12 ⊢ ((𝐴 = 0 ∧ 𝐵 ∈ ℕ ∧ 𝑁 = 0) → 𝐴 = 0)
46	45	oveq1d 7463	. . . . . . . . . . 11 ⊢ ((𝐴 = 0 ∧ 𝐵 ∈ ℕ ∧ 𝑁 = 0) → (𝐴 gcd 𝐵) = (0 gcd 𝐵))
47		simp2 1137	. . . . . . . . . . . . 13 ⊢ ((𝐴 = 0 ∧ 𝐵 ∈ ℕ ∧ 𝑁 = 0) → 𝐵 ∈ ℕ)
48	47	nnzd 12666	. . . . . . . . . . . 12 ⊢ ((𝐴 = 0 ∧ 𝐵 ∈ ℕ ∧ 𝑁 = 0) → 𝐵 ∈ ℤ)
49	48, 26	syl 17	. . . . . . . . . . 11 ⊢ ((𝐴 = 0 ∧ 𝐵 ∈ ℕ ∧ 𝑁 = 0) → (0 gcd 𝐵) = (abs‘𝐵))
50	32	3ad2ant2 1134	. . . . . . . . . . 11 ⊢ ((𝐴 = 0 ∧ 𝐵 ∈ ℕ ∧ 𝑁 = 0) → (abs‘𝐵) = 𝐵)
51	46, 49, 50	3eqtrd 2784	. . . . . . . . . 10 ⊢ ((𝐴 = 0 ∧ 𝐵 ∈ ℕ ∧ 𝑁 = 0) → (𝐴 gcd 𝐵) = 𝐵)
52		simp3 1138	. . . . . . . . . 10 ⊢ ((𝐴 = 0 ∧ 𝐵 ∈ ℕ ∧ 𝑁 = 0) → 𝑁 = 0)
53	51, 52	oveq12d 7466	. . . . . . . . 9 ⊢ ((𝐴 = 0 ∧ 𝐵 ∈ ℕ ∧ 𝑁 = 0) → ((𝐴 gcd 𝐵)↑𝑁) = (𝐵↑0))
54	47	nncnd 12309	. . . . . . . . . 10 ⊢ ((𝐴 = 0 ∧ 𝐵 ∈ ℕ ∧ 𝑁 = 0) → 𝐵 ∈ ℂ)
55	54	exp0d 14190	. . . . . . . . 9 ⊢ ((𝐴 = 0 ∧ 𝐵 ∈ ℕ ∧ 𝑁 = 0) → (𝐵↑0) = 1)
56	53, 55	eqtrd 2780	. . . . . . . 8 ⊢ ((𝐴 = 0 ∧ 𝐵 ∈ ℕ ∧ 𝑁 = 0) → ((𝐴 gcd 𝐵)↑𝑁) = 1)
57	45, 52	oveq12d 7466	. . . . . . . . . 10 ⊢ ((𝐴 = 0 ∧ 𝐵 ∈ ℕ ∧ 𝑁 = 0) → (𝐴↑𝑁) = (0↑0))
58		0exp0e1 14117	. . . . . . . . . . 11 ⊢ (0↑0) = 1
59	58	a1i 11	. . . . . . . . . 10 ⊢ ((𝐴 = 0 ∧ 𝐵 ∈ ℕ ∧ 𝑁 = 0) → (0↑0) = 1)
60	57, 59	eqtrd 2780	. . . . . . . . 9 ⊢ ((𝐴 = 0 ∧ 𝐵 ∈ ℕ ∧ 𝑁 = 0) → (𝐴↑𝑁) = 1)
61	52	oveq2d 7464	. . . . . . . . . 10 ⊢ ((𝐴 = 0 ∧ 𝐵 ∈ ℕ ∧ 𝑁 = 0) → (𝐵↑𝑁) = (𝐵↑0))
62	61, 55	eqtrd 2780	. . . . . . . . 9 ⊢ ((𝐴 = 0 ∧ 𝐵 ∈ ℕ ∧ 𝑁 = 0) → (𝐵↑𝑁) = 1)
63	60, 62	oveq12d 7466	. . . . . . . 8 ⊢ ((𝐴 = 0 ∧ 𝐵 ∈ ℕ ∧ 𝑁 = 0) → ((𝐴↑𝑁) gcd (𝐵↑𝑁)) = (1 gcd 1))
64	44, 56, 63	3eqtr4a 2806	. . . . . . 7 ⊢ ((𝐴 = 0 ∧ 𝐵 ∈ ℕ ∧ 𝑁 = 0) → ((𝐴 gcd 𝐵)↑𝑁) = ((𝐴↑𝑁) gcd (𝐵↑𝑁)))
65	64	3expia 1121	. . . . . 6 ⊢ ((𝐴 = 0 ∧ 𝐵 ∈ ℕ) → (𝑁 = 0 → ((𝐴 gcd 𝐵)↑𝑁) = ((𝐴↑𝑁) gcd (𝐵↑𝑁))))
66	40, 65	jaod 858	. . . . 5 ⊢ ((𝐴 = 0 ∧ 𝐵 ∈ ℕ) → ((𝑁 ∈ ℕ ∨ 𝑁 = 0) → ((𝐴 gcd 𝐵)↑𝑁) = ((𝐴↑𝑁) gcd (𝐵↑𝑁))))
67	5, 66	biimtrid 242	. . . 4 ⊢ ((𝐴 = 0 ∧ 𝐵 ∈ ℕ) → (𝑁 ∈ ℕ0 → ((𝐴 gcd 𝐵)↑𝑁) = ((𝐴↑𝑁) gcd (𝐵↑𝑁))))
68		nnnn0 12560	. . . . . . . . . . 11 ⊢ (𝐴 ∈ ℕ → 𝐴 ∈ ℕ0)
69	68	3ad2ant1 1133	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 = 0 ∧ 𝑁 ∈ ℕ) → 𝐴 ∈ ℕ0)
70	10	3ad2ant3 1135	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 = 0 ∧ 𝑁 ∈ ℕ) → 𝑁 ∈ ℕ0)
71	69, 70	nn0expcld 14295	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 = 0 ∧ 𝑁 ∈ ℕ) → (𝐴↑𝑁) ∈ ℕ0)
72		nn0gcdid0 16567	. . . . . . . . 9 ⊢ ((𝐴↑𝑁) ∈ ℕ0 → ((𝐴↑𝑁) gcd 0) = (𝐴↑𝑁))
73	71, 72	syl 17	. . . . . . . 8 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 = 0 ∧ 𝑁 ∈ ℕ) → ((𝐴↑𝑁) gcd 0) = (𝐴↑𝑁))
74		simp2 1137	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 = 0 ∧ 𝑁 ∈ ℕ) → 𝐵 = 0)
75	74	oveq1d 7463	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 = 0 ∧ 𝑁 ∈ ℕ) → (𝐵↑𝑁) = (0↑𝑁))
76	6	3ad2ant3 1135	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 = 0 ∧ 𝑁 ∈ ℕ) → (0↑𝑁) = 0)
77	75, 76	eqtrd 2780	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 = 0 ∧ 𝑁 ∈ ℕ) → (𝐵↑𝑁) = 0)
78	77	oveq2d 7464	. . . . . . . 8 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 = 0 ∧ 𝑁 ∈ ℕ) → ((𝐴↑𝑁) gcd (𝐵↑𝑁)) = ((𝐴↑𝑁) gcd 0))
79	74	oveq2d 7464	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 = 0 ∧ 𝑁 ∈ ℕ) → (𝐴 gcd 𝐵) = (𝐴 gcd 0))
80		nn0gcdid0 16567	. . . . . . . . . . . 12 ⊢ (𝐴 ∈ ℕ0 → (𝐴 gcd 0) = 𝐴)
81	68, 80	syl 17	. . . . . . . . . . 11 ⊢ (𝐴 ∈ ℕ → (𝐴 gcd 0) = 𝐴)
82	81	3ad2ant1 1133	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 = 0 ∧ 𝑁 ∈ ℕ) → (𝐴 gcd 0) = 𝐴)
83	79, 82	eqtrd 2780	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 = 0 ∧ 𝑁 ∈ ℕ) → (𝐴 gcd 𝐵) = 𝐴)
84	83	oveq1d 7463	. . . . . . . 8 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 = 0 ∧ 𝑁 ∈ ℕ) → ((𝐴 gcd 𝐵)↑𝑁) = (𝐴↑𝑁))
85	73, 78, 84	3eqtr4rd 2791	. . . . . . 7 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 = 0 ∧ 𝑁 ∈ ℕ) → ((𝐴 gcd 𝐵)↑𝑁) = ((𝐴↑𝑁) gcd (𝐵↑𝑁)))
86	85	3expia 1121	. . . . . 6 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 = 0) → (𝑁 ∈ ℕ → ((𝐴 gcd 𝐵)↑𝑁) = ((𝐴↑𝑁) gcd (𝐵↑𝑁))))
87		nncn 12301	. . . . . . . . . . . 12 ⊢ (𝐴 ∈ ℕ → 𝐴 ∈ ℂ)
88	87	exp0d 14190	. . . . . . . . . . 11 ⊢ (𝐴 ∈ ℕ → (𝐴↑0) = 1)
89	88, 43	eqtr4di 2798	. . . . . . . . . 10 ⊢ (𝐴 ∈ ℕ → (𝐴↑0) = (1 gcd 1))
90	81	oveq1d 7463	. . . . . . . . . 10 ⊢ (𝐴 ∈ ℕ → ((𝐴 gcd 0)↑0) = (𝐴↑0))
91	58	a1i 11	. . . . . . . . . . 11 ⊢ (𝐴 ∈ ℕ → (0↑0) = 1)
92	88, 91	oveq12d 7466	. . . . . . . . . 10 ⊢ (𝐴 ∈ ℕ → ((𝐴↑0) gcd (0↑0)) = (1 gcd 1))
93	89, 90, 92	3eqtr4d 2790	. . . . . . . . 9 ⊢ (𝐴 ∈ ℕ → ((𝐴 gcd 0)↑0) = ((𝐴↑0) gcd (0↑0)))
94	93	3ad2ant1 1133	. . . . . . . 8 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 = 0 ∧ 𝑁 = 0) → ((𝐴 gcd 0)↑0) = ((𝐴↑0) gcd (0↑0)))
95		simp2 1137	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 = 0 ∧ 𝑁 = 0) → 𝐵 = 0)
96	95	oveq2d 7464	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 = 0 ∧ 𝑁 = 0) → (𝐴 gcd 𝐵) = (𝐴 gcd 0))
97		simp3 1138	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 = 0 ∧ 𝑁 = 0) → 𝑁 = 0)
98	96, 97	oveq12d 7466	. . . . . . . 8 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 = 0 ∧ 𝑁 = 0) → ((𝐴 gcd 𝐵)↑𝑁) = ((𝐴 gcd 0)↑0))
99	97	oveq2d 7464	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 = 0 ∧ 𝑁 = 0) → (𝐴↑𝑁) = (𝐴↑0))
100	95, 97	oveq12d 7466	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 = 0 ∧ 𝑁 = 0) → (𝐵↑𝑁) = (0↑0))
101	99, 100	oveq12d 7466	. . . . . . . 8 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 = 0 ∧ 𝑁 = 0) → ((𝐴↑𝑁) gcd (𝐵↑𝑁)) = ((𝐴↑0) gcd (0↑0)))
102	94, 98, 101	3eqtr4d 2790	. . . . . . 7 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 = 0 ∧ 𝑁 = 0) → ((𝐴 gcd 𝐵)↑𝑁) = ((𝐴↑𝑁) gcd (𝐵↑𝑁)))
103	102	3expia 1121	. . . . . 6 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 = 0) → (𝑁 = 0 → ((𝐴 gcd 𝐵)↑𝑁) = ((𝐴↑𝑁) gcd (𝐵↑𝑁))))
104	86, 103	jaod 858	. . . . 5 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 = 0) → ((𝑁 ∈ ℕ ∨ 𝑁 = 0) → ((𝐴 gcd 𝐵)↑𝑁) = ((𝐴↑𝑁) gcd (𝐵↑𝑁))))
105	5, 104	biimtrid 242	. . . 4 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 = 0) → (𝑁 ∈ ℕ0 → ((𝐴 gcd 𝐵)↑𝑁) = ((𝐴↑𝑁) gcd (𝐵↑𝑁))))
106		gcd0val 16543	. . . . . . . . . . 11 ⊢ (0 gcd 0) = 0
107	6, 106	eqtr4di 2798	. . . . . . . . . 10 ⊢ (𝑁 ∈ ℕ → (0↑𝑁) = (0 gcd 0))
108	106	a1i 11	. . . . . . . . . . 11 ⊢ (𝑁 ∈ ℕ → (0 gcd 0) = 0)
109	108	oveq1d 7463	. . . . . . . . . 10 ⊢ (𝑁 ∈ ℕ → ((0 gcd 0)↑𝑁) = (0↑𝑁))
110	6, 6	oveq12d 7466	. . . . . . . . . 10 ⊢ (𝑁 ∈ ℕ → ((0↑𝑁) gcd (0↑𝑁)) = (0 gcd 0))
111	107, 109, 110	3eqtr4d 2790	. . . . . . . . 9 ⊢ (𝑁 ∈ ℕ → ((0 gcd 0)↑𝑁) = ((0↑𝑁) gcd (0↑𝑁)))
112	111	3ad2ant3 1135	. . . . . . . 8 ⊢ ((𝐴 = 0 ∧ 𝐵 = 0 ∧ 𝑁 ∈ ℕ) → ((0 gcd 0)↑𝑁) = ((0↑𝑁) gcd (0↑𝑁)))
113		simp1 1136	. . . . . . . . . 10 ⊢ ((𝐴 = 0 ∧ 𝐵 = 0 ∧ 𝑁 ∈ ℕ) → 𝐴 = 0)
114		simp2 1137	. . . . . . . . . 10 ⊢ ((𝐴 = 0 ∧ 𝐵 = 0 ∧ 𝑁 ∈ ℕ) → 𝐵 = 0)
115	113, 114	oveq12d 7466	. . . . . . . . 9 ⊢ ((𝐴 = 0 ∧ 𝐵 = 0 ∧ 𝑁 ∈ ℕ) → (𝐴 gcd 𝐵) = (0 gcd 0))
116	115	oveq1d 7463	. . . . . . . 8 ⊢ ((𝐴 = 0 ∧ 𝐵 = 0 ∧ 𝑁 ∈ ℕ) → ((𝐴 gcd 𝐵)↑𝑁) = ((0 gcd 0)↑𝑁))
117	113	oveq1d 7463	. . . . . . . . 9 ⊢ ((𝐴 = 0 ∧ 𝐵 = 0 ∧ 𝑁 ∈ ℕ) → (𝐴↑𝑁) = (0↑𝑁))
118	114	oveq1d 7463	. . . . . . . . 9 ⊢ ((𝐴 = 0 ∧ 𝐵 = 0 ∧ 𝑁 ∈ ℕ) → (𝐵↑𝑁) = (0↑𝑁))
119	117, 118	oveq12d 7466	. . . . . . . 8 ⊢ ((𝐴 = 0 ∧ 𝐵 = 0 ∧ 𝑁 ∈ ℕ) → ((𝐴↑𝑁) gcd (𝐵↑𝑁)) = ((0↑𝑁) gcd (0↑𝑁)))
120	112, 116, 119	3eqtr4d 2790	. . . . . . 7 ⊢ ((𝐴 = 0 ∧ 𝐵 = 0 ∧ 𝑁 ∈ ℕ) → ((𝐴 gcd 𝐵)↑𝑁) = ((𝐴↑𝑁) gcd (𝐵↑𝑁)))
121	120	3expia 1121	. . . . . 6 ⊢ ((𝐴 = 0 ∧ 𝐵 = 0) → (𝑁 ∈ ℕ → ((𝐴 gcd 𝐵)↑𝑁) = ((𝐴↑𝑁) gcd (𝐵↑𝑁))))
122	58, 43	eqtr4i 2771	. . . . . . . . 9 ⊢ (0↑0) = (1 gcd 1)
123	106	oveq1i 7458	. . . . . . . . 9 ⊢ ((0 gcd 0)↑0) = (0↑0)
124	58, 58	oveq12i 7460	. . . . . . . . 9 ⊢ ((0↑0) gcd (0↑0)) = (1 gcd 1)
125	122, 123, 124	3eqtr4i 2778	. . . . . . . 8 ⊢ ((0 gcd 0)↑0) = ((0↑0) gcd (0↑0))
126		simp1 1136	. . . . . . . . . 10 ⊢ ((𝐴 = 0 ∧ 𝐵 = 0 ∧ 𝑁 = 0) → 𝐴 = 0)
127		simp2 1137	. . . . . . . . . 10 ⊢ ((𝐴 = 0 ∧ 𝐵 = 0 ∧ 𝑁 = 0) → 𝐵 = 0)
128	126, 127	oveq12d 7466	. . . . . . . . 9 ⊢ ((𝐴 = 0 ∧ 𝐵 = 0 ∧ 𝑁 = 0) → (𝐴 gcd 𝐵) = (0 gcd 0))
129		simp3 1138	. . . . . . . . 9 ⊢ ((𝐴 = 0 ∧ 𝐵 = 0 ∧ 𝑁 = 0) → 𝑁 = 0)
130	128, 129	oveq12d 7466	. . . . . . . 8 ⊢ ((𝐴 = 0 ∧ 𝐵 = 0 ∧ 𝑁 = 0) → ((𝐴 gcd 𝐵)↑𝑁) = ((0 gcd 0)↑0))
131	126, 129	oveq12d 7466	. . . . . . . . 9 ⊢ ((𝐴 = 0 ∧ 𝐵 = 0 ∧ 𝑁 = 0) → (𝐴↑𝑁) = (0↑0))
132	127, 129	oveq12d 7466	. . . . . . . . 9 ⊢ ((𝐴 = 0 ∧ 𝐵 = 0 ∧ 𝑁 = 0) → (𝐵↑𝑁) = (0↑0))
133	131, 132	oveq12d 7466	. . . . . . . 8 ⊢ ((𝐴 = 0 ∧ 𝐵 = 0 ∧ 𝑁 = 0) → ((𝐴↑𝑁) gcd (𝐵↑𝑁)) = ((0↑0) gcd (0↑0)))
134	125, 130, 133	3eqtr4a 2806	. . . . . . 7 ⊢ ((𝐴 = 0 ∧ 𝐵 = 0 ∧ 𝑁 = 0) → ((𝐴 gcd 𝐵)↑𝑁) = ((𝐴↑𝑁) gcd (𝐵↑𝑁)))
135	134	3expia 1121	. . . . . 6 ⊢ ((𝐴 = 0 ∧ 𝐵 = 0) → (𝑁 = 0 → ((𝐴 gcd 𝐵)↑𝑁) = ((𝐴↑𝑁) gcd (𝐵↑𝑁))))
136	121, 135	jaod 858	. . . . 5 ⊢ ((𝐴 = 0 ∧ 𝐵 = 0) → ((𝑁 ∈ ℕ ∨ 𝑁 = 0) → ((𝐴 gcd 𝐵)↑𝑁) = ((𝐴↑𝑁) gcd (𝐵↑𝑁))))
137	5, 136	biimtrid 242	. . . 4 ⊢ ((𝐴 = 0 ∧ 𝐵 = 0) → (𝑁 ∈ ℕ0 → ((𝐴 gcd 𝐵)↑𝑁) = ((𝐴↑𝑁) gcd (𝐵↑𝑁))))
138	4, 67, 105, 137	ccase 1038	. . 3 ⊢ (((𝐴 ∈ ℕ ∨ 𝐴 = 0) ∧ (𝐵 ∈ ℕ ∨ 𝐵 = 0)) → (𝑁 ∈ ℕ0 → ((𝐴 gcd 𝐵)↑𝑁) = ((𝐴↑𝑁) gcd (𝐵↑𝑁))))
139	1, 2, 138	syl2anb 597	. 2 ⊢ ((𝐴 ∈ ℕ0 ∧ 𝐵 ∈ ℕ0) → (𝑁 ∈ ℕ0 → ((𝐴 gcd 𝐵)↑𝑁) = ((𝐴↑𝑁) gcd (𝐵↑𝑁))))
140	139	3impia 1117	1 ⊢ ((𝐴 ∈ ℕ0 ∧ 𝐵 ∈ ℕ0 ∧ 𝑁 ∈ ℕ0) → ((𝐴 gcd 𝐵)↑𝑁) = ((𝐴↑𝑁) gcd (𝐵↑𝑁)))

Syntax hints:   → wi 4   ∧ wa 395   ∨ wo 846   ∧ w3a 1087   = wceq 1537   ∈ wcel 2108  ‘cfv 6573  (class class class)co 7448  0cc0 11184  1c1 11185  ℕcn 12293  ℕ₀cn0 12553  ℤcz 12639  ↑cexp 14112  abscabs 15283   gcd cgcd 16540

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-sep 5317  ax-nul 5324  ax-pow 5383  ax-pr 5447  ax-un 7770  ax-cnex 11240  ax-resscn 11241  ax-1cn 11242  ax-icn 11243  ax-addcl 11244  ax-addrcl 11245  ax-mulcl 11246  ax-mulrcl 11247  ax-mulcom 11248  ax-addass 11249  ax-mulass 11250  ax-distr 11251  ax-i2m1 11252  ax-1ne0 11253  ax-1rid 11254  ax-rnegex 11255  ax-rrecex 11256  ax-cnre 11257  ax-pre-lttri 11258  ax-pre-lttrn 11259  ax-pre-ltadd 11260  ax-pre-mulgt0 11261  ax-pre-sup 11262

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3or 1088  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-nel 3053  df-ral 3068  df-rex 3077  df-rmo 3388  df-reu 3389  df-rab 3444  df-v 3490  df-sbc 3805  df-csb 3922  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-pss 3996  df-nul 4353  df-if 4549  df-pw 4624  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-iun 5017  df-br 5167  df-opab 5229  df-mpt 5250  df-tr 5284  df-id 5593  df-eprel 5599  df-po 5607  df-so 5608  df-fr 5652  df-we 5654  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-rn 5711  df-res 5712  df-ima 5713  df-pred 6332  df-ord 6398  df-on 6399  df-lim 6400  df-suc 6401  df-iota 6525  df-fun 6575  df-fn 6576  df-f 6577  df-f1 6578  df-fo 6579  df-f1o 6580  df-fv 6581  df-riota 7404  df-ov 7451  df-oprab 7452  df-mpo 7453  df-om 7904  df-2nd 8031  df-frecs 8322  df-wrecs 8353  df-recs 8427  df-rdg 8466  df-er 8763  df-en 9004  df-dom 9005  df-sdom 9006  df-sup 9511  df-inf 9512  df-pnf 11326  df-mnf 11327  df-xr 11328  df-ltxr 11329  df-le 11330  df-sub 11522  df-neg 11523  df-div 11948  df-nn 12294  df-2 12356  df-3 12357  df-n0 12554  df-z 12640  df-uz 12904  df-rp 13058  df-fl 13843  df-mod 13921  df-seq 14053  df-exp 14113  df-cj 15148  df-re 15149  df-im 15150  df-sqrt 15284  df-abs 15285  df-dvds 16303  df-gcd 16541

This theorem is referenced by:  zexpgcd  16612