Metamath Proof Explorer


Theorem cxprec

Description: Complex exponentiation of a reciprocal. (Contributed by Mario Carneiro, 2-Aug-2014)

Ref Expression
Assertion cxprec ⊢ A ∈ ℝ + ∧ B ∈ ℂ → 1 A B = 1 A B

Proof

Step Hyp Ref Expression
1 rpcn ⊢ A ∈ ℝ + → A ∈ ℂ
2 cxpcl ⊢ A ∈ ℂ ∧ B ∈ ℂ → A B ∈ ℂ
3 1 2 sylan ⊢ A ∈ ℝ + ∧ B ∈ ℂ → A B ∈ ℂ
4 rpreccl ⊢ A ∈ ℝ + → 1 A ∈ ℝ +
5 4 rpcnd ⊢ A ∈ ℝ + → 1 A ∈ ℂ
6 cxpcl ⊢ 1 A ∈ ℂ ∧ B ∈ ℂ → 1 A B ∈ ℂ
7 5 6 sylan ⊢ A ∈ ℝ + ∧ B ∈ ℂ → 1 A B ∈ ℂ
8 1 adantr ⊢ A ∈ ℝ + ∧ B ∈ ℂ → A ∈ ℂ
9 rpne0 ⊢ A ∈ ℝ + → A ≠ 0
10 9 adantr ⊢ A ∈ ℝ + ∧ B ∈ ℂ → A ≠ 0
11 simpr ⊢ A ∈ ℝ + ∧ B ∈ ℂ → B ∈ ℂ
12 cxpne0 ⊢ A ∈ ℂ ∧ A ≠ 0 ∧ B ∈ ℂ → A B ≠ 0
13 8 10 11 12 syl3anc ⊢ A ∈ ℝ + ∧ B ∈ ℂ → A B ≠ 0
14 8 10 recidd ⊢ A ∈ ℝ + ∧ B ∈ ℂ → A ⁢ 1 A = 1
15 14 oveq1d ⊢ A ∈ ℝ + ∧ B ∈ ℂ → A ⁢ 1 A B = 1 B
16 rprege0 ⊢ A ∈ ℝ + → A ∈ ℝ ∧ 0 ≤ A
17 16 adantr ⊢ A ∈ ℝ + ∧ B ∈ ℂ → A ∈ ℝ ∧ 0 ≤ A
18 4 rprege0d ⊢ A ∈ ℝ + → 1 A ∈ ℝ ∧ 0 ≤ 1 A
19 18 adantr ⊢ A ∈ ℝ + ∧ B ∈ ℂ → 1 A ∈ ℝ ∧ 0 ≤ 1 A
20 mulcxp ⊢ A ∈ ℝ ∧ 0 ≤ A ∧ 1 A ∈ ℝ ∧ 0 ≤ 1 A ∧ B ∈ ℂ → A ⁢ 1 A B = A B ⁢ 1 A B
21 17 19 11 20 syl3anc ⊢ A ∈ ℝ + ∧ B ∈ ℂ → A ⁢ 1 A B = A B ⁢ 1 A B
22 1cxp ⊢ B ∈ ℂ → 1 B = 1
23 11 22 syl ⊢ A ∈ ℝ + ∧ B ∈ ℂ → 1 B = 1
24 15 21 23 3eqtr3d ⊢ A ∈ ℝ + ∧ B ∈ ℂ → A B ⁢ 1 A B = 1
25 3 7 13 24 mvllmuld ⊢ A ∈ ℝ + ∧ B ∈ ℂ → 1 A B = 1 A B