rpmulcxp - Intuitionistic Logic Explorer

	Intuitionistic Logic Explorer		< Previous Next > Nearby theorems
Mirrors > Home > ILE Home > Th. List > rpmulcxp		GIF version

Theorem rpmulcxp 15583

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
rpmulcxp	⊢ ((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℝ⁺ ∧ 𝐶 ∈ ℂ) → ((𝐴 · 𝐵)↑_𝑐𝐶) = ((𝐴↑_𝑐𝐶) · (𝐵↑_𝑐𝐶)))

**Proof of Theorem rpmulcxp**
Step	Hyp	Ref	Expression
1		simp1 1021	. . . . . . 7 ⊢ ((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℝ⁺ ∧ 𝐶 ∈ ℂ) → 𝐴 ∈ ℝ⁺)
2		simp2 1022	. . . . . . 7 ⊢ ((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℝ⁺ ∧ 𝐶 ∈ ℂ) → 𝐵 ∈ ℝ⁺)
3	1, 2	relogmuld 15558	. . . . . 6 ⊢ ((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℝ⁺ ∧ 𝐶 ∈ ℂ) → (log‘(𝐴 · 𝐵)) = ((log‘𝐴) + (log‘𝐵)))
4	3	oveq2d 6017	. . . . 5 ⊢ ((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℝ⁺ ∧ 𝐶 ∈ ℂ) → (𝐶 · (log‘(𝐴 · 𝐵))) = (𝐶 · ((log‘𝐴) + (log‘𝐵))))
5		simp3 1023	. . . . . 6 ⊢ ((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℝ⁺ ∧ 𝐶 ∈ ℂ) → 𝐶 ∈ ℂ)
6	1	relogcld 15556	. . . . . . 7 ⊢ ((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℝ⁺ ∧ 𝐶 ∈ ℂ) → (log‘𝐴) ∈ ℝ)
7	6	recnd 8175	. . . . . 6 ⊢ ((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℝ⁺ ∧ 𝐶 ∈ ℂ) → (log‘𝐴) ∈ ℂ)
8	2	relogcld 15556	. . . . . . 7 ⊢ ((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℝ⁺ ∧ 𝐶 ∈ ℂ) → (log‘𝐵) ∈ ℝ)
9	8	recnd 8175	. . . . . 6 ⊢ ((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℝ⁺ ∧ 𝐶 ∈ ℂ) → (log‘𝐵) ∈ ℂ)
10	5, 7, 9	adddid 8171	. . . . 5 ⊢ ((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℝ⁺ ∧ 𝐶 ∈ ℂ) → (𝐶 · ((log‘𝐴) + (log‘𝐵))) = ((𝐶 · (log‘𝐴)) + (𝐶 · (log‘𝐵))))
11	4, 10	eqtrd 2262	. . . 4 ⊢ ((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℝ⁺ ∧ 𝐶 ∈ ℂ) → (𝐶 · (log‘(𝐴 · 𝐵))) = ((𝐶 · (log‘𝐴)) + (𝐶 · (log‘𝐵))))
12	11	fveq2d 5631	. . 3 ⊢ ((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℝ⁺ ∧ 𝐶 ∈ ℂ) → (exp‘(𝐶 · (log‘(𝐴 · 𝐵)))) = (exp‘((𝐶 · (log‘𝐴)) + (𝐶 · (log‘𝐵)))))
13	5, 7	mulcld 8167	. . . 4 ⊢ ((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℝ⁺ ∧ 𝐶 ∈ ℂ) → (𝐶 · (log‘𝐴)) ∈ ℂ)
14	5, 9	mulcld 8167	. . . 4 ⊢ ((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℝ⁺ ∧ 𝐶 ∈ ℂ) → (𝐶 · (log‘𝐵)) ∈ ℂ)
15		efadd 12186	. . . 4 ⊢ (((𝐶 · (log‘𝐴)) ∈ ℂ ∧ (𝐶 · (log‘𝐵)) ∈ ℂ) → (exp‘((𝐶 · (log‘𝐴)) + (𝐶 · (log‘𝐵)))) = ((exp‘(𝐶 · (log‘𝐴))) · (exp‘(𝐶 · (log‘𝐵)))))
16	13, 14, 15	syl2anc 411	. . 3 ⊢ ((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℝ⁺ ∧ 𝐶 ∈ ℂ) → (exp‘((𝐶 · (log‘𝐴)) + (𝐶 · (log‘𝐵)))) = ((exp‘(𝐶 · (log‘𝐴))) · (exp‘(𝐶 · (log‘𝐵)))))
17	12, 16	eqtrd 2262	. 2 ⊢ ((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℝ⁺ ∧ 𝐶 ∈ ℂ) → (exp‘(𝐶 · (log‘(𝐴 · 𝐵)))) = ((exp‘(𝐶 · (log‘𝐴))) · (exp‘(𝐶 · (log‘𝐵)))))
18	1, 2	rpmulcld 9909	. . 3 ⊢ ((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℝ⁺ ∧ 𝐶 ∈ ℂ) → (𝐴 · 𝐵) ∈ ℝ⁺)
19		rpcxpef 15568	. . 3 ⊢ (((𝐴 · 𝐵) ∈ ℝ⁺ ∧ 𝐶 ∈ ℂ) → ((𝐴 · 𝐵)↑_𝑐𝐶) = (exp‘(𝐶 · (log‘(𝐴 · 𝐵)))))
20	18, 5, 19	syl2anc 411	. 2 ⊢ ((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℝ⁺ ∧ 𝐶 ∈ ℂ) → ((𝐴 · 𝐵)↑_𝑐𝐶) = (exp‘(𝐶 · (log‘(𝐴 · 𝐵)))))
21		rpcxpef 15568	. . . 4 ⊢ ((𝐴 ∈ ℝ⁺ ∧ 𝐶 ∈ ℂ) → (𝐴↑_𝑐𝐶) = (exp‘(𝐶 · (log‘𝐴))))
22	1, 5, 21	syl2anc 411	. . 3 ⊢ ((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℝ⁺ ∧ 𝐶 ∈ ℂ) → (𝐴↑_𝑐𝐶) = (exp‘(𝐶 · (log‘𝐴))))
23		rpcxpef 15568	. . . 4 ⊢ ((𝐵 ∈ ℝ⁺ ∧ 𝐶 ∈ ℂ) → (𝐵↑_𝑐𝐶) = (exp‘(𝐶 · (log‘𝐵))))
24	2, 5, 23	syl2anc 411	. . 3 ⊢ ((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℝ⁺ ∧ 𝐶 ∈ ℂ) → (𝐵↑_𝑐𝐶) = (exp‘(𝐶 · (log‘𝐵))))
25	22, 24	oveq12d 6019	. 2 ⊢ ((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℝ⁺ ∧ 𝐶 ∈ ℂ) → ((𝐴↑_𝑐𝐶) · (𝐵↑_𝑐𝐶)) = ((exp‘(𝐶 · (log‘𝐴))) · (exp‘(𝐶 · (log‘𝐵)))))
26	17, 20, 25	3eqtr4d 2272	1 ⊢ ((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℝ⁺ ∧ 𝐶 ∈ ℂ) → ((𝐴 · 𝐵)↑_𝑐𝐶) = ((𝐴↑_𝑐𝐶) · (𝐵↑_𝑐𝐶)))

