Metamath Proof Explorer


Theorem mulexpz

Description: Integer exponentiation of a product. Proposition 10-4.2(c) of Gleason p. 135. (Contributed by Mario Carneiro, 4-Jun-2014)

Ref Expression
Assertion mulexpz ⊢ A ∈ ℂ ∧ A ≠ 0 ∧ B ∈ ℂ ∧ B ≠ 0 ∧ N ∈ ℤ → A ⁢ B N = A N ⁢ B N

Proof

Step Hyp Ref Expression
1 elznn0nn ⊢ N ∈ ℤ ↔ N ∈ ℕ 0 ∨ N ∈ ℝ ∧ − N ∈ ℕ
2 simpl ⊢ A ∈ ℂ ∧ A ≠ 0 → A ∈ ℂ
3 simpl ⊢ B ∈ ℂ ∧ B ≠ 0 → B ∈ ℂ
4 2 3 anim12i ⊢ A ∈ ℂ ∧ A ≠ 0 ∧ B ∈ ℂ ∧ B ≠ 0 → A ∈ ℂ ∧ B ∈ ℂ
5 mulexp ⊢ A ∈ ℂ ∧ B ∈ ℂ ∧ N ∈ ℕ 0 → A ⁢ B N = A N ⁢ B N
6 5 3expa ⊢ A ∈ ℂ ∧ B ∈ ℂ ∧ N ∈ ℕ 0 → A ⁢ B N = A N ⁢ B N
7 4 6 sylan ⊢ A ∈ ℂ ∧ A ≠ 0 ∧ B ∈ ℂ ∧ B ≠ 0 ∧ N ∈ ℕ 0 → A ⁢ B N = A N ⁢ B N
8 simplll ⊢ A ∈ ℂ ∧ A ≠ 0 ∧ B ∈ ℂ ∧ B ≠ 0 ∧ N ∈ ℝ ∧ − N ∈ ℕ → A ∈ ℂ
9 simplrl ⊢ A ∈ ℂ ∧ A ≠ 0 ∧ B ∈ ℂ ∧ B ≠ 0 ∧ N ∈ ℝ ∧ − N ∈ ℕ → B ∈ ℂ
10 8 9 mulcld ⊢ A ∈ ℂ ∧ A ≠ 0 ∧ B ∈ ℂ ∧ B ≠ 0 ∧ N ∈ ℝ ∧ − N ∈ ℕ → A ⁢ B ∈ ℂ
11 recn ⊢ N ∈ ℝ → N ∈ ℂ
12 11 ad2antrl ⊢ A ∈ ℂ ∧ A ≠ 0 ∧ B ∈ ℂ ∧ B ≠ 0 ∧ N ∈ ℝ ∧ − N ∈ ℕ → N ∈ ℂ
13 nnnn0 ⊢ − N ∈ ℕ → − N ∈ ℕ 0
14 13 ad2antll ⊢ A ∈ ℂ ∧ A ≠ 0 ∧ B ∈ ℂ ∧ B ≠ 0 ∧ N ∈ ℝ ∧ − N ∈ ℕ → − N ∈ ℕ 0
15 expneg2 ⊢ A ⁢ B ∈ ℂ ∧ N ∈ ℂ ∧ − N ∈ ℕ 0 → A ⁢ B N = 1 A ⁢ B − N
16 10 12 14 15 syl3anc ⊢ A ∈ ℂ ∧ A ≠ 0 ∧ B ∈ ℂ ∧ B ≠ 0 ∧ N ∈ ℝ ∧ − N ∈ ℕ → A ⁢ B N = 1 A ⁢ B − N
17 expneg2 ⊢ A ∈ ℂ ∧ N ∈ ℂ ∧ − N ∈ ℕ 0 → A N = 1 A − N
18 8 12 14 17 syl3anc ⊢ A ∈ ℂ ∧ A ≠ 0 ∧ B ∈ ℂ ∧ B ≠ 0 ∧ N ∈ ℝ ∧ − N ∈ ℕ → A N = 1 A − N
19 expneg2 ⊢ B ∈ ℂ ∧ N ∈ ℂ ∧ − N ∈ ℕ 0 → B N = 1 B − N
20 9 12 14 19 syl3anc ⊢ A ∈ ℂ ∧ A ≠ 0 ∧ B ∈ ℂ ∧ B ≠ 0 ∧ N ∈ ℝ ∧ − N ∈ ℕ → B N = 1 B − N
21 18 20 oveq12d ⊢ A ∈ ℂ ∧ A ≠ 0 ∧ B ∈ ℂ ∧ B ≠ 0 ∧ N ∈ ℝ ∧ − N ∈ ℕ → A N ⁢ B N = 1 A − N ⁢ 1 B − N
22 mulexp ⊢ A ∈ ℂ ∧ B ∈ ℂ ∧ − N ∈ ℕ 0 → A ⁢ B − N = A − N ⁢ B − N
23 8 9 14 22 syl3anc ⊢ A ∈ ℂ ∧ A ≠ 0 ∧ B ∈ ℂ ∧ B ≠ 0 ∧ N ∈ ℝ ∧ − N ∈ ℕ → A ⁢ B − N = A − N ⁢ B − N
24 23 oveq2d ⊢ A ∈ ℂ ∧ A ≠ 0 ∧ B ∈ ℂ ∧ B ≠ 0 ∧ N ∈ ℝ ∧ − N ∈ ℕ → 1 A ⁢ B − N = 1 A − N ⁢ B − N
25 1t1e1 ⊢ 1 ⋅ 1 = 1
26 25 oveq1i ⊢ 1 ⋅ 1 A − N ⁢ B − N = 1 A − N ⁢ B − N
27 24 26 eqtr4di ⊢ A ∈ ℂ ∧ A ≠ 0 ∧ B ∈ ℂ ∧ B ≠ 0 ∧ N ∈ ℝ ∧ − N ∈ ℕ → 1 A ⁢ B − N = 1 ⋅ 1 A − N ⁢ B − N
28 expcl ⊢ A ∈ ℂ ∧ − N ∈ ℕ 0 → A − N ∈ ℂ
29 8 14 28 syl2anc ⊢ A ∈ ℂ ∧ A ≠ 0 ∧ B ∈ ℂ ∧ B ≠ 0 ∧ N ∈ ℝ ∧ − N ∈ ℕ → A − N ∈ ℂ
30 simpllr ⊢ A ∈ ℂ ∧ A ≠ 0 ∧ B ∈ ℂ ∧ B ≠ 0 ∧ N ∈ ℝ ∧ − N ∈ ℕ → A ≠ 0
31 nnz ⊢ − N ∈ ℕ → − N ∈ ℤ
32 31 ad2antll ⊢ A ∈ ℂ ∧ A ≠ 0 ∧ B ∈ ℂ ∧ B ≠ 0 ∧ N ∈ ℝ ∧ − N ∈ ℕ → − N ∈ ℤ
33 expne0i ⊢ A ∈ ℂ ∧ A ≠ 0 ∧ − N ∈ ℤ → A − N ≠ 0
34 8 30 32 33 syl3anc ⊢ A ∈ ℂ ∧ A ≠ 0 ∧ B ∈ ℂ ∧ B ≠ 0 ∧ N ∈ ℝ ∧ − N ∈ ℕ → A − N ≠ 0
35 expcl ⊢ B ∈ ℂ ∧ − N ∈ ℕ 0 → B − N ∈ ℂ
36 9 14 35 syl2anc ⊢ A ∈ ℂ ∧ A ≠ 0 ∧ B ∈ ℂ ∧ B ≠ 0 ∧ N ∈ ℝ ∧ − N ∈ ℕ → B − N ∈ ℂ
37 simplrr ⊢ A ∈ ℂ ∧ A ≠ 0 ∧ B ∈ ℂ ∧ B ≠ 0 ∧ N ∈ ℝ ∧ − N ∈ ℕ → B ≠ 0
38 expne0i ⊢ B ∈ ℂ ∧ B ≠ 0 ∧ − N ∈ ℤ → B − N ≠ 0
39 9 37 32 38 syl3anc ⊢ A ∈ ℂ ∧ A ≠ 0 ∧ B ∈ ℂ ∧ B ≠ 0 ∧ N ∈ ℝ ∧ − N ∈ ℕ → B − N ≠ 0
40 ax-1cn ⊢ 1 ∈ ℂ
41 divmuldiv ⊢ 1 ∈ ℂ ∧ 1 ∈ ℂ ∧ A − N ∈ ℂ ∧ A − N ≠ 0 ∧ B − N ∈ ℂ ∧ B − N ≠ 0 → 1 A − N ⁢ 1 B − N = 1 ⋅ 1 A − N ⁢ B − N
42 40 40 41 mpanl12 ⊢ A − N ∈ ℂ ∧ A − N ≠ 0 ∧ B − N ∈ ℂ ∧ B − N ≠ 0 → 1 A − N ⁢ 1 B − N = 1 ⋅ 1 A − N ⁢ B − N
43 29 34 36 39 42 syl22anc ⊢ A ∈ ℂ ∧ A ≠ 0 ∧ B ∈ ℂ ∧ B ≠ 0 ∧ N ∈ ℝ ∧ − N ∈ ℕ → 1 A − N ⁢ 1 B − N = 1 ⋅ 1 A − N ⁢ B − N
44 27 43 eqtr4d ⊢ A ∈ ℂ ∧ A ≠ 0 ∧ B ∈ ℂ ∧ B ≠ 0 ∧ N ∈ ℝ ∧ − N ∈ ℕ → 1 A ⁢ B − N = 1 A − N ⁢ 1 B − N
45 21 44 eqtr4d ⊢ A ∈ ℂ ∧ A ≠ 0 ∧ B ∈ ℂ ∧ B ≠ 0 ∧ N ∈ ℝ ∧ − N ∈ ℕ → A N ⁢ B N = 1 A ⁢ B − N
46 16 45 eqtr4d ⊢ A ∈ ℂ ∧ A ≠ 0 ∧ B ∈ ℂ ∧ B ≠ 0 ∧ N ∈ ℝ ∧ − N ∈ ℕ → A ⁢ B N = A N ⁢ B N
47 7 46 jaodan ⊢ A ∈ ℂ ∧ A ≠ 0 ∧ B ∈ ℂ ∧ B ≠ 0 ∧ N ∈ ℕ 0 ∨ N ∈ ℝ ∧ − N ∈ ℕ → A ⁢ B N = A N ⁢ B N
48 1 47 sylan2b ⊢ A ∈ ℂ ∧ A ≠ 0 ∧ B ∈ ℂ ∧ B ≠ 0 ∧ N ∈ ℤ → A ⁢ B N = A N ⁢ B N
49 48 3impa ⊢ A ∈ ℂ ∧ A ≠ 0 ∧ B ∈ ℂ ∧ B ≠ 0 ∧ N ∈ ℤ → A ⁢ B N = A N ⁢ B N