Metamath Proof Explorer


Theorem oexpnegnz

Description: The exponential of the negative of a number not being 0, when the exponent is odd. (Contributed by AV, 19-Jun-2020)

Ref Expression
Assertion oexpnegnz ⊢ A ∈ ℂ ∧ A ≠ 0 ∧ N ∈ Odd → − A N = − A N

Proof

Step Hyp Ref Expression
1 oddz ⊢ N ∈ Odd → N ∈ ℤ
2 odd2np1ALTV ⊢ N ∈ ℤ → N ∈ Odd ↔ ∃ n ∈ ℤ 2 ⁢ n + 1 = N
3 1 2 syl ⊢ N ∈ Odd → N ∈ Odd ↔ ∃ n ∈ ℤ 2 ⁢ n + 1 = N
4 3 biimpd ⊢ N ∈ Odd → N ∈ Odd → ∃ n ∈ ℤ 2 ⁢ n + 1 = N
5 4 pm2.43i ⊢ N ∈ Odd → ∃ n ∈ ℤ 2 ⁢ n + 1 = N
6 5 3ad2ant3 ⊢ A ∈ ℂ ∧ A ≠ 0 ∧ N ∈ Odd → ∃ n ∈ ℤ 2 ⁢ n + 1 = N
7 simpl1 ⊢ A ∈ ℂ ∧ A ≠ 0 ∧ N ∈ Odd ∧ n ∈ ℤ ∧ 2 ⁢ n + 1 = N → A ∈ ℂ
8 simpl2 ⊢ A ∈ ℂ ∧ A ≠ 0 ∧ N ∈ Odd ∧ n ∈ ℤ ∧ 2 ⁢ n + 1 = N → A ≠ 0
9 2z ⊢ 2 ∈ ℤ
10 simprl ⊢ A ∈ ℂ ∧ A ≠ 0 ∧ N ∈ Odd ∧ n ∈ ℤ ∧ 2 ⁢ n + 1 = N → n ∈ ℤ
11 zmulcl ⊢ 2 ∈ ℤ ∧ n ∈ ℤ → 2 ⁢ n ∈ ℤ
12 9 10 11 sylancr ⊢ A ∈ ℂ ∧ A ≠ 0 ∧ N ∈ Odd ∧ n ∈ ℤ ∧ 2 ⁢ n + 1 = N → 2 ⁢ n ∈ ℤ
13 7 8 12 expclzd ⊢ A ∈ ℂ ∧ A ≠ 0 ∧ N ∈ Odd ∧ n ∈ ℤ ∧ 2 ⁢ n + 1 = N → A 2 ⁢ n ∈ ℂ
14 13 7 mulneg2d ⊢ A ∈ ℂ ∧ A ≠ 0 ∧ N ∈ Odd ∧ n ∈ ℤ ∧ 2 ⁢ n + 1 = N → A 2 ⁢ n ⁢ − A = − A 2 ⁢ n ⁢ A
15 sqneg ⊢ A ∈ ℂ → − A 2 = A 2
16 7 15 syl ⊢ A ∈ ℂ ∧ A ≠ 0 ∧ N ∈ Odd ∧ n ∈ ℤ ∧ 2 ⁢ n + 1 = N → − A 2 = A 2
17 16 oveq1d ⊢ A ∈ ℂ ∧ A ≠ 0 ∧ N ∈ Odd ∧ n ∈ ℤ ∧ 2 ⁢ n + 1 = N → − A 2 n = A 2 n
18 7 negcld ⊢ A ∈ ℂ ∧ A ≠ 0 ∧ N ∈ Odd ∧ n ∈ ℤ ∧ 2 ⁢ n + 1 = N → − A ∈ ℂ
19 7 8 negne0d ⊢ A ∈ ℂ ∧ A ≠ 0 ∧ N ∈ Odd ∧ n ∈ ℤ ∧ 2 ⁢ n + 1 = N → − A ≠ 0
20 9 a1i ⊢ n ∈ ℤ ∧ 2 ⁢ n + 1 = N → 2 ∈ ℤ
21 simpl ⊢ n ∈ ℤ ∧ 2 ⁢ n + 1 = N → n ∈ ℤ
22 20 21 jca ⊢ n ∈ ℤ ∧ 2 ⁢ n + 1 = N → 2 ∈ ℤ ∧ n ∈ ℤ
23 22 adantl ⊢ A ∈ ℂ ∧ A ≠ 0 ∧ N ∈ Odd ∧ n ∈ ℤ ∧ 2 ⁢ n + 1 = N → 2 ∈ ℤ ∧ n ∈ ℤ
24 18 19 23 jca31 ⊢ A ∈ ℂ ∧ A ≠ 0 ∧ N ∈ Odd ∧ n ∈ ℤ ∧ 2 ⁢ n + 1 = N → − A ∈ ℂ ∧ − A ≠ 0 ∧ 2 ∈ ℤ ∧ n ∈ ℤ
25 expmulz ⊢ − A ∈ ℂ ∧ − A ≠ 0 ∧ 2 ∈ ℤ ∧ n ∈ ℤ → − A 2 ⁢ n = − A 2 n
26 24 25 syl ⊢ A ∈ ℂ ∧ A ≠ 0 ∧ N ∈ Odd ∧ n ∈ ℤ ∧ 2 ⁢ n + 1 = N → − A 2 ⁢ n = − A 2 n
27 7 8 23 jca31 ⊢ A ∈ ℂ ∧ A ≠ 0 ∧ N ∈ Odd ∧ n ∈ ℤ ∧ 2 ⁢ n + 1 = N → A ∈ ℂ ∧ A ≠ 0 ∧ 2 ∈ ℤ ∧ n ∈ ℤ
28 expmulz ⊢ A ∈ ℂ ∧ A ≠ 0 ∧ 2 ∈ ℤ ∧ n ∈ ℤ → A 2 ⁢ n = A 2 n
29 27 28 syl ⊢ A ∈ ℂ ∧ A ≠ 0 ∧ N ∈ Odd ∧ n ∈ ℤ ∧ 2 ⁢ n + 1 = N → A 2 ⁢ n = A 2 n
30 17 26 29 3eqtr4d ⊢ A ∈ ℂ ∧ A ≠ 0 ∧ N ∈ Odd ∧ n ∈ ℤ ∧ 2 ⁢ n + 1 = N → − A 2 ⁢ n = A 2 ⁢ n
31 30 oveq1d ⊢ A ∈ ℂ ∧ A ≠ 0 ∧ N ∈ Odd ∧ n ∈ ℤ ∧ 2 ⁢ n + 1 = N → − A 2 ⁢ n ⁢ − A = A 2 ⁢ n ⁢ − A
32 18 19 12 expp1zd ⊢ A ∈ ℂ ∧ A ≠ 0 ∧ N ∈ Odd ∧ n ∈ ℤ ∧ 2 ⁢ n + 1 = N → − A 2 ⁢ n + 1 = − A 2 ⁢ n ⁢ − A
33 simprr ⊢ A ∈ ℂ ∧ A ≠ 0 ∧ N ∈ Odd ∧ n ∈ ℤ ∧ 2 ⁢ n + 1 = N → 2 ⁢ n + 1 = N
34 33 oveq2d ⊢ A ∈ ℂ ∧ A ≠ 0 ∧ N ∈ Odd ∧ n ∈ ℤ ∧ 2 ⁢ n + 1 = N → − A 2 ⁢ n + 1 = − A N
35 32 34 eqtr3d ⊢ A ∈ ℂ ∧ A ≠ 0 ∧ N ∈ Odd ∧ n ∈ ℤ ∧ 2 ⁢ n + 1 = N → − A 2 ⁢ n ⁢ − A = − A N
36 31 35 eqtr3d ⊢ A ∈ ℂ ∧ A ≠ 0 ∧ N ∈ Odd ∧ n ∈ ℤ ∧ 2 ⁢ n + 1 = N → A 2 ⁢ n ⁢ − A = − A N
37 14 36 eqtr3d ⊢ A ∈ ℂ ∧ A ≠ 0 ∧ N ∈ Odd ∧ n ∈ ℤ ∧ 2 ⁢ n + 1 = N → − A 2 ⁢ n ⁢ A = − A N
38 7 8 12 expp1zd ⊢ A ∈ ℂ ∧ A ≠ 0 ∧ N ∈ Odd ∧ n ∈ ℤ ∧ 2 ⁢ n + 1 = N → A 2 ⁢ n + 1 = A 2 ⁢ n ⁢ A
39 33 oveq2d ⊢ A ∈ ℂ ∧ A ≠ 0 ∧ N ∈ Odd ∧ n ∈ ℤ ∧ 2 ⁢ n + 1 = N → A 2 ⁢ n + 1 = A N
40 38 39 eqtr3d ⊢ A ∈ ℂ ∧ A ≠ 0 ∧ N ∈ Odd ∧ n ∈ ℤ ∧ 2 ⁢ n + 1 = N → A 2 ⁢ n ⁢ A = A N
41 40 negeqd ⊢ A ∈ ℂ ∧ A ≠ 0 ∧ N ∈ Odd ∧ n ∈ ℤ ∧ 2 ⁢ n + 1 = N → − A 2 ⁢ n ⁢ A = − A N
42 37 41 eqtr3d ⊢ A ∈ ℂ ∧ A ≠ 0 ∧ N ∈ Odd ∧ n ∈ ℤ ∧ 2 ⁢ n + 1 = N → − A N = − A N
43 6 42 rexlimddv ⊢ A ∈ ℂ ∧ A ≠ 0 ∧ N ∈ Odd → − A N = − A N