Colors of variables: wff set class

Syntax hints: → wi 4 ∧ w3a 1002 = wceq 1395 ∈ wcel 2200 ‘cfv 5318 (class class class)co 6001 ℂcc 7997 + caddc 8002 · cmul 8004 ℝ⁺crp 9849 expce 12153 logclog 15530 ↑_𝑐ccxp 15531

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-coll 4199 ax-sep 4202 ax-nul 4210 ax-pow 4258 ax-pr 4293 ax-un 4524 ax-setind 4629 ax-iinf 4680 ax-cnex 8090 ax-resscn 8091 ax-1cn 8092 ax-1re 8093 ax-icn 8094 ax-addcl 8095 ax-addrcl 8096 ax-mulcl 8097 ax-mulrcl 8098 ax-addcom 8099 ax-mulcom 8100 ax-addass 8101 ax-mulass 8102 ax-distr 8103 ax-i2m1 8104 ax-0lt1 8105 ax-1rid 8106 ax-0id 8107 ax-rnegex 8108 ax-precex 8109 ax-cnre 8110 ax-pre-ltirr 8111 ax-pre-ltwlin 8112 ax-pre-lttrn 8113 ax-pre-apti 8114 ax-pre-ltadd 8115 ax-pre-mulgt0 8116 ax-pre-mulext 8117 ax-arch 8118 ax-caucvg 8119 ax-pre-suploc 8120 ax-addf 8121 ax-mulf 8122

