| 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 11413 | . . . . . 6 ⊢ (𝐴 ∈ ℂ → (ℜ‘𝐴) ∈ ℝ) | |
| 2 | 1 | recnd 8207 | . . . . 5 ⊢ (𝐴 ∈ ℂ → (ℜ‘𝐴) ∈ ℂ) |
| 3 | ax-icn 8126 | . . . . . 6 ⊢ i ∈ ℂ | |
| 4 | imcl 11414 | . . . . . . 7 ⊢ (𝐴 ∈ ℂ → (ℑ‘𝐴) ∈ ℝ) | |
| 5 | 4 | recnd 8207 | . . . . . 6 ⊢ (𝐴 ∈ ℂ → (ℑ‘𝐴) ∈ ℂ) |
| 6 | mulcl 8158 | . . . . . 6 ⊢ ((i ∈ ℂ ∧ (ℑ‘𝐴) ∈ ℂ) → (i · (ℑ‘𝐴)) ∈ ℂ) | |
| 7 | 3, 5, 6 | sylancr 414 | . . . . 5 ⊢ (𝐴 ∈ ℂ → (i · (ℑ‘𝐴)) ∈ ℂ) |
| 8 | 2, 7 | negdid 8502 | . . . 4 ⊢ (𝐴 ∈ ℂ → -((ℜ‘𝐴) + (i · (ℑ‘𝐴))) = (-(ℜ‘𝐴) + -(i · (ℑ‘𝐴)))) |
| 9 | replim 11419 | . . . . 5 ⊢ (𝐴 ∈ ℂ → 𝐴 = ((ℜ‘𝐴) + (i · (ℑ‘𝐴)))) | |
| 10 | 9 | negeqd 8373 | . . . 4 ⊢ (𝐴 ∈ ℂ → -𝐴 = -((ℜ‘𝐴) + (i · (ℑ‘𝐴)))) |
| 11 | mulneg2 8574 | . . . . . 6 ⊢ ((i ∈ ℂ ∧ (ℑ‘𝐴) ∈ ℂ) → (i · -(ℑ‘𝐴)) = -(i · (ℑ‘𝐴))) | |
| 12 | 3, 5, 11 | sylancr 414 | . . . . 5 ⊢ (𝐴 ∈ ℂ → (i · -(ℑ‘𝐴)) = -(i · (ℑ‘𝐴))) |
| 13 | 12 | oveq2d 6033 | . . . 4 ⊢ (𝐴 ∈ ℂ → (-(ℜ‘𝐴) + (i · -(ℑ‘𝐴))) = (-(ℜ‘𝐴) + -(i · (ℑ‘𝐴)))) |
| 14 | 8, 10, 13 | 3eqtr4d 2274 | . . 3 ⊢ (𝐴 ∈ ℂ → -𝐴 = (-(ℜ‘𝐴) + (i · -(ℑ‘𝐴)))) |
| 15 | 14 | fveq2d 5643 | . 2 ⊢ (𝐴 ∈ ℂ → (ℑ‘-𝐴) = (ℑ‘(-(ℜ‘𝐴) + (i · -(ℑ‘𝐴))))) |
| 16 | 1 | renegcld 8558 | . . 3 ⊢ (𝐴 ∈ ℂ → -(ℜ‘𝐴) ∈ ℝ) |
| 17 | 4 | renegcld 8558 | . . 3 ⊢ (𝐴 ∈ ℂ → -(ℑ‘𝐴) ∈ ℝ) |
| 18 | crim 11418 | . . 3 ⊢ ((-(ℜ‘𝐴) ∈ ℝ ∧ -(ℑ‘𝐴) ∈ ℝ) → (ℑ‘(-(ℜ‘𝐴) + (i · -(ℑ‘𝐴)))) = -(ℑ‘𝐴)) | |
| 19 | 16, 17, 18 | syl2anc 411 | . 2 ⊢ (𝐴 ∈ ℂ → (ℑ‘(-(ℜ‘𝐴) + (i · -(ℑ‘𝐴)))) = -(ℑ‘𝐴)) |
| 20 | 15, 19 | eqtrd 2264 | 1 ⊢ (𝐴 ∈ ℂ → (ℑ‘-𝐴) = -(ℑ‘𝐴)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1397 ∈ wcel 2202 ‘cfv 5326 (class class class)co 6017 ℂcc 8029 ℝcr 8030 ici 8033 + caddc 8034 · cmul 8036 -cneg 8350 ℜcre 11400 ℑcim 11401 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 619 ax-in2 620 ax-io 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-13 2204 ax-14 2205 ax-ext 2213 ax-sep 4207 ax-pow 4264 ax-pr 4299 ax-un 4530 ax-setind 4635 ax-cnex 8122 ax-resscn 8123 ax-1cn 8124 ax-1re 8125 ax-icn 8126 ax-addcl 8127 ax-addrcl 8128 ax-mulcl 8129 ax-mulrcl 8130 ax-addcom 8131 ax-mulcom 8132 ax-addass 8133 ax-mulass 8134 ax-distr 8135 ax-i2m1 8136 ax-0lt1 8137 ax-1rid 8138 ax-0id 8139 ax-rnegex 8140 ax-precex 8141 ax-cnre 8142 ax-pre-ltirr 8143 ax-pre-ltwlin 8144 ax-pre-lttrn 8145 ax-pre-apti 8146 ax-pre-ltadd 8147 ax-pre-mulgt0 8148 ax-pre-mulext 8149 |
| This theorem depends on definitions: df-bi 117 df-3an 1006 df-tru 1400 df-fal 1403 df-nf 1509 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-ne 2403 df-nel 2498 df-ral 2515 df-rex 2516 df-reu 2517 df-rmo 2518 df-rab 2519 df-v 2804 df-sbc 3032 df-dif 3202 df-un 3204 df-in 3206 df-ss 3213 df-pw 3654 df-sn 3675 df-pr 3676 df-op 3678 df-uni 3894 df-br 4089 df-opab 4151 df-mpt 4152 df-id 4390 df-po 4393 df-iso 4394 df-xp 4731 df-rel 4732 df-cnv 4733 df-co 4734 df-dm 4735 df-rn 4736 df-res 4737 df-ima 4738 df-iota 5286 df-fun 5328 df-fn 5329 df-f 5330 df-fv 5334 df-riota 5970 df-ov 6020 df-oprab 6021 df-mpo 6022 df-pnf 8215 df-mnf 8216 df-xr 8217 df-ltxr 8218 df-le 8219 df-sub 8351 df-neg 8352 df-reap 8754 df-ap 8761 df-div 8852 df-2 9201 df-cj 11402 df-re 11403 df-im 11404 |
| This theorem is referenced by: imsub 11438 cjneg 11450 imnegi 11485 imnegd 11515 |
| Copyright terms: Public domain | W3C validator |