| 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 15040 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (ℜ‘(𝐴 + 𝐵)) = ((ℜ‘𝐴) + (ℜ‘𝐵))) | |
| 2 | imadd 15048 | . . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (ℑ‘(𝐴 + 𝐵)) = ((ℑ‘𝐴) + (ℑ‘𝐵))) | |
| 3 | 2 | oveq2d 7371 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (i · (ℑ‘(𝐴 + 𝐵))) = (i · ((ℑ‘𝐴) + (ℑ‘𝐵)))) |
| 4 | ax-icn 11076 | . . . . . . 7 ⊢ i ∈ ℂ | |
| 5 | 4 | a1i 11 | . . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → i ∈ ℂ) |
| 6 | imcl 15025 | . . . . . . . 8 ⊢ (𝐴 ∈ ℂ → (ℑ‘𝐴) ∈ ℝ) | |
| 7 | 6 | adantr 480 | . . . . . . 7 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (ℑ‘𝐴) ∈ ℝ) |
| 8 | 7 | recnd 11151 | . . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (ℑ‘𝐴) ∈ ℂ) |
| 9 | imcl 15025 | . . . . . . . 8 ⊢ (𝐵 ∈ ℂ → (ℑ‘𝐵) ∈ ℝ) | |
| 10 | 9 | adantl 481 | . . . . . . 7 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (ℑ‘𝐵) ∈ ℝ) |
| 11 | 10 | recnd 11151 | . . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (ℑ‘𝐵) ∈ ℂ) |
| 12 | 5, 8, 11 | adddid 11147 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (i · ((ℑ‘𝐴) + (ℑ‘𝐵))) = ((i · (ℑ‘𝐴)) + (i · (ℑ‘𝐵)))) |
| 13 | 3, 12 | eqtrd 2768 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (i · (ℑ‘(𝐴 + 𝐵))) = ((i · (ℑ‘𝐴)) + (i · (ℑ‘𝐵)))) |
| 14 | 1, 13 | oveq12d 7373 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((ℜ‘(𝐴 + 𝐵)) − (i · (ℑ‘(𝐴 + 𝐵)))) = (((ℜ‘𝐴) + (ℜ‘𝐵)) − ((i · (ℑ‘𝐴)) + (i · (ℑ‘𝐵))))) |
| 15 | recl 15024 | . . . . . 6 ⊢ (𝐴 ∈ ℂ → (ℜ‘𝐴) ∈ ℝ) | |
| 16 | 15 | adantr 480 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (ℜ‘𝐴) ∈ ℝ) |
| 17 | 16 | recnd 11151 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (ℜ‘𝐴) ∈ ℂ) |
| 18 | recl 15024 | . . . . . 6 ⊢ (𝐵 ∈ ℂ → (ℜ‘𝐵) ∈ ℝ) | |
| 19 | 18 | adantl 481 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (ℜ‘𝐵) ∈ ℝ) |
| 20 | 19 | recnd 11151 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (ℜ‘𝐵) ∈ ℂ) |
| 21 | mulcl 11101 | . . . . 5 ⊢ ((i ∈ ℂ ∧ (ℑ‘𝐴) ∈ ℂ) → (i · (ℑ‘𝐴)) ∈ ℂ) | |
| 22 | 4, 8, 21 | sylancr 587 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (i · (ℑ‘𝐴)) ∈ ℂ) |
| 23 | mulcl 11101 | . . . . 5 ⊢ ((i ∈ ℂ ∧ (ℑ‘𝐵) ∈ ℂ) → (i · (ℑ‘𝐵)) ∈ ℂ) | |
| 24 | 4, 11, 23 | sylancr 587 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (i · (ℑ‘𝐵)) ∈ ℂ) |
| 25 | 17, 20, 22, 24 | addsub4d 11530 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (((ℜ‘𝐴) + (ℜ‘𝐵)) − ((i · (ℑ‘𝐴)) + (i · (ℑ‘𝐵)))) = (((ℜ‘𝐴) − (i · (ℑ‘𝐴))) + ((ℜ‘𝐵) − (i · (ℑ‘𝐵))))) |
| 26 | 14, 25 | eqtrd 2768 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((ℜ‘(𝐴 + 𝐵)) − (i · (ℑ‘(𝐴 + 𝐵)))) = (((ℜ‘𝐴) − (i · (ℑ‘𝐴))) + ((ℜ‘𝐵) − (i · (ℑ‘𝐵))))) |
| 27 | addcl 11099 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 + 𝐵) ∈ ℂ) | |
| 28 | remim 15031 | . . 3 ⊢ ((𝐴 + 𝐵) ∈ ℂ → (∗‘(𝐴 + 𝐵)) = ((ℜ‘(𝐴 + 𝐵)) − (i · (ℑ‘(𝐴 + 𝐵))))) | |
| 29 | 27, 28 | syl 17 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (∗‘(𝐴 + 𝐵)) = ((ℜ‘(𝐴 + 𝐵)) − (i · (ℑ‘(𝐴 + 𝐵))))) |
| 30 | remim 15031 | . . 3 ⊢ (𝐴 ∈ ℂ → (∗‘𝐴) = ((ℜ‘𝐴) − (i · (ℑ‘𝐴)))) | |
| 31 | remim 15031 | . . 3 ⊢ (𝐵 ∈ ℂ → (∗‘𝐵) = ((ℜ‘𝐵) − (i · (ℑ‘𝐵)))) | |
| 32 | 30, 31 | oveqan12d 7374 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((∗‘𝐴) + (∗‘𝐵)) = (((ℜ‘𝐴) − (i · (ℑ‘𝐴))) + ((ℜ‘𝐵) − (i · (ℑ‘𝐵))))) |
| 33 | 26, 29, 32 | 3eqtr4d 2778 | 1 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (∗‘(𝐴 + 𝐵)) = ((∗‘𝐴) + (∗‘𝐵))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1541 ∈ wcel 2113 ‘cfv 6489 (class class class)co 7355 ℂcc 11015 ℝcr 11016 ici 11019 + caddc 11020 · cmul 11022 − cmin 11355 ∗ccj 15010 ℜcre 15011 ℑcim 15012 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2705 ax-sep 5238 ax-nul 5248 ax-pow 5307 ax-pr 5374 ax-un 7677 ax-resscn 11074 ax-1cn 11075 ax-icn 11076 ax-addcl 11077 ax-addrcl 11078 ax-mulcl 11079 ax-mulrcl 11080 ax-mulcom 11081 ax-addass 11082 ax-mulass 11083 ax-distr 11084 ax-i2m1 11085 ax-1ne0 11086 ax-1rid 11087 ax-rnegex 11088 ax-rrecex 11089 ax-cnre 11090 ax-pre-lttri 11091 ax-pre-lttrn 11092 ax-pre-ltadd 11093 ax-pre-mulgt0 11094 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2537 df-eu 2566 df-clab 2712 df-cleq 2725 df-clel 2808 df-nfc 2882 df-ne 2930 df-nel 3034 df-ral 3049 df-rex 3058 df-rmo 3347 df-reu 3348 df-rab 3397 df-v 3439 df-sbc 3738 df-csb 3847 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-pss 3918 df-nul 4283 df-if 4477 df-pw 4553 df-sn 4578 df-pr 4580 df-op 4584 df-uni 4861 df-iun 4945 df-br 5096 df-opab 5158 df-mpt 5177 df-tr 5203 df-id 5516 df-eprel 5521 df-po 5529 df-so 5530 df-fr 5574 df-we 5576 df-xp 5627 df-rel 5628 df-cnv 5629 df-co 5630 df-dm 5631 df-rn 5632 df-res 5633 df-ima 5634 df-pred 6256 df-ord 6317 df-on 6318 df-lim 6319 df-suc 6320 df-iota 6445 df-fun 6491 df-fn 6492 df-f 6493 df-f1 6494 df-fo 6495 df-f1o 6496 df-fv 6497 df-riota 7312 df-ov 7358 df-oprab 7359 df-mpo 7360 df-om 7806 df-2nd 7931 df-frecs 8220 df-wrecs 8251 df-recs 8300 df-rdg 8338 df-er 8631 df-en 8880 df-dom 8881 df-sdom 8882 df-pnf 11159 df-mnf 11160 df-xr 11161 df-ltxr 11162 df-le 11163 df-sub 11357 df-neg 11358 df-div 11786 df-nn 12137 df-2 12199 df-cj 15013 df-re 15014 df-im 15015 |
| This theorem is referenced by: cjsub 15063 cjreim 15074 cjaddi 15102 cjaddd 15134 sqabsadd 15196 sqreulem 15274 fsumcj 15724 efcj 16006 cnsrng 21351 atancj 26867 his7 31091 sigaraf 47013 |
| Copyright terms: Public domain | W3C validator |