| 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 15019 | . . . . . . 7 ⊢ (𝐴 ∈ ℂ → (ℜ‘𝐴) ∈ ℝ) | |
| 2 | 1 | adantr 480 | . . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (ℜ‘𝐴) ∈ ℝ) |
| 3 | 2 | recnd 11147 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (ℜ‘𝐴) ∈ ℂ) |
| 4 | ax-icn 11072 | . . . . . 6 ⊢ i ∈ ℂ | |
| 5 | imcl 15020 | . . . . . . . 8 ⊢ (𝐴 ∈ ℂ → (ℑ‘𝐴) ∈ ℝ) | |
| 6 | 5 | adantr 480 | . . . . . . 7 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (ℑ‘𝐴) ∈ ℝ) |
| 7 | 6 | recnd 11147 | . . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (ℑ‘𝐴) ∈ ℂ) |
| 8 | mulcl 11097 | . . . . . 6 ⊢ ((i ∈ ℂ ∧ (ℑ‘𝐴) ∈ ℂ) → (i · (ℑ‘𝐴)) ∈ ℂ) | |
| 9 | 4, 7, 8 | sylancr 587 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (i · (ℑ‘𝐴)) ∈ ℂ) |
| 10 | recl 15019 | . . . . . . 7 ⊢ (𝐵 ∈ ℂ → (ℜ‘𝐵) ∈ ℝ) | |
| 11 | 10 | adantl 481 | . . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (ℜ‘𝐵) ∈ ℝ) |
| 12 | 11 | recnd 11147 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (ℜ‘𝐵) ∈ ℂ) |
| 13 | imcl 15020 | . . . . . . . 8 ⊢ (𝐵 ∈ ℂ → (ℑ‘𝐵) ∈ ℝ) | |
| 14 | 13 | adantl 481 | . . . . . . 7 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (ℑ‘𝐵) ∈ ℝ) |
| 15 | 14 | recnd 11147 | . . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (ℑ‘𝐵) ∈ ℂ) |
| 16 | mulcl 11097 | . . . . . 6 ⊢ ((i ∈ ℂ ∧ (ℑ‘𝐵) ∈ ℂ) → (i · (ℑ‘𝐵)) ∈ ℂ) | |
| 17 | 4, 15, 16 | sylancr 587 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (i · (ℑ‘𝐵)) ∈ ℂ) |
| 18 | 3, 9, 12, 17 | add4d 11349 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (((ℜ‘𝐴) + (i · (ℑ‘𝐴))) + ((ℜ‘𝐵) + (i · (ℑ‘𝐵)))) = (((ℜ‘𝐴) + (ℜ‘𝐵)) + ((i · (ℑ‘𝐴)) + (i · (ℑ‘𝐵))))) |
| 19 | replim 15025 | . . . . 5 ⊢ (𝐴 ∈ ℂ → 𝐴 = ((ℜ‘𝐴) + (i · (ℑ‘𝐴)))) | |
| 20 | replim 15025 | . . . . 5 ⊢ (𝐵 ∈ ℂ → 𝐵 = ((ℜ‘𝐵) + (i · (ℑ‘𝐵)))) | |
| 21 | 19, 20 | oveqan12d 7371 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 + 𝐵) = (((ℜ‘𝐴) + (i · (ℑ‘𝐴))) + ((ℜ‘𝐵) + (i · (ℑ‘𝐵))))) |
| 22 | 4 | a1i 11 | . . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → i ∈ ℂ) |
| 23 | 22, 7, 15 | adddid 11143 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (i · ((ℑ‘𝐴) + (ℑ‘𝐵))) = ((i · (ℑ‘𝐴)) + (i · (ℑ‘𝐵)))) |
| 24 | 23 | oveq2d 7368 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (((ℜ‘𝐴) + (ℜ‘𝐵)) + (i · ((ℑ‘𝐴) + (ℑ‘𝐵)))) = (((ℜ‘𝐴) + (ℜ‘𝐵)) + ((i · (ℑ‘𝐴)) + (i · (ℑ‘𝐵))))) |
| 25 | 18, 21, 24 | 3eqtr4d 2778 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 + 𝐵) = (((ℜ‘𝐴) + (ℜ‘𝐵)) + (i · ((ℑ‘𝐴) + (ℑ‘𝐵))))) |
| 26 | 25 | fveq2d 6832 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (ℑ‘(𝐴 + 𝐵)) = (ℑ‘(((ℜ‘𝐴) + (ℜ‘𝐵)) + (i · ((ℑ‘𝐴) + (ℑ‘𝐵)))))) |
| 27 | readdcl 11096 | . . . 4 ⊢ (((ℜ‘𝐴) ∈ ℝ ∧ (ℜ‘𝐵) ∈ ℝ) → ((ℜ‘𝐴) + (ℜ‘𝐵)) ∈ ℝ) | |
| 28 | 1, 10, 27 | syl2an 596 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((ℜ‘𝐴) + (ℜ‘𝐵)) ∈ ℝ) |
| 29 | readdcl 11096 | . . . 4 ⊢ (((ℑ‘𝐴) ∈ ℝ ∧ (ℑ‘𝐵) ∈ ℝ) → ((ℑ‘𝐴) + (ℑ‘𝐵)) ∈ ℝ) | |
| 30 | 5, 13, 29 | syl2an 596 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((ℑ‘𝐴) + (ℑ‘𝐵)) ∈ ℝ) |
| 31 | crim 15024 | . . 3 ⊢ ((((ℜ‘𝐴) + (ℜ‘𝐵)) ∈ ℝ ∧ ((ℑ‘𝐴) + (ℑ‘𝐵)) ∈ ℝ) → (ℑ‘(((ℜ‘𝐴) + (ℜ‘𝐵)) + (i · ((ℑ‘𝐴) + (ℑ‘𝐵))))) = ((ℑ‘𝐴) + (ℑ‘𝐵))) | |
| 32 | 28, 30, 31 | syl2anc 584 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (ℑ‘(((ℜ‘𝐴) + (ℜ‘𝐵)) + (i · ((ℑ‘𝐴) + (ℑ‘𝐵))))) = ((ℑ‘𝐴) + (ℑ‘𝐵))) |
| 33 | 26, 32 | eqtrd 2768 | 1 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (ℑ‘(𝐴 + 𝐵)) = ((ℑ‘𝐴) + (ℑ‘𝐵))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1541 ∈ wcel 2113 ‘cfv 6486 (class class class)co 7352 ℂcc 11011 ℝcr 11012 ici 11015 + caddc 11016 · cmul 11018 ℜcre 15006 ℑcim 15007 |
| 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 5236 ax-nul 5246 ax-pow 5305 ax-pr 5372 ax-un 7674 ax-resscn 11070 ax-1cn 11071 ax-icn 11072 ax-addcl 11073 ax-addrcl 11074 ax-mulcl 11075 ax-mulrcl 11076 ax-mulcom 11077 ax-addass 11078 ax-mulass 11079 ax-distr 11080 ax-i2m1 11081 ax-1ne0 11082 ax-1rid 11083 ax-rnegex 11084 ax-rrecex 11085 ax-cnre 11086 ax-pre-lttri 11087 ax-pre-lttrn 11088 ax-pre-ltadd 11089 ax-pre-mulgt0 11090 |
| 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 4475 df-pw 4551 df-sn 4576 df-pr 4578 df-op 4582 df-uni 4859 df-iun 4943 df-br 5094 df-opab 5156 df-mpt 5175 df-tr 5201 df-id 5514 df-eprel 5519 df-po 5527 df-so 5528 df-fr 5572 df-we 5574 df-xp 5625 df-rel 5626 df-cnv 5627 df-co 5628 df-dm 5629 df-rn 5630 df-res 5631 df-ima 5632 df-pred 6253 df-ord 6314 df-on 6315 df-lim 6316 df-suc 6317 df-iota 6442 df-fun 6488 df-fn 6489 df-f 6490 df-f1 6491 df-fo 6492 df-f1o 6493 df-fv 6494 df-riota 7309 df-ov 7355 df-oprab 7356 df-mpo 7357 df-om 7803 df-2nd 7928 df-frecs 8217 df-wrecs 8248 df-recs 8297 df-rdg 8335 df-er 8628 df-en 8876 df-dom 8877 df-sdom 8878 df-pnf 11155 df-mnf 11156 df-xr 11157 df-ltxr 11158 df-le 11159 df-sub 11353 df-neg 11354 df-div 11782 df-nn 12133 df-2 12195 df-cj 15008 df-re 15009 df-im 15010 |
| This theorem is referenced by: imsub 15044 cjadd 15050 imaddi 15094 imaddd 15124 fsumim 15718 gzaddcl 16851 logrnaddcl 26511 logimul 26551 atancj 26848 atanlogaddlem 26851 atanlogsublem 26853 |
| Copyright terms: Public domain | W3C validator |