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 26826

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 11236	. . . . . 6 ⊢ (((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) → 𝐴 ∈ ℂ)
3	2	mul01d 11408	. . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) → (𝐴 · 0) = 0)
4	3	oveq1d 7425	. . . 4 ⊢ (((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) → ((𝐴 · 0)↑_𝑐𝐶) = (0↑_𝑐𝐶))
5		simp3 1154	. . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) → 𝐶 ∈ ℂ)
6	2, 5	mulcxplem 26825	. . . 4 ⊢ (((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) → (0↑_𝑐𝐶) = ((𝐴↑_𝑐𝐶) · (0↑_𝑐𝐶)))
7	4, 6	eqtrd 2796	. . 3 ⊢ (((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) → ((𝐴 · 0)↑_𝑐𝐶) = ((𝐴↑_𝑐𝐶) · (0↑_𝑐𝐶)))
8		oveq2 7418	. . . . 5 ⊢ (𝐵 = 0 → (𝐴 · 𝐵) = (𝐴 · 0))
9	8	oveq1d 7425	. . . 4 ⊢ (𝐵 = 0 → ((𝐴 · 𝐵)↑_𝑐𝐶) = ((𝐴 · 0)↑_𝑐𝐶))
10		oveq1 7417	. . . . 5 ⊢ (𝐵 = 0 → (𝐵↑_𝑐𝐶) = (0↑_𝑐𝐶))
11	10	oveq2d 7426	. . . 4 ⊢ (𝐵 = 0 → ((𝐴↑_𝑐𝐶) · (𝐵↑_𝑐𝐶)) = ((𝐴↑_𝑐𝐶) · (0↑_𝑐𝐶)))
12	9, 11	eqeq12d 2777	. . 3 ⊢ (𝐵 = 0 → (((𝐴 · 𝐵)↑_𝑐𝐶) = ((𝐴↑_𝑐𝐶) · (𝐵↑_𝑐𝐶)) ↔ ((𝐴 · 0)↑_𝑐𝐶) = ((𝐴↑_𝑐𝐶) · (0↑_𝑐𝐶))))
13	7, 12	syl5ibrcom 250	. 2 ⊢ (((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) → (𝐵 = 0 → ((𝐴 · 𝐵)↑_𝑐𝐶) = ((𝐴↑_𝑐𝐶) · (𝐵↑_𝑐𝐶))))
14		simp2l 1216	. . . . . . . . 9 ⊢ (((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) → 𝐵 ∈ ℝ)
15	14	recnd 11236	. . . . . . . 8 ⊢ (((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) → 𝐵 ∈ ℂ)
16	15	mul02d 11407	. . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) → (0 · 𝐵) = 0)
17	16	oveq1d 7425	. . . . . 6 ⊢ (((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) → ((0 · 𝐵)↑_𝑐𝐶) = (0↑_𝑐𝐶))
18	15, 5	mulcxplem 26825	. . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) → (0↑_𝑐𝐶) = ((𝐵↑_𝑐𝐶) · (0↑_𝑐𝐶)))
19		cxpcl 26815	. . . . . . . . 9 ⊢ ((𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝐵↑_𝑐𝐶) ∈ ℂ)
20	15, 5, 19	syl2anc 595	. . . . . . . 8 ⊢ (((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) → (𝐵↑_𝑐𝐶) ∈ ℂ)
21		0cn 11197	. . . . . . . . 9 ⊢ 0 ∈ ℂ
22		cxpcl 26815	. . . . . . . . 9 ⊢ ((0 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (0↑_𝑐𝐶) ∈ ℂ)
23	21, 5, 22	sylancr 598	. . . . . . . 8 ⊢ (((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) → (0↑_𝑐𝐶) ∈ ℂ)
24	20, 23	mulcomd 11229	. . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) → ((𝐵↑_𝑐𝐶) · (0↑_𝑐𝐶)) = ((0↑_𝑐𝐶) · (𝐵↑_𝑐𝐶)))
25	18, 24	eqtrd 2796	. . . . . 6 ⊢ (((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) → (0↑_𝑐𝐶) = ((0↑_𝑐𝐶) · (𝐵↑_𝑐𝐶)))
26	17, 25	eqtrd 2796	. . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) → ((0 · 𝐵)↑_𝑐𝐶) = ((0↑_𝑐𝐶) · (𝐵↑_𝑐𝐶)))
27		oveq1 7417	. . . . . . 7 ⊢ (𝐴 = 0 → (𝐴 · 𝐵) = (0 · 𝐵))
28	27	oveq1d 7425	. . . . . 6 ⊢ (𝐴 = 0 → ((𝐴 · 𝐵)↑_𝑐𝐶) = ((0 · 𝐵)↑_𝑐𝐶))
29		oveq1 7417	. . . . . . 7 ⊢ (𝐴 = 0 → (𝐴↑_𝑐𝐶) = (0↑_𝑐𝐶))
30	29	oveq1d 7425	. . . . . 6 ⊢ (𝐴 = 0 → ((𝐴↑_𝑐𝐶) · (𝐵↑_𝑐𝐶)) = ((0↑_𝑐𝐶) · (𝐵↑_𝑐𝐶)))
31	28, 30	eqeq12d 2777	. . . . 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 11346	. . . . . . . . . . 11 ⊢ ((((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) ∧ (𝐴 ≠ 0 ∧ 𝐵 ≠ 0)) → 0 < 𝐴)
38	34, 37	elrpd 13056	. . . . . . . . . 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 11346	. . . . . . . . . . 11 ⊢ ((((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) ∧ (𝐴 ≠ 0 ∧ 𝐵 ≠ 0)) → 0 < 𝐵)
43	39, 42	elrpd 13056	. . . . . . . . . 10 ⊢ ((((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) ∧ (𝐴 ≠ 0 ∧ 𝐵 ≠ 0)) → 𝐵 ∈ ℝ⁺)
44	38, 43	relogmuld 26766	. . . . . . . . 9 ⊢ ((((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) ∧ (𝐴 ≠ 0 ∧ 𝐵 ≠ 0)) → (log‘(𝐴 · 𝐵)) = ((log‘𝐴) + (log‘𝐵)))
45	44	oveq2d 7426	. . . . . . . 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 26711	. . . . . . . . 9 ⊢ ((((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) ∧ (𝐴 ≠ 0 ∧ 𝐵 ≠ 0)) → (log‘𝐴) ∈ ℂ)
49	15	adantr 485	. . . . . . . . . 10 ⊢ ((((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) ∧ (𝐴 ≠ 0 ∧ 𝐵 ≠ 0)) → 𝐵 ∈ ℂ)
50	49, 41	logcld 26711	. . . . . . . . 9 ⊢ ((((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) ∧ (𝐴 ≠ 0 ∧ 𝐵 ≠ 0)) → (log‘𝐵) ∈ ℂ)
51	46, 48, 50	adddid 11232	. . . . . . . 8 ⊢ ((((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) ∧ (𝐴 ≠ 0 ∧ 𝐵 ≠ 0)) → (𝐶 · ((log‘𝐴) + (log‘𝐵))) = ((𝐶 · (log‘𝐴)) + (𝐶 · (log‘𝐵))))
52	45, 51	eqtrd 2796	. . . . . . 7 ⊢ ((((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) ∧ (𝐴 ≠ 0 ∧ 𝐵 ≠ 0)) → (𝐶 · (log‘(𝐴 · 𝐵))) = ((𝐶 · (log‘𝐴)) + (𝐶 · (log‘𝐵))))
53	52	fveq2d 6885	. . . . . 6 ⊢ ((((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) ∧ (𝐴 ≠ 0 ∧ 𝐵 ≠ 0)) → (exp‘(𝐶 · (log‘(𝐴 · 𝐵)))) = (exp‘((𝐶 · (log‘𝐴)) + (𝐶 · (log‘𝐵)))))
54	46, 48	mulcld 11228	. . . . . . 7 ⊢ ((((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) ∧ (𝐴 ≠ 0 ∧ 𝐵 ≠ 0)) → (𝐶 · (log‘𝐴)) ∈ ℂ)
55	46, 50	mulcld 11228	. . . . . . 7 ⊢ ((((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) ∧ (𝐴 ≠ 0 ∧ 𝐵 ≠ 0)) → (𝐶 · (log‘𝐵)) ∈ ℂ)
56		efadd 16147	. . . . . . 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 2796	. . . . 5 ⊢ ((((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) ∧ (𝐴 ≠ 0 ∧ 𝐵 ≠ 0)) → (exp‘(𝐶 · (log‘(𝐴 · 𝐵)))) = ((exp‘(𝐶 · (log‘𝐴))) · (exp‘(𝐶 · (log‘𝐵)))))
59	47, 49	mulcld 11228	. . . . . 6 ⊢ ((((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) ∧ (𝐴 ≠ 0 ∧ 𝐵 ≠ 0)) → (𝐴 · 𝐵) ∈ ℂ)
60	47, 49, 36, 41	mulne0d 11865	. . . . . 6 ⊢ ((((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) ∧ (𝐴 ≠ 0 ∧ 𝐵 ≠ 0)) → (𝐴 · 𝐵) ≠ 0)
61		cxpef 26806	. . . . . 6 ⊢ (((𝐴 · 𝐵) ∈ ℂ ∧ (𝐴 · 𝐵) ≠ 0 ∧ 𝐶 ∈ ℂ) → ((𝐴 · 𝐵)↑_𝑐𝐶) = (exp‘(𝐶 · (log‘(𝐴 · 𝐵)))))
62	59, 60, 46, 61	syl3anc 1396	. . . . 5 ⊢ ((((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) ∧ (𝐴 ≠ 0 ∧ 𝐵 ≠ 0)) → ((𝐴 · 𝐵)↑_𝑐𝐶) = (exp‘(𝐶 · (log‘(𝐴 · 𝐵)))))
63		cxpef 26806	. . . . . . 7 ⊢ ((𝐴 ∈ ℂ ∧ 𝐴 ≠ 0 ∧ 𝐶 ∈ ℂ) → (𝐴↑_𝑐𝐶) = (exp‘(𝐶 · (log‘𝐴))))
64	47, 36, 46, 63	syl3anc 1396	. . . . . 6 ⊢ ((((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) ∧ (𝐴 ≠ 0 ∧ 𝐵 ≠ 0)) → (𝐴↑_𝑐𝐶) = (exp‘(𝐶 · (log‘𝐴))))
65		cxpef 26806	. . . . . . 7 ⊢ ((𝐵 ∈ ℂ ∧ 𝐵 ≠ 0 ∧ 𝐶 ∈ ℂ) → (𝐵↑_𝑐𝐶) = (exp‘(𝐶 · (log‘𝐵))))
66	49, 41, 46, 65	syl3anc 1396	. . . . . 6 ⊢ ((((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) ∧ (𝐴 ≠ 0 ∧ 𝐵 ≠ 0)) → (𝐵↑_𝑐𝐶) = (exp‘(𝐶 · (log‘𝐵))))
67	64, 66	oveq12d 7428	. . . . 5 ⊢ ((((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) ∧ (𝐴 ≠ 0 ∧ 𝐵 ≠ 0)) → ((𝐴↑_𝑐𝐶) · (𝐵↑_𝑐𝐶)) = ((exp‘(𝐶 · (log‘𝐴))) · (exp‘(𝐶 · (log‘𝐵)))))
68	58, 62, 67	3eqtr4d 2806	. . . 4 ⊢ ((((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) ∧ (𝐴 ≠ 0 ∧ 𝐵 ≠ 0)) → ((𝐴 · 𝐵)↑_𝑐𝐶) = ((𝐴↑_𝑐𝐶) · (𝐵↑_𝑐𝐶)))
69	68	exp32 425	. . 3 ⊢ (((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) → (𝐴 ≠ 0 → (𝐵 ≠ 0 → ((𝐴 · 𝐵)↑_𝑐𝐶) = ((𝐴↑_𝑐𝐶) · (𝐵↑_𝑐𝐶)))))
70	33, 69	pm2.61dne 3042	. 2 ⊢ (((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) → (𝐵 ≠ 0 → ((𝐴 · 𝐵)↑_𝑐𝐶) = ((𝐴↑_𝑐𝐶) · (𝐵↑_𝑐𝐶))))
71	13, 70	pm2.61dne 3042	1 ⊢ (((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ 𝐶 ∈ ℂ) → ((𝐴 · 𝐵)↑_𝑐𝐶) = ((𝐴↑_𝑐𝐶) · (𝐵↑_𝑐𝐶)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 400 ∧ w3a 1101 = wceq 1568 ∈ wcel 2141 ≠ wne 2956 class class class wbr 5108 ‘cfv 6536 (class class class)co 7410 ℂcc 11097 ℝcr 11098 0cc0 11099 + caddc 11102 · cmul 11104 ≤ cle 11243 expce 16114 logclog 26695 ↑_𝑐ccxp 26696

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1823 ax-4 1837 ax-5 1938 ax-6 1995 ax-7 2036 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-rep 5237 ax-sep 5256 ax-nul 5268 ax-pow 5336 ax-pr 5404 ax-un 7732 ax-inf2 9609 ax-cnex 11155 ax-resscn 11156 ax-1cn 11157 ax-icn 11158 ax-addcl 11159 ax-addrcl 11160 ax-mulcl 11161 ax-mulrcl 11162 ax-mulcom 11163 ax-addass 11164 ax-mulass 11165 ax-distr 11166 ax-i2m1 11167 ax-1ne0 11168 ax-1rid 11169 ax-rnegex 11170 ax-rrecex 11171 ax-cnre 11172 ax-pre-lttri 11173 ax-pre-lttrn 11174 ax-pre-ltadd 11175 ax-pre-mulgt0 11176 ax-pre-sup 11177 ax-addf 11178

This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1571 df-fal 1581 df-ex 1808 df-nf 1812 df-sb 2095 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3063 df-ral 3078 df-rex 3088 df-rmo 3367 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3744 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4487 df-pw 4563 df-sn 4589 df-pr 4591 df-tp 4593 df-op 4595 df-uni 4872 df-int 4912 df-iun 4957 df-iin 4958 df-br 5109 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5556 df-eprel 5561 df-po 5569 df-so 5570 df-fr 5614 df-se 5615 df-we 5616 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 df-pred 6302 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-isom 6545 df-riota 7367 df-ov 7413 df-oprab 7414 df-mpo 7415 df-of 7674 df-om 7862 df-1st 7985 df-2nd 7986 df-supp 8156 df-frecs 8277 df-wrecs 8308 df-recs 8357 df-rdg 8396 df-1o 8452 df-2o 8453 df-er 8693 df-map 8825 df-pm 8826 df-ixp 8895 df-en 8943 df-dom 8944 df-sdom 8945 df-fin 8946 df-fsupp 9321 df-fi 9370 df-sup 9401 df-inf 9402 df-oi 9471 df-card 9924 df-pnf 11244 df-mnf 11245 df-xr 11246 df-ltxr 11247 df-le 11248 df-sub 11442 df-neg 11443 df-div 11871 df-nn 12233 df-2 12302 df-3 12303 df-4 12304 df-5 12305 df-6 12306 df-7 12307 df-8 12308 df-9 12309 df-n0 12504 df-z 12591 df-dec 12711 df-uz 12862 df-q 12972 df-rp 13016 df-xneg 13136 df-xadd 13137 df-xmul 13138 df-ioo 13375 df-ioc 13376 df-ico 13377 df-icc 13378 df-fz 13535 df-fzo 13683 df-fl 13825 df-mod 13903 df-seq 14038 df-exp 14098 df-fac 14310 df-bc 14339 df-hash 14367 df-shft 15104 df-cj 15150 df-re 15151 df-im 15152 df-sqrt 15286 df-abs 15287 df-limsup 15522 df-clim 15539 df-rlim 15540 df-sum 15738 df-ef 16120 df-sin 16122 df-cos 16123 df-pi 16125 df-struct 17206 df-sets 17223 df-slot 17241 df-ndx 17253 df-base 17269 df-ress 17290 df-plusg 17322 df-mulr 17323 df-starv 17324 df-sca 17325 df-vsca 17326 df-ip 17327 df-tset 17328 df-ple 17329 df-ds 17331 df-unif 17332 df-hom 17333 df-cco 17334 df-rest 17474 df-topn 17475 df-0g 17493 df-gsum 17494 df-topgen 17495 df-pt 17496 df-prds 17499 df-xrs 17555 df-qtop 17560 df-imas 17561 df-xps 17563 df-mre 17637 df-mrc 17638 df-acs 17640 df-mgm 18697 df-sgrp 18776 df-mnd 18792 df-submnd 18841 df-mulg 19133 df-cntz 19386 df-cmn 19851 df-psmet 21493 df-xmet 21494 df-met 21495 df-bl 21496 df-mopn 21497 df-fbas 21498 df-fg 21499 df-cnfld 21502 df-top 23030 df-topon 23047 df-topsp 23069 df-bases 23082 df-cld 23155 df-ntr 23156 df-cls 23157 df-nei 23234 df-lp 23272 df-perf 23273 df-cn 23363 df-cnp 23364 df-haus 23451 df-tx 23698 df-hmeo 23891 df-fil 23982 df-fm 24074 df-flim 24075 df-flf 24076 df-xms 24456 df-ms 24457 df-tms 24458 df-cncf 25016 df-limc 26004 df-dv 26005 df-log 26697 df-cxp 26698

This theorem is referenced by: cxprec 26827 divcxp 26828 mulcxpd 26869 amgmlemALT 50570

W3C validator