| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > imneg | GIF version | ||
| Description: The imaginary part of a negative number. (Contributed by NM, 18-Mar-2005.) (Revised by Mario Carneiro, 14-Jul-2014.) |
| Ref | Expression |
|---|---|
| imneg | ⊢ (𝐴 ∈ ℂ → (ℑ‘-𝐴) = -(ℑ‘𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | recl 11618 | . . . . . 6 ⊢ (𝐴 ∈ ℂ → (ℜ‘𝐴) ∈ ℝ) | |
| 2 | 1 | recnd 8354 | . . . . 5 ⊢ (𝐴 ∈ ℂ → (ℜ‘𝐴) ∈ ℂ) |
| 3 | ax-icn 8274 | . . . . . 6 ⊢ i ∈ ℂ | |
| 4 | imcl 11619 | . . . . . . 7 ⊢ (𝐴 ∈ ℂ → (ℑ‘𝐴) ∈ ℝ) | |
| 5 | 4 | recnd 8354 | . . . . . 6 ⊢ (𝐴 ∈ ℂ → (ℑ‘𝐴) ∈ ℂ) |
| 6 | mulcl 8306 | . . . . . 6 ⊢ ((i ∈ ℂ ∧ (ℑ‘𝐴) ∈ ℂ) → (i · (ℑ‘𝐴)) ∈ ℂ) | |
| 7 | 3, 5, 6 | sylancr 418 | . . . . 5 ⊢ (𝐴 ∈ ℂ → (i · (ℑ‘𝐴)) ∈ ℂ) |
| 8 | 2, 7 | negdid 8650 | . . . 4 ⊢ (𝐴 ∈ ℂ → -((ℜ‘𝐴) + (i · (ℑ‘𝐴))) = (-(ℜ‘𝐴) + -(i · (ℑ‘𝐴)))) |
| 9 | replim 11624 | . . . . 5 ⊢ (𝐴 ∈ ℂ → 𝐴 = ((ℜ‘𝐴) + (i · (ℑ‘𝐴)))) | |
| 10 | 9 | negeqd 8521 | . . . 4 ⊢ (𝐴 ∈ ℂ → -𝐴 = -((ℜ‘𝐴) + (i · (ℑ‘𝐴)))) |
| 11 | mulneg2 8723 | . . . . . 6 ⊢ ((i ∈ ℂ ∧ (ℑ‘𝐴) ∈ ℂ) → (i · -(ℑ‘𝐴)) = -(i · (ℑ‘𝐴))) | |
| 12 | 3, 5, 11 | sylancr 418 | . . . . 5 ⊢ (𝐴 ∈ ℂ → (i · -(ℑ‘𝐴)) = -(i · (ℑ‘𝐴))) |
| 13 | 12 | oveq2d 6101 | . . . 4 ⊢ (𝐴 ∈ ℂ → (-(ℜ‘𝐴) + (i · -(ℑ‘𝐴))) = (-(ℜ‘𝐴) + -(i · (ℑ‘𝐴)))) |
| 14 | 8, 10, 13 | 3eqtr4d 2281 | . . 3 ⊢ (𝐴 ∈ ℂ → -𝐴 = (-(ℜ‘𝐴) + (i · -(ℑ‘𝐴)))) |
| 15 | 14 | fveq2d 5699 | . 2 ⊢ (𝐴 ∈ ℂ → (ℑ‘-𝐴) = (ℑ‘(-(ℜ‘𝐴) + (i · -(ℑ‘𝐴))))) |
| 16 | 1 | renegcld 8707 | . . 3 ⊢ (𝐴 ∈ ℂ → -(ℜ‘𝐴) ∈ ℝ) |
| 17 | 4 | renegcld 8707 | . . 3 ⊢ (𝐴 ∈ ℂ → -(ℑ‘𝐴) ∈ ℝ) |
| 18 | crim 11623 | . . 3 ⊢ ((-(ℜ‘𝐴) ∈ ℝ ∧ -(ℑ‘𝐴) ∈ ℝ) → (ℑ‘(-(ℜ‘𝐴) + (i · -(ℑ‘𝐴)))) = -(ℑ‘𝐴)) | |
| 19 | 16, 17, 18 | syl2anc 415 | . 2 ⊢ (𝐴 ∈ ℂ → (ℑ‘(-(ℜ‘𝐴) + (i · -(ℑ‘𝐴)))) = -(ℑ‘𝐴)) |
| 20 | 15, 19 | eqtrd 2271 | 1 ⊢ (𝐴 ∈ ℂ → (ℑ‘-𝐴) = -(ℑ‘𝐴)) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: → wi 4 = wceq 1402 ∈ wcel 2209 ‘cfv 5377 (class class class)co 6085 ℂcc 8177 ℝcr 8178 ici 8181 + caddc 8182 · cmul 8184 -cneg 8498 ℜcre 11605 ℑcim 11606 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-sep 4249 ax-pow 4311 ax-pr 4346 ax-un 4578 ax-setind 4684 ax-cnex 8270 ax-resscn 8271 ax-1cn 8272 ax-1re 8273 ax-icn 8274 ax-addcl 8275 ax-addrcl 8276 ax-mulcl 8277 ax-mulrcl 8278 ax-addcom 8279 ax-mulcom 8280 ax-addass 8281 ax-mulass 8282 ax-distr 8283 ax-i2m1 8284 ax-0lt1 8285 ax-1rid 8286 ax-0id 8287 ax-rnegex 8288 ax-precex 8289 ax-cnre 8290 ax-pre-ltirr 8291 ax-pre-ltwlin 8292 ax-pre-lttrn 8293 ax-pre-apti 8294 ax-pre-ltadd 8295 ax-pre-mulgt0 8296 ax-pre-mulext 8297 |
| This proof depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-nel 2516 df-ral 2533 df-rex 2534 df-reu 2535 df-rmo 2536 df-rab 2537 df-v 2823 df-sbc 3052 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-pw 3690 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-br 4131 df-opab 4193 df-mpt 4194 df-id 4438 df-po 4441 df-iso 4442 df-xp 4780 df-rel 4781 df-cnv 4782 df-co 4783 df-dm 4784 df-rn 4785 df-res 4786 df-ima 4787 df-iota 5337 df-fun 5379 df-fn 5380 df-f 5381 df-fv 5385 df-riota 6038 df-ov 6088 df-oprab 6089 df-mpo 6090 df-pnf 8362 df-mnf 8363 df-xr 8364 df-ltxr 8365 df-le 8366 df-sub 8499 df-neg 8500 df-reap 8903 df-ap 8910 df-div 9003 df-2 9363 df-cj 11607 df-re 11608 df-im 11609 |
| This theorem is used by: imsub 11643 cjneg 11655 imnegi 11691 imnegd 11721 |
| Copyright terms: Public domain | W3C validator |