| 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 15213 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (ℜ‘(𝐴 + 𝐵)) = ((ℜ‘𝐴) + (ℜ‘𝐵))) | |
| 2 | imadd 15221 | . . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (ℑ‘(𝐴 + 𝐵)) = ((ℑ‘𝐴) + (ℑ‘𝐵))) | |
| 3 | 2 | oveq2d 7429 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (i · (ℑ‘(𝐴 + 𝐵))) = (i · ((ℑ‘𝐴) + (ℑ‘𝐵)))) |
| 4 | ax-icn 11183 | . . . . . . 7 ⊢ i ∈ ℂ | |
| 5 | 4 | a1i 11 | . . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → i ∈ ℂ) |
| 6 | imcl 15198 | . . . . . . . 8 ⊢ (𝐴 ∈ ℂ → (ℑ‘𝐴) ∈ ℝ) | |
| 7 | 6 | adantr 486 | . . . . . . 7 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (ℑ‘𝐴) ∈ ℝ) |
| 8 | 7 | recnd 11261 | . . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (ℑ‘𝐴) ∈ ℂ) |
| 9 | imcl 15198 | . . . . . . . 8 ⊢ (𝐵 ∈ ℂ → (ℑ‘𝐵) ∈ ℝ) | |
| 10 | 9 | adantl 487 | . . . . . . 7 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (ℑ‘𝐵) ∈ ℝ) |
| 11 | 10 | recnd 11261 | . . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (ℑ‘𝐵) ∈ ℂ) |
| 12 | 5, 8, 11 | adddid 11257 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (i · ((ℑ‘𝐴) + (ℑ‘𝐵))) = ((i · (ℑ‘𝐴)) + (i · (ℑ‘𝐵)))) |
| 13 | 3, 12 | eqtrd 2795 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (i · (ℑ‘(𝐴 + 𝐵))) = ((i · (ℑ‘𝐴)) + (i · (ℑ‘𝐵)))) |
| 14 | 1, 13 | oveq12d 7431 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((ℜ‘(𝐴 + 𝐵)) − (i · (ℑ‘(𝐴 + 𝐵)))) = (((ℜ‘𝐴) + (ℜ‘𝐵)) − ((i · (ℑ‘𝐴)) + (i · (ℑ‘𝐵))))) |
| 15 | recl 15197 | . . . . . 6 ⊢ (𝐴 ∈ ℂ → (ℜ‘𝐴) ∈ ℝ) | |
| 16 | 15 | adantr 486 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (ℜ‘𝐴) ∈ ℝ) |
| 17 | 16 | recnd 11261 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (ℜ‘𝐴) ∈ ℂ) |
| 18 | recl 15197 | . . . . . 6 ⊢ (𝐵 ∈ ℂ → (ℜ‘𝐵) ∈ ℝ) | |
| 19 | 18 | adantl 487 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (ℜ‘𝐵) ∈ ℝ) |
| 20 | 19 | recnd 11261 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (ℜ‘𝐵) ∈ ℂ) |
| 21 | mulcl 11208 | . . . . 5 ⊢ ((i ∈ ℂ ∧ (ℑ‘𝐴) ∈ ℂ) → (i · (ℑ‘𝐴)) ∈ ℂ) | |
| 22 | 4, 8, 21 | sylancr 599 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (i · (ℑ‘𝐴)) ∈ ℂ) |
| 23 | mulcl 11208 | . . . . 5 ⊢ ((i ∈ ℂ ∧ (ℑ‘𝐵) ∈ ℂ) → (i · (ℑ‘𝐵)) ∈ ℂ) | |
| 24 | 4, 11, 23 | sylancr 599 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (i · (ℑ‘𝐵)) ∈ ℂ) |
| 25 | 17, 20, 22, 24 | addsub4d 11640 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (((ℜ‘𝐴) + (ℜ‘𝐵)) − ((i · (ℑ‘𝐴)) + (i · (ℑ‘𝐵)))) = (((ℜ‘𝐴) − (i · (ℑ‘𝐴))) + ((ℜ‘𝐵) − (i · (ℑ‘𝐵))))) |
| 26 | 14, 25 | eqtrd 2795 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((ℜ‘(𝐴 + 𝐵)) − (i · (ℑ‘(𝐴 + 𝐵)))) = (((ℜ‘𝐴) − (i · (ℑ‘𝐴))) + ((ℜ‘𝐵) − (i · (ℑ‘𝐵))))) |
| 27 | addcl 11206 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 + 𝐵) ∈ ℂ) | |
| 28 | remim 15204 | . . 3 ⊢ ((𝐴 + 𝐵) ∈ ℂ → (∗‘(𝐴 + 𝐵)) = ((ℜ‘(𝐴 + 𝐵)) − (i · (ℑ‘(𝐴 + 𝐵))))) | |
| 29 | 27, 28 | syl 18 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (∗‘(𝐴 + 𝐵)) = ((ℜ‘(𝐴 + 𝐵)) − (i · (ℑ‘(𝐴 + 𝐵))))) |
| 30 | remim 15204 | . . 3 ⊢ (𝐴 ∈ ℂ → (∗‘𝐴) = ((ℜ‘𝐴) − (i · (ℑ‘𝐴)))) | |
| 31 | remim 15204 | . . 3 ⊢ (𝐵 ∈ ℂ → (∗‘𝐵) = ((ℜ‘𝐵) − (i · (ℑ‘𝐵)))) | |
| 32 | 30, 31 | oveqan12d 7432 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((∗‘𝐴) + (∗‘𝐵)) = (((ℜ‘𝐴) − (i · (ℑ‘𝐴))) + ((ℜ‘𝐵) − (i · (ℑ‘𝐵))))) |
| 33 | 26, 29, 32 | 3eqtr4d 2805 | 1 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (∗‘(𝐴 + 𝐵)) = ((∗‘𝐴) + (∗‘𝐵))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ‘cfv 6533 (class class class)co 7413 ℂcc 11122 ℝcr 11123 ici 11126 + caddc 11127 · cmul 11129 − cmin 11465 ∗ccj 15183 ℜcre 15184 ℑcim 15185 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7736 ax-resscn 11181 ax-1cn 11182 ax-icn 11183 ax-addcl 11184 ax-addrcl 11185 ax-mulcl 11186 ax-mulrcl 11187 ax-mulcom 11188 ax-addass 11189 ax-mulass 11190 ax-distr 11191 ax-i2m1 11192 ax-1ne0 11193 ax-1rid 11194 ax-rnegex 11195 ax-rrecex 11196 ax-cnre 11197 ax-pre-lttri 11198 ax-pre-lttrn 11199 ax-pre-ltadd 11200 ax-pre-mulgt0 11201 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6299 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-riota 7370 df-ov 7416 df-oprab 7417 df-mpo 7418 df-om 7863 df-2nd 7987 df-frecs 8280 df-wrecs 8311 df-recs 8360 df-rdg 8399 df-er 8696 df-en 8953 df-dom 8954 df-sdom 8955 df-pnf 11269 df-mnf 11270 df-xr 11271 df-ltxr 11272 df-le 11273 df-sub 11467 df-neg 11468 df-div 11896 df-nn 12258 df-2 12327 df-cj 15186 df-re 15187 df-im 15188 |
| This theorem is used by: cjsub 15236 cjreim 15247 cjaddi 15275 cjaddd 15307 sqabsadd 15369 sqreulem 15447 fsumcj 15897 efcj 16178 cnsrng 21619 atancj 27147 his7 31571 sigaraf 47681 |
| Copyright terms: Public domain | W3C validator |