| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > cjadd | Structured version Visualization version GIF version | ||
| Description: Complex conjugate distributes over addition. Proposition 10-3.4(a) of [Gleason] p. 133. (Contributed by NM, 31-Jul-1999.) (Revised by Mario Carneiro, 14-Jul-2014.) |
| Ref | Expression |
|---|---|
| cjadd | ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (∗‘(𝐴 + 𝐵)) = ((∗‘𝐴) + (∗‘𝐵))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | readd 15148 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (ℜ‘(𝐴 + 𝐵)) = ((ℜ‘𝐴) + (ℜ‘𝐵))) | |
| 2 | imadd 15156 | . . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (ℑ‘(𝐴 + 𝐵)) = ((ℑ‘𝐴) + (ℑ‘𝐵))) | |
| 3 | 2 | oveq2d 7429 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (i · (ℑ‘(𝐴 + 𝐵))) = (i · ((ℑ‘𝐴) + (ℑ‘𝐵)))) |
| 4 | ax-icn 11196 | . . . . . . 7 ⊢ i ∈ ℂ | |
| 5 | 4 | a1i 11 | . . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → i ∈ ℂ) |
| 6 | imcl 15133 | . . . . . . . 8 ⊢ (𝐴 ∈ ℂ → (ℑ‘𝐴) ∈ ℝ) | |
| 7 | 6 | adantr 480 | . . . . . . 7 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (ℑ‘𝐴) ∈ ℝ) |
| 8 | 7 | recnd 11271 | . . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (ℑ‘𝐴) ∈ ℂ) |
| 9 | imcl 15133 | . . . . . . . 8 ⊢ (𝐵 ∈ ℂ → (ℑ‘𝐵) ∈ ℝ) | |
| 10 | 9 | adantl 481 | . . . . . . 7 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (ℑ‘𝐵) ∈ ℝ) |
| 11 | 10 | recnd 11271 | . . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (ℑ‘𝐵) ∈ ℂ) |
| 12 | 5, 8, 11 | adddid 11267 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (i · ((ℑ‘𝐴) + (ℑ‘𝐵))) = ((i · (ℑ‘𝐴)) + (i · (ℑ‘𝐵)))) |
| 13 | 3, 12 | eqtrd 2769 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (i · (ℑ‘(𝐴 + 𝐵))) = ((i · (ℑ‘𝐴)) + (i · (ℑ‘𝐵)))) |
| 14 | 1, 13 | oveq12d 7431 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((ℜ‘(𝐴 + 𝐵)) − (i · (ℑ‘(𝐴 + 𝐵)))) = (((ℜ‘𝐴) + (ℜ‘𝐵)) − ((i · (ℑ‘𝐴)) + (i · (ℑ‘𝐵))))) |
| 15 | recl 15132 | . . . . . 6 ⊢ (𝐴 ∈ ℂ → (ℜ‘𝐴) ∈ ℝ) | |
| 16 | 15 | adantr 480 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (ℜ‘𝐴) ∈ ℝ) |
| 17 | 16 | recnd 11271 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (ℜ‘𝐴) ∈ ℂ) |
| 18 | recl 15132 | . . . . . 6 ⊢ (𝐵 ∈ ℂ → (ℜ‘𝐵) ∈ ℝ) | |
| 19 | 18 | adantl 481 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (ℜ‘𝐵) ∈ ℝ) |
| 20 | 19 | recnd 11271 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (ℜ‘𝐵) ∈ ℂ) |
| 21 | mulcl 11221 | . . . . 5 ⊢ ((i ∈ ℂ ∧ (ℑ‘𝐴) ∈ ℂ) → (i · (ℑ‘𝐴)) ∈ ℂ) | |
| 22 | 4, 8, 21 | sylancr 587 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (i · (ℑ‘𝐴)) ∈ ℂ) |
| 23 | mulcl 11221 | . . . . 5 ⊢ ((i ∈ ℂ ∧ (ℑ‘𝐵) ∈ ℂ) → (i · (ℑ‘𝐵)) ∈ ℂ) | |
| 24 | 4, 11, 23 | sylancr 587 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (i · (ℑ‘𝐵)) ∈ ℂ) |
| 25 | 17, 20, 22, 24 | addsub4d 11649 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (((ℜ‘𝐴) + (ℜ‘𝐵)) − ((i · (ℑ‘𝐴)) + (i · (ℑ‘𝐵)))) = (((ℜ‘𝐴) − (i · (ℑ‘𝐴))) + ((ℜ‘𝐵) − (i · (ℑ‘𝐵))))) |
| 26 | 14, 25 | eqtrd 2769 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((ℜ‘(𝐴 + 𝐵)) − (i · (ℑ‘(𝐴 + 𝐵)))) = (((ℜ‘𝐴) − (i · (ℑ‘𝐴))) + ((ℜ‘𝐵) − (i · (ℑ‘𝐵))))) |
| 27 | addcl 11219 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 + 𝐵) ∈ ℂ) | |
| 28 | remim 15139 | . . 3 ⊢ ((𝐴 + 𝐵) ∈ ℂ → (∗‘(𝐴 + 𝐵)) = ((ℜ‘(𝐴 + 𝐵)) − (i · (ℑ‘(𝐴 + 𝐵))))) | |
| 29 | 27, 28 | syl 17 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (∗‘(𝐴 + 𝐵)) = ((ℜ‘(𝐴 + 𝐵)) − (i · (ℑ‘(𝐴 + 𝐵))))) |
| 30 | remim 15139 | . . 3 ⊢ (𝐴 ∈ ℂ → (∗‘𝐴) = ((ℜ‘𝐴) − (i · (ℑ‘𝐴)))) | |
| 31 | remim 15139 | . . 3 ⊢ (𝐵 ∈ ℂ → (∗‘𝐵) = ((ℜ‘𝐵) − (i · (ℑ‘𝐵)))) | |
| 32 | 30, 31 | oveqan12d 7432 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((∗‘𝐴) + (∗‘𝐵)) = (((ℜ‘𝐴) − (i · (ℑ‘𝐴))) + ((ℜ‘𝐵) − (i · (ℑ‘𝐵))))) |
| 33 | 26, 29, 32 | 3eqtr4d 2779 | 1 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (∗‘(𝐴 + 𝐵)) = ((∗‘𝐴) + (∗‘𝐵))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1539 ∈ wcel 2107 ‘cfv 6541 (class class class)co 7413 ℂcc 11135 ℝcr 11136 ici 11139 + caddc 11140 · cmul 11142 − cmin 11474 ∗ccj 15118 ℜcre 15119 ℑcim 15120 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1794 ax-4 1808 ax-5 1909 ax-6 1966 ax-7 2006 ax-8 2109 ax-9 2117 ax-10 2140 ax-11 2156 ax-12 2176 ax-ext 2706 ax-sep 5276 ax-nul 5286 ax-pow 5345 ax-pr 5412 ax-un 7737 ax-resscn 11194 ax-1cn 11195 ax-icn 11196 ax-addcl 11197 ax-addrcl 11198 ax-mulcl 11199 ax-mulrcl 11200 ax-mulcom 11201 ax-addass 11202 ax-mulass 11203 ax-distr 11204 ax-i2m1 11205 ax-1ne0 11206 ax-1rid 11207 ax-rnegex 11208 ax-rrecex 11209 ax-cnre 11210 ax-pre-lttri 11211 ax-pre-lttrn 11212 ax-pre-ltadd 11213 ax-pre-mulgt0 11214 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1779 df-nf 1783 df-sb 2064 df-mo 2538 df-eu 2567 df-clab 2713 df-cleq 2726 df-clel 2808 df-nfc 2884 df-ne 2932 df-nel 3036 df-ral 3051 df-rex 3060 df-rmo 3363 df-reu 3364 df-rab 3420 df-v 3465 df-sbc 3771 df-csb 3880 df-dif 3934 df-un 3936 df-in 3938 df-ss 3948 df-pss 3951 df-nul 4314 df-if 4506 df-pw 4582 df-sn 4607 df-pr 4609 df-op 4613 df-uni 4888 df-iun 4973 df-br 5124 df-opab 5186 df-mpt 5206 df-tr 5240 df-id 5558 df-eprel 5564 df-po 5572 df-so 5573 df-fr 5617 df-we 5619 df-xp 5671 df-rel 5672 df-cnv 5673 df-co 5674 df-dm 5675 df-rn 5676 df-res 5677 df-ima 5678 df-pred 6301 df-ord 6366 df-on 6367 df-lim 6368 df-suc 6369 df-iota 6494 df-fun 6543 df-fn 6544 df-f 6545 df-f1 6546 df-fo 6547 df-f1o 6548 df-fv 6549 df-riota 7370 df-ov 7416 df-oprab 7417 df-mpo 7418 df-om 7870 df-2nd 7997 df-frecs 8288 df-wrecs 8319 df-recs 8393 df-rdg 8432 df-er 8727 df-en 8968 df-dom 8969 df-sdom 8970 df-pnf 11279 df-mnf 11280 df-xr 11281 df-ltxr 11282 df-le 11283 df-sub 11476 df-neg 11477 df-div 11903 df-nn 12249 df-2 12311 df-cj 15121 df-re 15122 df-im 15123 |
| This theorem is referenced by: cjsub 15171 cjreim 15182 cjaddi 15210 cjaddd 15242 sqabsadd 15304 sqreulem 15381 fsumcj 15829 efcj 16111 cnsrng 21381 atancj 26890 his7 31038 sigaraf 46840 |
| Copyright terms: Public domain | W3C validator |