This theorem depends on definitions: df-bi 117 df-stab 836 df-dc 840 df-3or 1003 df-3an 1004 df-tru 1398 df-fal 1401 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-nel 2496 df-ral 2513 df-rex 2514 df-reu 2515 df-rmo 2516 df-rab 2517 df-v 2801 df-sbc 3029 df-csb 3125 df-dif 3199 df-un 3201 df-in 3203 df-ss 3210 df-nul 3492 df-if 3603 df-pw 3651 df-sn 3672 df-pr 3673 df-op 3675 df-uni 3889 df-int 3924 df-iun 3967 df-disj 4060 df-br 4084 df-opab 4146 df-mpt 4147 df-tr 4183 df-id 4384 df-po 4387 df-iso 4388 df-iord 4457 df-on 4459 df-ilim 4460 df-suc 4462 df-iom 4683 df-xp 4725 df-rel 4726 df-cnv 4727 df-co 4728 df-dm 4729 df-rn 4730 df-res 4731 df-ima 4732 df-iota 5278 df-fun 5320 df-fn 5321 df-f 5322 df-f1 5323 df-fo 5324 df-f1o 5325 df-fv 5326 df-isom 5327 df-riota 5954 df-ov 6004 df-oprab 6005 df-mpo 6006 df-of 6218 df-1st 6286 df-2nd 6287 df-recs 6451 df-irdg 6516 df-frec 6537 df-1o 6562 df-oadd 6566 df-er 6680 df-map 6797 df-pm 6798 df-en 6888 df-dom 6889 df-fin 6890 df-sup 7151 df-inf 7152 df-pnf 8183 df-mnf 8184 df-xr 8185 df-ltxr 8186 df-le 8187 df-sub 8319 df-neg 8320 df-reap 8722 df-ap 8729 df-div 8820 df-inn 9111 df-2 9169 df-3 9170 df-4 9171 df-n0 9370 df-z 9447 df-uz 9723 df-q 9815 df-rp 9850 df-xneg 9968 df-xadd 9969 df-ioo 10088 df-ico 10090 df-icc 10091 df-fz 10205 df-fzo 10339 df-seqfrec 10670 df-exp 10761 df-fac 10948 df-bc 10970 df-ihash 10998 df-shft 11326 df-cj 11353 df-re 11354 df-im 11355 df-rsqrt 11509 df-abs 11510 df-clim 11790 df-sumdc 11865 df-ef 12159 df-e 12160 df-rest 13274 df-topgen 13293 df-psmet 14507 df-xmet 14508 df-met 14509 df-bl 14510 df-mopn 14511 df-top 14672 df-topon 14685 df-bases 14717 df-ntr 14770 df-cn 14862 df-cnp 14863 df-tx 14927 df-cncf 15245 df-limced 15330 df-dvap 15331 df-relog 15532 df-rpcxp 15533

This theorem is referenced by: cxprec 15584 rpdivcxp 15585 sgmmul 15670

W3C validator