| 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 11482 | . . . 4 ⊢ (𝐵 ∈ ℂ → -𝐵 ∈ ℂ) | |
| 2 | imadd 15222 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ -𝐵 ∈ ℂ) → (ℑ‘(𝐴 + -𝐵)) = ((ℑ‘𝐴) + (ℑ‘-𝐵))) | |
| 3 | 1, 2 | sylan2 605 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (ℑ‘(𝐴 + -𝐵)) = ((ℑ‘𝐴) + (ℑ‘-𝐵))) |
| 4 | imneg 15221 | . . . . 5 ⊢ (𝐵 ∈ ℂ → (ℑ‘-𝐵) = -(ℑ‘𝐵)) | |
| 5 | 4 | adantl 487 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (ℑ‘-𝐵) = -(ℑ‘𝐵)) |
| 6 | 5 | oveq2d 7430 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((ℑ‘𝐴) + (ℑ‘-𝐵)) = ((ℑ‘𝐴) + -(ℑ‘𝐵))) |
| 7 | 3, 6 | eqtrd 2795 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (ℑ‘(𝐴 + -𝐵)) = ((ℑ‘𝐴) + -(ℑ‘𝐵))) |
| 8 | negsub 11531 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 + -𝐵) = (𝐴 − 𝐵)) | |
| 9 | 8 | fveq2d 6883 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (ℑ‘(𝐴 + -𝐵)) = (ℑ‘(𝐴 − 𝐵))) |
| 10 | imcl 15199 | . . . 4 ⊢ (𝐴 ∈ ℂ → (ℑ‘𝐴) ∈ ℝ) | |
| 11 | 10 | recnd 11262 | . . 3 ⊢ (𝐴 ∈ ℂ → (ℑ‘𝐴) ∈ ℂ) |
| 12 | imcl 15199 | . . . 4 ⊢ (𝐵 ∈ ℂ → (ℑ‘𝐵) ∈ ℝ) | |
| 13 | 12 | recnd 11262 | . . 3 ⊢ (𝐵 ∈ ℂ → (ℑ‘𝐵) ∈ ℂ) |
| 14 | negsub 11531 | . . 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 1570 ∈ wcel 2145 ‘cfv 6533 (class class class)co 7414 ℂcc 11123 + caddc 11128 − cmin 11466 -cneg 11467 ℑcim 15186 |
| 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 7737 ax-resscn 11182 ax-1cn 11183 ax-icn 11184 ax-addcl 11185 ax-addrcl 11186 ax-mulcl 11187 ax-mulrcl 11188 ax-mulcom 11189 ax-addass 11190 ax-mulass 11191 ax-distr 11192 ax-i2m1 11193 ax-1ne0 11194 ax-1rid 11195 ax-rnegex 11196 ax-rrecex 11197 ax-cnre 11198 ax-pre-lttri 11199 ax-pre-lttrn 11200 ax-pre-ltadd 11201 ax-pre-mulgt0 11202 |
| 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 7371 df-ov 7417 df-oprab 7418 df-mpo 7419 df-om 7864 df-2nd 7988 df-frecs 8281 df-wrecs 8312 df-recs 8361 df-rdg 8400 df-er 8697 df-en 8954 df-dom 8955 df-sdom 8956 df-pnf 11270 df-mnf 11271 df-xr 11272 df-ltxr 11273 df-le 11274 df-sub 11468 df-neg 11469 df-div 11897 df-nn 12259 df-2 12328 df-cj 15187 df-re 15188 df-im 15189 |
| This theorem is used by: imsubd 15305 imcn2 15690 caucvgr 15764 tanregt0 26777 logneg2 26853 logcnlem4 26883 atancj 27148 atanlogaddlem 27151 atanlogsublem 27153 |
| Copyright terms: Public domain | W3C validator |