| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > imsub | Structured version Visualization version GIF version | ||
| Description: Imaginary part distributes over subtraction. (Contributed by NM, 18-Mar-2005.) |
| Ref | Expression |
|---|---|
| imsub | ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (ℑ‘(𝐴 − 𝐵)) = ((ℑ‘𝐴) − (ℑ‘𝐵))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | negcl 11564 | . . . 4 ⊢ (𝐵 ∈ ℂ → -𝐵 ∈ ℂ) | |
| 2 | imadd 15310 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ -𝐵 ∈ ℂ) → (ℑ‘(𝐴 + -𝐵)) = ((ℑ‘𝐴) + (ℑ‘ -𝐵))) | |
| 3 | 1, 2 | sylan2 605 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (ℑ‘(𝐴 + -𝐵)) = ((ℑ‘𝐴) + (ℑ‘ -𝐵))) |
| 4 | imneg 15309 | . . . . 5 ⊢ (𝐵 ∈ ℂ → (ℑ‘ -𝐵) = -(ℑ‘𝐵)) | |
| 5 | 4 | adantl 487 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (ℑ‘ -𝐵) = -(ℑ‘𝐵)) |
| 6 | 5 | oveq2d 7440 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((ℑ‘𝐴) + (ℑ‘ -𝐵)) = ((ℑ‘𝐴) + -(ℑ‘𝐵))) |
| 7 | 3, 6 | eqtrd 2795 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (ℑ‘(𝐴 + -𝐵)) = ((ℑ‘𝐴) + -(ℑ‘𝐵))) |
| 8 | negsub 11613 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 + -𝐵) = (𝐴 − 𝐵)) | |
| 9 | 8 | fveq2d 6894 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (ℑ‘(𝐴 + -𝐵)) = (ℑ‘(𝐴 − 𝐵))) |
| 10 | imcl 15287 | . . . 4 ⊢ (𝐴 ∈ ℂ → (ℑ‘𝐴) ∈ ℝ) | |
| 11 | 10 | recnd 11344 | . . 3 ⊢ (𝐴 ∈ ℂ → (ℑ‘𝐴) ∈ ℂ) |
| 12 | imcl 15287 | . . . 4 ⊢ (𝐵 ∈ ℂ → (ℑ‘𝐵) ∈ ℝ) | |
| 13 | 12 | recnd 11344 | . . 3 ⊢ (𝐵 ∈ ℂ → (ℑ‘𝐵) ∈ ℂ) |
| 14 | negsub 11613 | . . 3 ⊢ (((ℑ‘𝐴) ∈ ℂ ∧ (ℑ‘𝐵) ∈ ℂ) → ((ℑ‘𝐴) + -(ℑ‘𝐵)) = ((ℑ‘𝐴) − (ℑ‘𝐵))) | |
| 15 | 11, 13, 14 | syl2an 608 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((ℑ‘𝐴) + -(ℑ‘𝐵)) = ((ℑ‘𝐴) − (ℑ‘𝐵))) |
| 16 | 7, 9, 15 | 3eqtr3d 2803 | 1 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (ℑ‘(𝐴 − 𝐵)) = ((ℑ‘𝐴) − (ℑ‘𝐵))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1569 ∈ wcel 2144 ‘cfv 6543 (class class class)co 7424 ℂcc 11205 + caddc 11210 − cmin 11548 -cneg 11549 ℑcim 15274 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pow 5327 ax-pr 5391 ax-un 7755 ax-resscn 11264 ax-1cn 11265 ax-icn 11266 ax-addcl 11267 ax-addrcl 11268 ax-mulcl 11269 ax-mulrcl 11270 ax-mulcom 11271 ax-addass 11272 ax-mulass 11273 ax-distr 11274 ax-i2m1 11275 ax-1ne0 11276 ax-1rid 11277 ax-rnegex 11278 ax-rrecex 11279 ax-cnre 11280 ax-pre-lttri 11281 ax-pre-lttrn 11282 ax-pre-ltadd 11283 ax-pre-mulgt0 11284 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 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 3739 df-csb 3848 df-ss 3897 df-pss 4013 df-dif 4046 df-in 4090 df-un 4150 df-nul 4278 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6307 df-ord 6368 df-on 6369 df-lim 6370 df-suc 6371 df-iota 6497 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-riota 7381 df-ov 7427 df-oprab 7428 df-mpo 7429 df-om 7882 df-2nd 8006 df-frecs 8307 df-wrecs 8338 df-recs 8387 df-rdg 8426 df-er 8725 df-en 8982 df-dom 8983 df-sdom 8984 df-pnf 11352 df-mnf 11353 df-xr 11354 df-ltxr 11355 df-le 11356 df-sub 11550 df-neg 11551 df-div 11981 df-nn 12343 df-2 12412 df-cj 15275 df-re 15276 df-im 15277 |
| This theorem is used by: imsubd 15393 imcn2 15778 caucvgr 15852 tanregt0 26876 logneg2 26952 logcnlem4 26982 atancj 27247 atanlogaddlem 27250 atanlogsublem 27252 |
| Copyright terms: Public domain | W3C validator |