mulcxp - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > mulcxp		Structured version Visualization version GIF version

Theorem mulcxp 26808

Description: Complex exponentiation of a product. Proposition 10-4.2(c) of [Gleason] p. 135. (Contributed by Mario Carneiro, 2-Aug-2014.)

**Assertion**
Ref	Expression
mulcxp	⊢ (((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) → ((𝐴 · 𝐵)↑_𝑐𝐶) = ((𝐴↑_𝑐𝐶) · (𝐵↑_𝑐𝐶)))

**Proof of Theorem mulcxp**
Step	Hyp	Ref	Expression
1		simp1l 1214	. . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) → 𝐴 ∈ ℝ)
2	1	recnd 11225	. . . . . 6 ⊢ (((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) → 𝐴 ∈ ℂ)
3	2	mul01d 11397	. . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) → (𝐴 · 0) = 0)
4	3	oveq1d 7415	. . . 4 ⊢ (((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) → ((𝐴 · 0)↑_𝑐𝐶) = (0↑_𝑐𝐶))
5		simp3 1154	. . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) → 𝐶 ∈ ℂ)
6	2, 5	mulcxplem 26807	. . . 4 ⊢ (((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) → (0↑_𝑐𝐶) = ((𝐴↑_𝑐𝐶) · (0↑_𝑐𝐶)))
7	4, 6	eqtrd 2800	. . 3 ⊢ (((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) → ((𝐴 · 0)↑_𝑐𝐶) = ((𝐴↑_𝑐𝐶) · (0↑_𝑐𝐶)))
8		oveq2 7408	. . . . 5 ⊢ (𝐵 = 0 → (𝐴 · 𝐵) = (𝐴 · 0))
9	8	oveq1d 7415	. . . 4 ⊢ (𝐵 = 0 → ((𝐴 · 𝐵)↑_𝑐𝐶) = ((𝐴 · 0)↑_𝑐𝐶))
10		oveq1 7407	. . . . 5 ⊢ (𝐵 = 0 → (𝐵↑_𝑐𝐶) = (0↑_𝑐𝐶))
11	10	oveq2d 7416	. . . 4 ⊢ (𝐵 = 0 → ((𝐴↑_𝑐𝐶) · (𝐵↑_𝑐𝐶)) = ((𝐴↑_𝑐𝐶) · (0↑_𝑐𝐶)))
12	9, 11	eqeq12d 2781	. . 3 ⊢ (𝐵 = 0 → (((𝐴 · 𝐵)↑_𝑐𝐶) = ((𝐴↑_𝑐𝐶) · (𝐵↑_𝑐𝐶)) ↔ ((𝐴 · 0)↑_𝑐𝐶) = ((𝐴↑_𝑐𝐶) · (0↑_𝑐𝐶))))
13	7, 12	syl5ibrcom 250	. 2 ⊢ (((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) → (𝐵 = 0 → ((𝐴 · 𝐵)↑_𝑐𝐶) = ((𝐴↑_𝑐𝐶) · (𝐵↑_𝑐𝐶))))
14		simp2l 1216	. . . . . . . . 9 ⊢ (((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) → 𝐵 ∈ ℝ)
15	14	recnd 11225	. . . . . . . 8 ⊢ (((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) → 𝐵 ∈ ℂ)
16	15	mul02d 11396	. . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) → (0 · 𝐵) = 0)
17	16	oveq1d 7415	. . . . . 6 ⊢ (((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) → ((0 · 𝐵)↑_𝑐𝐶) = (0↑_𝑐𝐶))
18	15, 5	mulcxplem 26807	. . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) → (0↑_𝑐𝐶) = ((𝐵↑_𝑐𝐶) · (0↑_𝑐𝐶)))
19		cxpcl 26797	. . . . . . . . 9 ⊢ ((𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝐵↑_𝑐𝐶) ∈ ℂ)
20	15, 5, 19	syl2anc 595	. . . . . . . 8 ⊢ (((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) → (𝐵↑_𝑐𝐶) ∈ ℂ)
21		0cn 11186	. . . . . . . . 9 ⊢ 0 ∈ ℂ
22		cxpcl 26797	. . . . . . . . 9 ⊢ ((0 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (0↑_𝑐𝐶) ∈ ℂ)
23	21, 5, 22	sylancr 598	. . . . . . . 8 ⊢ (((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) → (0↑_𝑐𝐶) ∈ ℂ)
24	20, 23	mulcomd 11218	. . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) → ((𝐵↑_𝑐𝐶) · (0↑_𝑐𝐶)) = ((0↑_𝑐𝐶) · (𝐵↑_𝑐𝐶)))
25	18, 24	eqtrd 2800	. . . . . 6 ⊢ (((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) → (0↑_𝑐𝐶) = ((0↑_𝑐𝐶) · (𝐵↑_𝑐𝐶)))
26	17, 25	eqtrd 2800	. . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) → ((0 · 𝐵)↑_𝑐𝐶) = ((0↑_𝑐𝐶) · (𝐵↑_𝑐𝐶)))
27		oveq1 7407	. . . . . . 7 ⊢ (𝐴 = 0 → (𝐴 · 𝐵) = (0 · 𝐵))
28	27	oveq1d 7415	. . . . . 6 ⊢ (𝐴 = 0 → ((𝐴 · 𝐵)↑_𝑐𝐶) = ((0 · 𝐵)↑_𝑐𝐶))
29		oveq1 7407	. . . . . . 7 ⊢ (𝐴 = 0 → (𝐴↑_𝑐𝐶) = (0↑_𝑐𝐶))
30	29	oveq1d 7415	. . . . . 6 ⊢ (𝐴 = 0 → ((𝐴↑_𝑐𝐶) · (𝐵↑_𝑐𝐶)) = ((0↑_𝑐𝐶) · (𝐵↑_𝑐𝐶)))
31	28, 30	eqeq12d 2781	. . . . 5 ⊢ (𝐴 = 0 → (((𝐴 · 𝐵)↑_𝑐𝐶) = ((𝐴↑_𝑐𝐶) · (𝐵↑_𝑐𝐶)) ↔ ((0 · 𝐵)↑_𝑐𝐶) = ((0↑_𝑐𝐶) · (𝐵↑_𝑐𝐶))))
32	26, 31	syl5ibrcom 250	. . . 4 ⊢ (((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) → (𝐴 = 0 → ((𝐴 · 𝐵)↑_𝑐𝐶) = ((𝐴↑_𝑐𝐶) · (𝐵↑_𝑐𝐶))))
33	32	a1dd 51	. . 3 ⊢ (((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) → (𝐴 = 0 → (𝐵 ≠ 0 → ((𝐴 · 𝐵)↑_𝑐𝐶) = ((𝐴↑_𝑐𝐶) · (𝐵↑_𝑐𝐶)))))
34	1	adantr 485	. . . . . . . . . . 11 ⊢ ((((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) ∧ (𝐴 ≠ 0 ∧ 𝐵 ≠ 0)) → 𝐴 ∈ ℝ)
35		simpl1r 1242	. . . . . . . . . . . 12 ⊢ ((((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) ∧ (𝐴 ≠ 0 ∧ 𝐵 ≠ 0)) → 0 ≤ 𝐴)
36		simprl 782	. . . . . . . . . . . 12 ⊢ ((((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) ∧ (𝐴 ≠ 0 ∧ 𝐵 ≠ 0)) → 𝐴 ≠ 0)
37	34, 35, 36	ne0gt0d 11335	. . . . . . . . . . 11 ⊢ ((((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) ∧ (𝐴 ≠ 0 ∧ 𝐵 ≠ 0)) → 0 < 𝐴)
38	34, 37	elrpd 13048	. . . . . . . . . 10 ⊢ ((((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) ∧ (𝐴 ≠ 0 ∧ 𝐵 ≠ 0)) → 𝐴 ∈ ℝ⁺)
39	14	adantr 485	. . . . . . . . . . 11 ⊢ ((((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) ∧ (𝐴 ≠ 0 ∧ 𝐵 ≠ 0)) → 𝐵 ∈ ℝ)
40		simpl2r 1244	. . . . . . . . . . . 12 ⊢ ((((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) ∧ (𝐴 ≠ 0 ∧ 𝐵 ≠ 0)) → 0 ≤ 𝐵)
41		simprr 784	. . . . . . . . . . . 12 ⊢ ((((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) ∧ (𝐴 ≠ 0 ∧ 𝐵 ≠ 0)) → 𝐵 ≠ 0)
42	39, 40, 41	ne0gt0d 11335	. . . . . . . . . . 11 ⊢ ((((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) ∧ (𝐴 ≠ 0 ∧ 𝐵 ≠ 0)) → 0 < 𝐵)
43	39, 42	elrpd 13048	. . . . . . . . . 10 ⊢ ((((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) ∧ (𝐴 ≠ 0 ∧ 𝐵 ≠ 0)) → 𝐵 ∈ ℝ⁺)
44	38, 43	relogmuld 26748	. . . . . . . . 9 ⊢ ((((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) ∧ (𝐴 ≠ 0 ∧ 𝐵 ≠ 0)) → (log‘(𝐴 · 𝐵)) = ((log‘𝐴) + (log‘𝐵)))
45	44	oveq2d 7416	. . . . . . . 8 ⊢ ((((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) ∧ (𝐴 ≠ 0 ∧ 𝐵 ≠ 0)) → (𝐶 · (log‘(𝐴 · 𝐵))) = (𝐶 · ((log‘𝐴) + (log‘𝐵))))
46	5	adantr 485	. . . . . . . . 9 ⊢ ((((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) ∧ (𝐴 ≠ 0 ∧ 𝐵 ≠ 0)) → 𝐶 ∈ ℂ)
47	2	adantr 485	. . . . . . . . . 10 ⊢ ((((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) ∧ (𝐴 ≠ 0 ∧ 𝐵 ≠ 0)) → 𝐴 ∈ ℂ)
48	47, 36	logcld 26693	. . . . . . . . 9 ⊢ ((((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) ∧ (𝐴 ≠ 0 ∧ 𝐵 ≠ 0)) → (log‘𝐴) ∈ ℂ)
49	15	adantr 485	. . . . . . . . . 10 ⊢ ((((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) ∧ (𝐴 ≠ 0 ∧ 𝐵 ≠ 0)) → 𝐵 ∈ ℂ)
50	49, 41	logcld 26693	. . . . . . . . 9 ⊢ ((((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) ∧ (𝐴 ≠ 0 ∧ 𝐵 ≠ 0)) → (log‘𝐵) ∈ ℂ)
51	46, 48, 50	adddid 11221	. . . . . . . 8 ⊢ ((((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) ∧ (𝐴 ≠ 0 ∧ 𝐵 ≠ 0)) → (𝐶 · ((log‘𝐴) + (log‘𝐵))) = ((𝐶 · (log‘𝐴)) + (𝐶 · (log‘𝐵))))
52	45, 51	eqtrd 2800	. . . . . . 7 ⊢ ((((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) ∧ (𝐴 ≠ 0 ∧ 𝐵 ≠ 0)) → (𝐶 · (log‘(𝐴 · 𝐵))) = ((𝐶 · (log‘𝐴)) + (𝐶 · (log‘𝐵))))
53	52	fveq2d 6875	. . . . . 6 ⊢ ((((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) ∧ (𝐴 ≠ 0 ∧ 𝐵 ≠ 0)) → (exp‘(𝐶 · (log‘(𝐴 · 𝐵)))) = (exp‘((𝐶 · (log‘𝐴)) + (𝐶 · (log‘𝐵)))))
54	46, 48	mulcld 11217	. . . . . . 7 ⊢ ((((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) ∧ (𝐴 ≠ 0 ∧ 𝐵 ≠ 0)) → (𝐶 · (log‘𝐴)) ∈ ℂ)
55	46, 50	mulcld 11217	. . . . . . 7 ⊢ ((((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) ∧ (𝐴 ≠ 0 ∧ 𝐵 ≠ 0)) → (𝐶 · (log‘𝐵)) ∈ ℂ)
56		efadd 16138	. . . . . . 7 ⊢ (((𝐶 · (log‘𝐴)) ∈ ℂ ∧ (𝐶 · (log‘𝐵)) ∈ ℂ) → (exp‘((𝐶 · (log‘𝐴)) + (𝐶 · (log‘𝐵)))) = ((exp‘(𝐶 · (log‘𝐴))) · (exp‘(𝐶 · (log‘𝐵)))))
57	54, 55, 56	syl2anc 595	. . . . . 6 ⊢ ((((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) ∧ (𝐴 ≠ 0 ∧ 𝐵 ≠ 0)) → (exp‘((𝐶 · (log‘𝐴)) + (𝐶 · (log‘𝐵)))) = ((exp‘(𝐶 · (log‘𝐴))) · (exp‘(𝐶 · (log‘𝐵)))))
58	53, 57	eqtrd 2800	. . . . 5 ⊢ ((((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) ∧ (𝐴 ≠ 0 ∧ 𝐵 ≠ 0)) → (exp‘(𝐶 · (log‘(𝐴 · 𝐵)))) = ((exp‘(𝐶 · (log‘𝐴))) · (exp‘(𝐶 · (log‘𝐵)))))
59	47, 49	mulcld 11217	. . . . . 6 ⊢ ((((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) ∧ (𝐴 ≠ 0 ∧ 𝐵 ≠ 0)) → (𝐴 · 𝐵) ∈ ℂ)
60	47, 49, 36, 41	mulne0d 11854	. . . . . 6 ⊢ ((((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) ∧ (𝐴 ≠ 0 ∧ 𝐵 ≠ 0)) → (𝐴 · 𝐵) ≠ 0)
61		cxpef 26788	. . . . . 6 ⊢ (((𝐴 · 𝐵) ∈ ℂ ∧ (𝐴 · 𝐵) ≠ 0 ∧ 𝐶 ∈ ℂ) → ((𝐴 · 𝐵)↑_𝑐𝐶) = (exp‘(𝐶 · (log‘(𝐴 · 𝐵)))))
62	59, 60, 46, 61	syl3anc 1394	. . . . 5 ⊢ ((((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) ∧ (𝐴 ≠ 0 ∧ 𝐵 ≠ 0)) → ((𝐴 · 𝐵)↑_𝑐𝐶) = (exp‘(𝐶 · (log‘(𝐴 · 𝐵)))))
63		cxpef 26788	. . . . . . 7 ⊢ ((𝐴 ∈ ℂ ∧ 𝐴 ≠ 0 ∧ 𝐶 ∈ ℂ) → (𝐴↑_𝑐𝐶) = (exp‘(𝐶 · (log‘𝐴))))
64	47, 36, 46, 63	syl3anc 1394	. . . . . 6 ⊢ ((((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) ∧ (𝐴 ≠ 0 ∧ 𝐵 ≠ 0)) → (𝐴↑_𝑐𝐶) = (exp‘(𝐶 · (log‘𝐴))))
65		cxpef 26788	. . . . . . 7 ⊢ ((𝐵 ∈ ℂ ∧ 𝐵 ≠ 0 ∧ 𝐶 ∈ ℂ) → (𝐵↑_𝑐𝐶) = (exp‘(𝐶 · (log‘𝐵))))
66	49, 41, 46, 65	syl3anc 1394	. . . . . 6 ⊢ ((((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) ∧ (𝐴 ≠ 0 ∧ 𝐵 ≠ 0)) → (𝐵↑_𝑐𝐶) = (exp‘(𝐶 · (log‘𝐵))))
67	64, 66	oveq12d 7418	. . . . 5 ⊢ ((((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) ∧ (𝐴 ≠ 0 ∧ 𝐵 ≠ 0)) → ((𝐴↑_𝑐𝐶) · (𝐵↑_𝑐𝐶)) = ((exp‘(𝐶 · (log‘𝐴))) · (exp‘(𝐶 · (log‘𝐵)))))
68	58, 62, 67	3eqtr4d 2810	. . . 4 ⊢ ((((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) ∧ (𝐴 ≠ 0 ∧ 𝐵 ≠ 0)) → ((𝐴 · 𝐵)↑_𝑐𝐶) = ((𝐴↑_𝑐𝐶) · (𝐵↑_𝑐𝐶)))
69	68	exp32 425	. . 3 ⊢ (((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) → (𝐴 ≠ 0 → (𝐵 ≠ 0 → ((𝐴 · 𝐵)↑_𝑐𝐶) = ((𝐴↑_𝑐𝐶) · (𝐵↑_𝑐𝐶)))))
70	33, 69	pm2.61dne 3046	. 2 ⊢ (((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) → (𝐵 ≠ 0 → ((𝐴 · 𝐵)↑_𝑐𝐶) = ((𝐴↑_𝑐𝐶) · (𝐵↑_𝑐𝐶))))
71	13, 70	pm2.61dne 3046	1 ⊢ (((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) → ((𝐴 · 𝐵)↑_𝑐𝐶) = ((𝐴↑_𝑐𝐶) · (𝐵↑_𝑐𝐶)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 400 ∧ w3a 1101 = wceq 1563 ∈ wcel 2145 ≠ wne 2960 class class class wbr 5105 ‘cfv 6525 (class class class)co 7400 ℂcc 11086 ℝcr 11087 0cc0 11088 + caddc 11091 · cmul 11093 ≤ cle 11232 expce 16105 logclog 26677 ↑_𝑐ccxp 26678

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2737 ax-rep 5232 ax-sep 5251 ax-nul 5261 ax-pow 5327 ax-pr 5395 ax-un 7722 ax-inf2 9598 ax-cnex 11144 ax-resscn 11145 ax-1cn 11146 ax-icn 11147 ax-addcl 11148 ax-addrcl 11149 ax-mulcl 11150 ax-mulrcl 11151 ax-mulcom 11152 ax-addass 11153 ax-mulass 11154 ax-distr 11155 ax-i2m1 11156 ax-1ne0 11157 ax-1rid 11158 ax-rnegex 11159 ax-rrecex 11160 ax-cnre 11161 ax-pre-lttri 11162 ax-pre-lttrn 11163 ax-pre-ltadd 11164 ax-pre-mulgt0 11165 ax-pre-sup 11166 ax-addf 11167

This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1566 df-fal 1576 df-ex 1803 df-nf 1807 df-sb 2094 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3065 df-ral 3080 df-rex 3090 df-rmo 3370 df-reu 3371 df-rab 3418 df-v 3459 df-sbc 3748 df-csb 3856 df-dif 3910 df-un 3912 df-in 3914 df-ss 3924 df-pss 3927 df-nul 4289 df-if 4484 df-pw 4560 df-sn 4586 df-pr 4588 df-tp 4590 df-op 4592 df-uni 4869 df-int 4909 df-iun 4954 df-iin 4955 df-br 5106 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5547 df-eprel 5552 df-po 5560 df-so 5561 df-fr 5605 df-se 5606 df-we 5607 df-xp 5658 df-rel 5659 df-cnv 5660 df-co 5661 df-dm 5662 df-rn 5663 df-res 5664 df-ima 5665 df-pred 6292 df-ord 6353 df-on 6354 df-lim 6355 df-suc 6356 df-iota 6481 df-fun 6527 df-fn 6528 df-f 6529 df-f1 6530 df-fo 6531 df-f1o 6532 df-fv 6533 df-isom 6534 df-riota 7357 df-ov 7403 df-oprab 7404 df-mpo 7405 df-of 7664 df-om 7851 df-1st 7974 df-2nd 7975 df-supp 8145 df-frecs 8266 df-wrecs 8297 df-recs 8346 df-rdg 8385 df-1o 8441 df-2o 8442 df-er 8682 df-map 8814 df-pm 8815 df-ixp 8884 df-en 8932 df-dom 8933 df-sdom 8934 df-fin 8935 df-fsupp 9310 df-fi 9359 df-sup 9390 df-inf 9391 df-oi 9460 df-card 9913 df-pnf 11233 df-mnf 11234 df-xr 11235 df-ltxr 11236 df-le 11237 df-sub 11431 df-neg 11432 df-div 11860 df-nn 12225 df-2 12294 df-3 12295 df-4 12296 df-5 12297 df-6 12298 df-7 12299 df-8 12300 df-9 12301 df-n0 12496 df-z 12583 df-dec 12703 df-uz 12854 df-q 12964 df-rp 13008 df-xneg 13128 df-xadd 13129 df-xmul 13130 df-ioo 13367 df-ioc 13368 df-ico 13369 df-icc 13370 df-fz 13527 df-fzo 13674 df-fl 13816 df-mod 13894 df-seq 14029 df-exp 14089 df-fac 14301 df-bc 14330 df-hash 14358 df-shft 15094 df-cj 15140 df-re 15141 df-im 15142 df-sqrt 15276 df-abs 15277 df-limsup 15512 df-clim 15529 df-rlim 15530 df-sum 15728 df-ef 16111 df-sin 16113 df-cos 16114 df-pi 16116 df-struct 17197 df-sets 17214 df-slot 17232 df-ndx 17244 df-base 17260 df-ress 17281 df-plusg 17313 df-mulr 17314 df-starv 17315 df-sca 17316 df-vsca 17317 df-ip 17318 df-tset 17319 df-ple 17320 df-ds 17322 df-unif 17323 df-hom 17324 df-cco 17325 df-rest 17465 df-topn 17466 df-0g 17484 df-gsum 17485 df-topgen 17486 df-pt 17487 df-prds 17490 df-xrs 17546 df-qtop 17551 df-imas 17552 df-xps 17554 df-mre 17628 df-mrc 17629 df-acs 17631 df-mgm 18688 df-sgrp 18767 df-mnd 18783 df-submnd 18832 df-mulg 19125 df-cntz 19378 df-cmn 19843 df-psmet 21474 df-xmet 21475 df-met 21476 df-bl 21477 df-mopn 21478 df-fbas 21479 df-fg 21480 df-cnfld 21483 df-top 23012 df-topon 23029 df-topsp 23051 df-bases 23064 df-cld 23137 df-ntr 23138 df-cls 23139 df-nei 23216 df-lp 23254 df-perf 23255 df-cn 23345 df-cnp 23346 df-haus 23433 df-tx 23680 df-hmeo 23873 df-fil 23964 df-fm 24056 df-flim 24057 df-flf 24058 df-xms 24438 df-ms 24439 df-tms 24440 df-cncf 24998 df-limc 25986 df-dv 25987 df-log 26679 df-cxp 26680

This theorem is referenced by: cxprec 26809 divcxp 26810 mulcxpd 26851 amgmlemALT 50432

W3C validator