| 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 15309 | . . . . . . 7 ⊢ (𝐴 ∈ ℂ → (ℜ‘𝐴) ∈ ℝ) | |
| 2 | 1 | adantr 486 | . . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (ℜ‘𝐴) ∈ ℝ) |
| 3 | 2 | recnd 11367 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (ℜ‘𝐴) ∈ ℂ) |
| 4 | ax-icn 11289 | . . . . . 6 ⊢ i ∈ ℂ | |
| 5 | imcl 15310 | . . . . . . . 8 ⊢ (𝐴 ∈ ℂ → (ℑ‘𝐴) ∈ ℝ) | |
| 6 | 5 | adantr 486 | . . . . . . 7 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (ℑ‘𝐴) ∈ ℝ) |
| 7 | 6 | recnd 11367 | . . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (ℑ‘𝐴) ∈ ℂ) |
| 8 | mulcl 11314 | . . . . . 6 ⊢ ((i ∈ ℂ ∧ (ℑ‘𝐴) ∈ ℂ) → (i · (ℑ‘𝐴)) ∈ ℂ) | |
| 9 | 4, 7, 8 | sylancr 599 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (i · (ℑ‘𝐴)) ∈ ℂ) |
| 10 | recl 15309 | . . . . . . 7 ⊢ (𝐵 ∈ ℂ → (ℜ‘𝐵) ∈ ℝ) | |
| 11 | 10 | adantl 487 | . . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (ℜ‘𝐵) ∈ ℝ) |
| 12 | 11 | recnd 11367 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (ℜ‘𝐵) ∈ ℂ) |
| 13 | imcl 15310 | . . . . . . . 8 ⊢ (𝐵 ∈ ℂ → (ℑ‘𝐵) ∈ ℝ) | |
| 14 | 13 | adantl 487 | . . . . . . 7 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (ℑ‘𝐵) ∈ ℝ) |
| 15 | 14 | recnd 11367 | . . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (ℑ‘𝐵) ∈ ℂ) |
| 16 | mulcl 11314 | . . . . . 6 ⊢ ((i ∈ ℂ ∧ (ℑ‘𝐵) ∈ ℂ) → (i · (ℑ‘𝐵)) ∈ ℂ) | |
| 17 | 4, 15, 16 | sylancr 599 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (i · (ℑ‘𝐵)) ∈ ℂ) |
| 18 | 3, 9, 12, 17 | add4d 11569 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (((ℜ‘𝐴) + (i · (ℑ‘𝐴))) + ((ℜ‘𝐵) + (i · (ℑ‘𝐵)))) = (((ℜ‘𝐴) + (ℜ‘𝐵)) + ((i · (ℑ‘𝐴)) + (i · (ℑ‘𝐵))))) |
| 19 | replim 15315 | . . . . 5 ⊢ (𝐴 ∈ ℂ → 𝐴 = ((ℜ‘𝐴) + (i · (ℑ‘𝐴)))) | |
| 20 | replim 15315 | . . . . 5 ⊢ (𝐵 ∈ ℂ → 𝐵 = ((ℜ‘𝐵) + (i · (ℑ‘𝐵)))) | |
| 21 | 19, 20 | oveqan12d 7465 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 + 𝐵) = (((ℜ‘𝐴) + (i · (ℑ‘𝐴))) + ((ℜ‘𝐵) + (i · (ℑ‘𝐵))))) |
| 22 | 4 | a1i 11 | . . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → i ∈ ℂ) |
| 23 | 22, 7, 15 | adddid 11363 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (i · ((ℑ‘𝐴) + (ℑ‘𝐵))) = ((i · (ℑ‘𝐴)) + (i · (ℑ‘𝐵)))) |
| 24 | 23 | oveq2d 7462 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (((ℜ‘𝐴) + (ℜ‘𝐵)) + (i · ((ℑ‘𝐴) + (ℑ‘𝐵)))) = (((ℜ‘𝐴) + (ℜ‘𝐵)) + ((i · (ℑ‘𝐴)) + (i · (ℑ‘𝐵))))) |
| 25 | 18, 21, 24 | 3eqtr4d 2808 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 + 𝐵) = (((ℜ‘𝐴) + (ℜ‘𝐵)) + (i · ((ℑ‘𝐴) + (ℑ‘𝐵))))) |
| 26 | 25 | fveq2d 6915 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (ℑ‘(𝐴 + 𝐵)) = (ℑ‘(((ℜ‘𝐴) + (ℜ‘𝐵)) + (i · ((ℑ‘𝐴) + (ℑ‘𝐵)))))) |
| 27 | readdcl 11313 | . . . 4 ⊢ (((ℜ‘𝐴) ∈ ℝ ∧ (ℜ‘𝐵) ∈ ℝ) → ((ℜ‘𝐴) + (ℜ‘𝐵)) ∈ ℝ) | |
| 28 | 1, 10, 27 | syl2an 608 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((ℜ‘𝐴) + (ℜ‘𝐵)) ∈ ℝ) |
| 29 | readdcl 11313 | . . . 4 ⊢ (((ℑ‘𝐴) ∈ ℝ ∧ (ℑ‘𝐵) ∈ ℝ) → ((ℑ‘𝐴) + (ℑ‘𝐵)) ∈ ℝ) | |
| 30 | 5, 13, 29 | syl2an 608 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((ℑ‘𝐴) + (ℑ‘𝐵)) ∈ ℝ) |
| 31 | crim 15314 | . . 3 ⊢ ((((ℜ‘𝐴) + (ℜ‘𝐵)) ∈ ℝ ∧ ((ℑ‘𝐴) + (ℑ‘𝐵)) ∈ ℝ) → (ℑ‘(((ℜ‘𝐴) + (ℜ‘𝐵)) + (i · ((ℑ‘𝐴) + (ℑ‘𝐵))))) = ((ℑ‘𝐴) + (ℑ‘𝐵))) | |
| 32 | 28, 30, 31 | syl2anc 596 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (ℑ‘(((ℜ‘𝐴) + (ℜ‘𝐵)) + (i · ((ℑ‘𝐴) + (ℑ‘𝐵))))) = ((ℑ‘𝐴) + (ℑ‘𝐵))) |
| 33 | 26, 32 | eqtrd 2798 | 1 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (ℑ‘(𝐴 + 𝐵)) = ((ℑ‘𝐴) + (ℑ‘𝐵))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2147 ‘cfv 6561 (class class class)co 7446 ℂcc 11228 ℝcr 11229 ici 11232 + caddc 11233 · cmul 11235 ℜcre 15296 ℑcim 15297 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5253 ax-nul 5264 ax-pow 5332 ax-pr 5396 ax-un 7778 ax-resscn 11287 ax-1cn 11288 ax-icn 11289 ax-addcl 11290 ax-addrcl 11291 ax-mulcl 11292 ax-mulrcl 11293 ax-mulcom 11294 ax-addass 11295 ax-mulass 11296 ax-distr 11297 ax-i2m1 11298 ax-1ne0 11299 ax-1rid 11300 ax-rnegex 11301 ax-rrecex 11302 ax-cnre 11303 ax-pre-lttri 11304 ax-pre-lttrn 11305 ax-pre-ltadd 11306 ax-pre-mulgt0 11307 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-iun 4956 df-br 5107 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5551 df-eprel 5556 df-po 5564 df-so 5565 df-fr 5609 df-we 5611 df-xp 5662 df-rel 5663 df-cnv 5664 df-co 5665 df-dm 5666 df-rn 5667 df-res 5668 df-ima 5669 df-pred 6325 df-ord 6386 df-on 6387 df-lim 6388 df-suc 6389 df-iota 6515 df-fun 6563 df-fn 6564 df-f 6565 df-f1 6566 df-fo 6567 df-f1o 6568 df-fv 6569 df-riota 7403 df-ov 7449 df-oprab 7450 df-mpo 7451 df-om 7905 df-2nd 8029 df-frecs 8330 df-wrecs 8361 df-recs 8410 df-rdg 8449 df-er 8748 df-en 9005 df-dom 9006 df-sdom 9007 df-pnf 11375 df-mnf 11376 df-xr 11377 df-ltxr 11378 df-le 11379 df-sub 11573 df-neg 11574 df-div 12004 df-nn 12366 df-2 12435 df-cj 15298 df-re 15299 df-im 15300 |
| This theorem is used by: imsub 15334 cjadd 15340 imaddi 15384 imaddd 15414 fsumim 16008 gzaddcl 17147 logrnaddcl 26935 logimul 26975 atancj 27271 atanlogaddlem 27274 atanlogsublem 27276 |
| Copyright terms: Public domain | W3C validator |