| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > imadd | Structured version Visualization version GIF version | ||
| Description: Imaginary part distributes over addition. (Contributed by NM, 18-Mar-2005.) (Revised by Mario Carneiro, 14-Jul-2014.) |
| Ref | Expression |
|---|---|
| imadd | ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (ℑ‘(𝐴 + 𝐵)) = ((ℑ‘𝐴) + (ℑ‘𝐵))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | recl 15163 | . . . . . . 7 ⊢ (𝐴 ∈ ℂ → (ℜ‘𝐴) ∈ ℝ) | |
| 2 | 1 | adantr 485 | . . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (ℜ‘𝐴) ∈ ℝ) |
| 3 | 2 | recnd 11238 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (ℜ‘𝐴) ∈ ℂ) |
| 4 | ax-icn 11160 | . . . . . 6 ⊢ i ∈ ℂ | |
| 5 | imcl 15164 | . . . . . . . 8 ⊢ (𝐴 ∈ ℂ → (ℑ‘𝐴) ∈ ℝ) | |
| 6 | 5 | adantr 485 | . . . . . . 7 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (ℑ‘𝐴) ∈ ℝ) |
| 7 | 6 | recnd 11238 | . . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (ℑ‘𝐴) ∈ ℂ) |
| 8 | mulcl 11185 | . . . . . 6 ⊢ ((i ∈ ℂ ∧ (ℑ‘𝐴) ∈ ℂ) → (i · (ℑ‘𝐴)) ∈ ℂ) | |
| 9 | 4, 7, 8 | sylancr 598 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (i · (ℑ‘𝐴)) ∈ ℂ) |
| 10 | recl 15163 | . . . . . . 7 ⊢ (𝐵 ∈ ℂ → (ℜ‘𝐵) ∈ ℝ) | |
| 11 | 10 | adantl 486 | . . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (ℜ‘𝐵) ∈ ℝ) |
| 12 | 11 | recnd 11238 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (ℜ‘𝐵) ∈ ℂ) |
| 13 | imcl 15164 | . . . . . . . 8 ⊢ (𝐵 ∈ ℂ → (ℑ‘𝐵) ∈ ℝ) | |
| 14 | 13 | adantl 486 | . . . . . . 7 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (ℑ‘𝐵) ∈ ℝ) |
| 15 | 14 | recnd 11238 | . . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (ℑ‘𝐵) ∈ ℂ) |
| 16 | mulcl 11185 | . . . . . 6 ⊢ ((i ∈ ℂ ∧ (ℑ‘𝐵) ∈ ℂ) → (i · (ℑ‘𝐵)) ∈ ℂ) | |
| 17 | 4, 15, 16 | sylancr 598 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (i · (ℑ‘𝐵)) ∈ ℂ) |
| 18 | 3, 9, 12, 17 | add4d 11440 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (((ℜ‘𝐴) + (i · (ℑ‘𝐴))) + ((ℜ‘𝐵) + (i · (ℑ‘𝐵)))) = (((ℜ‘𝐴) + (ℜ‘𝐵)) + ((i · (ℑ‘𝐴)) + (i · (ℑ‘𝐵))))) |
| 19 | replim 15169 | . . . . 5 ⊢ (𝐴 ∈ ℂ → 𝐴 = ((ℜ‘𝐴) + (i · (ℑ‘𝐴)))) | |
| 20 | replim 15169 | . . . . 5 ⊢ (𝐵 ∈ ℂ → 𝐵 = ((ℜ‘𝐵) + (i · (ℑ‘𝐵)))) | |
| 21 | 19, 20 | oveqan12d 7431 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 + 𝐵) = (((ℜ‘𝐴) + (i · (ℑ‘𝐴))) + ((ℜ‘𝐵) + (i · (ℑ‘𝐵))))) |
| 22 | 4 | a1i 11 | . . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → i ∈ ℂ) |
| 23 | 22, 7, 15 | adddid 11234 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (i · ((ℑ‘𝐴) + (ℑ‘𝐵))) = ((i · (ℑ‘𝐴)) + (i · (ℑ‘𝐵)))) |
| 24 | 23 | oveq2d 7428 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (((ℜ‘𝐴) + (ℜ‘𝐵)) + (i · ((ℑ‘𝐴) + (ℑ‘𝐵)))) = (((ℜ‘𝐴) + (ℜ‘𝐵)) + ((i · (ℑ‘𝐴)) + (i · (ℑ‘𝐵))))) |
| 25 | 18, 21, 24 | 3eqtr4d 2808 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 + 𝐵) = (((ℜ‘𝐴) + (ℜ‘𝐵)) + (i · ((ℑ‘𝐴) + (ℑ‘𝐵))))) |
| 26 | 25 | fveq2d 6887 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (ℑ‘(𝐴 + 𝐵)) = (ℑ‘(((ℜ‘𝐴) + (ℜ‘𝐵)) + (i · ((ℑ‘𝐴) + (ℑ‘𝐵)))))) |
| 27 | readdcl 11184 | . . . 4 ⊢ (((ℜ‘𝐴) ∈ ℝ ∧ (ℜ‘𝐵) ∈ ℝ) → ((ℜ‘𝐴) + (ℜ‘𝐵)) ∈ ℝ) | |
| 28 | 1, 10, 27 | syl2an 607 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((ℜ‘𝐴) + (ℜ‘𝐵)) ∈ ℝ) |
| 29 | readdcl 11184 | . . . 4 ⊢ (((ℑ‘𝐴) ∈ ℝ ∧ (ℑ‘𝐵) ∈ ℝ) → ((ℑ‘𝐴) + (ℑ‘𝐵)) ∈ ℝ) | |
| 30 | 5, 13, 29 | syl2an 607 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((ℑ‘𝐴) + (ℑ‘𝐵)) ∈ ℝ) |
| 31 | crim 15168 | . . 3 ⊢ ((((ℜ‘𝐴) + (ℜ‘𝐵)) ∈ ℝ ∧ ((ℑ‘𝐴) + (ℑ‘𝐵)) ∈ ℝ) → (ℑ‘(((ℜ‘𝐴) + (ℜ‘𝐵)) + (i · ((ℑ‘𝐴) + (ℑ‘𝐵))))) = ((ℑ‘𝐴) + (ℑ‘𝐵))) | |
| 32 | 28, 30, 31 | syl2anc 595 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (ℑ‘(((ℜ‘𝐴) + (ℜ‘𝐵)) + (i · ((ℑ‘𝐴) + (ℑ‘𝐵))))) = ((ℑ‘𝐴) + (ℑ‘𝐵))) |
| 33 | 26, 32 | eqtrd 2798 | 1 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (ℑ‘(𝐴 + 𝐵)) = ((ℑ‘𝐴) + (ℑ‘𝐵))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 = wceq 1570 ∈ wcel 2143 ‘cfv 6538 (class class class)co 7412 ℂcc 11099 ℝcr 11100 ici 11103 + caddc 11104 · cmul 11106 ℜcre 15150 ℑcim 15151 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-sep 5258 ax-nul 5270 ax-pow 5338 ax-pr 5406 ax-un 7734 ax-resscn 11158 ax-1cn 11159 ax-icn 11160 ax-addcl 11161 ax-addrcl 11162 ax-mulcl 11163 ax-mulrcl 11164 ax-mulcom 11165 ax-addass 11166 ax-mulass 11167 ax-distr 11168 ax-i2m1 11169 ax-1ne0 11170 ax-1rid 11171 ax-rnegex 11172 ax-rrecex 11173 ax-cnre 11174 ax-pre-lttri 11175 ax-pre-lttrn 11176 ax-pre-ltadd 11177 ax-pre-mulgt0 11178 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3065 df-ral 3080 df-rex 3090 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3746 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4288 df-if 4489 df-pw 4565 df-sn 4591 df-pr 4593 df-op 4597 df-uni 4874 df-iun 4959 df-br 5111 df-opab 5175 df-mpt 5194 df-tr 5220 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7864 df-2nd 7988 df-frecs 8279 df-wrecs 8310 df-recs 8359 df-rdg 8398 df-er 8695 df-en 8945 df-dom 8946 df-sdom 8947 df-pnf 11246 df-mnf 11247 df-xr 11248 df-ltxr 11249 df-le 11250 df-sub 11444 df-neg 11445 df-div 11873 df-nn 12235 df-2 12304 df-cj 15152 df-re 15153 df-im 15154 |
| This theorem is referenced by: imsub 15188 cjadd 15194 imaddi 15238 imaddd 15268 fsumim 15863 gzaddcl 16998 logrnaddcl 26717 logimul 26757 atancj 27053 atanlogaddlem 27056 atanlogsublem 27058 |
| Copyright terms: Public domain | W3C validator |