| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > cjneg | GIF version | ||
| Description: Complex conjugate of negative. (Contributed by NM, 27-Feb-2005.) (Revised by Mario Carneiro, 14-Jul-2014.) |
| Ref | Expression |
|---|---|
| cjneg | ⊢ (𝐴 ∈ ℂ → (∗‘-𝐴) = -(∗‘𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | recl 11164 | . . . . 5 ⊢ (𝐴 ∈ ℂ → (ℜ‘𝐴) ∈ ℝ) | |
| 2 | 1 | recnd 8101 | . . . 4 ⊢ (𝐴 ∈ ℂ → (ℜ‘𝐴) ∈ ℂ) |
| 3 | ax-icn 8020 | . . . . 5 ⊢ i ∈ ℂ | |
| 4 | imcl 11165 | . . . . . 6 ⊢ (𝐴 ∈ ℂ → (ℑ‘𝐴) ∈ ℝ) | |
| 5 | 4 | recnd 8101 | . . . . 5 ⊢ (𝐴 ∈ ℂ → (ℑ‘𝐴) ∈ ℂ) |
| 6 | mulcl 8052 | . . . . 5 ⊢ ((i ∈ ℂ ∧ (ℑ‘𝐴) ∈ ℂ) → (i · (ℑ‘𝐴)) ∈ ℂ) | |
| 7 | 3, 5, 6 | sylancr 414 | . . . 4 ⊢ (𝐴 ∈ ℂ → (i · (ℑ‘𝐴)) ∈ ℂ) |
| 8 | 2, 7 | neg2subd 8400 | . . 3 ⊢ (𝐴 ∈ ℂ → (-(ℜ‘𝐴) − -(i · (ℑ‘𝐴))) = ((i · (ℑ‘𝐴)) − (ℜ‘𝐴))) |
| 9 | reneg 11179 | . . . 4 ⊢ (𝐴 ∈ ℂ → (ℜ‘-𝐴) = -(ℜ‘𝐴)) | |
| 10 | imneg 11187 | . . . . . 6 ⊢ (𝐴 ∈ ℂ → (ℑ‘-𝐴) = -(ℑ‘𝐴)) | |
| 11 | 10 | oveq2d 5960 | . . . . 5 ⊢ (𝐴 ∈ ℂ → (i · (ℑ‘-𝐴)) = (i · -(ℑ‘𝐴))) |
| 12 | mulneg2 8468 | . . . . . 6 ⊢ ((i ∈ ℂ ∧ (ℑ‘𝐴) ∈ ℂ) → (i · -(ℑ‘𝐴)) = -(i · (ℑ‘𝐴))) | |
| 13 | 3, 5, 12 | sylancr 414 | . . . . 5 ⊢ (𝐴 ∈ ℂ → (i · -(ℑ‘𝐴)) = -(i · (ℑ‘𝐴))) |
| 14 | 11, 13 | eqtrd 2238 | . . . 4 ⊢ (𝐴 ∈ ℂ → (i · (ℑ‘-𝐴)) = -(i · (ℑ‘𝐴))) |
| 15 | 9, 14 | oveq12d 5962 | . . 3 ⊢ (𝐴 ∈ ℂ → ((ℜ‘-𝐴) − (i · (ℑ‘-𝐴))) = (-(ℜ‘𝐴) − -(i · (ℑ‘𝐴)))) |
| 16 | 2, 7 | negsubdi2d 8399 | . . 3 ⊢ (𝐴 ∈ ℂ → -((ℜ‘𝐴) − (i · (ℑ‘𝐴))) = ((i · (ℑ‘𝐴)) − (ℜ‘𝐴))) |
| 17 | 8, 15, 16 | 3eqtr4d 2248 | . 2 ⊢ (𝐴 ∈ ℂ → ((ℜ‘-𝐴) − (i · (ℑ‘-𝐴))) = -((ℜ‘𝐴) − (i · (ℑ‘𝐴)))) |
| 18 | negcl 8272 | . . 3 ⊢ (𝐴 ∈ ℂ → -𝐴 ∈ ℂ) | |
| 19 | remim 11171 | . . 3 ⊢ (-𝐴 ∈ ℂ → (∗‘-𝐴) = ((ℜ‘-𝐴) − (i · (ℑ‘-𝐴)))) | |
| 20 | 18, 19 | syl 14 | . 2 ⊢ (𝐴 ∈ ℂ → (∗‘-𝐴) = ((ℜ‘-𝐴) − (i · (ℑ‘-𝐴)))) |
| 21 | remim 11171 | . . 3 ⊢ (𝐴 ∈ ℂ → (∗‘𝐴) = ((ℜ‘𝐴) − (i · (ℑ‘𝐴)))) | |
| 22 | 21 | negeqd 8267 | . 2 ⊢ (𝐴 ∈ ℂ → -(∗‘𝐴) = -((ℜ‘𝐴) − (i · (ℑ‘𝐴)))) |
| 23 | 17, 20, 22 | 3eqtr4d 2248 | 1 ⊢ (𝐴 ∈ ℂ → (∗‘-𝐴) = -(∗‘𝐴)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1373 ∈ wcel 2176 ‘cfv 5271 (class class class)co 5944 ℂcc 7923 ici 7927 · cmul 7930 − cmin 8243 -cneg 8244 ∗ccj 11150 ℜcre 11151 ℑcim 11152 |
| 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 615 ax-in2 616 ax-io 711 ax-5 1470 ax-7 1471 ax-gen 1472 ax-ie1 1516 ax-ie2 1517 ax-8 1527 ax-10 1528 ax-11 1529 ax-i12 1530 ax-bndl 1532 ax-4 1533 ax-17 1549 ax-i9 1553 ax-ial 1557 ax-i5r 1558 ax-13 2178 ax-14 2179 ax-ext 2187 ax-sep 4162 ax-pow 4218 ax-pr 4253 ax-un 4480 ax-setind 4585 ax-cnex 8016 ax-resscn 8017 ax-1cn 8018 ax-1re 8019 ax-icn 8020 ax-addcl 8021 ax-addrcl 8022 ax-mulcl 8023 ax-mulrcl 8024 ax-addcom 8025 ax-mulcom 8026 ax-addass 8027 ax-mulass 8028 ax-distr 8029 ax-i2m1 8030 ax-0lt1 8031 ax-1rid 8032 ax-0id 8033 ax-rnegex 8034 ax-precex 8035 ax-cnre 8036 ax-pre-ltirr 8037 ax-pre-ltwlin 8038 ax-pre-lttrn 8039 ax-pre-apti 8040 ax-pre-ltadd 8041 ax-pre-mulgt0 8042 ax-pre-mulext 8043 |
| This theorem depends on definitions: df-bi 117 df-3an 983 df-tru 1376 df-fal 1379 df-nf 1484 df-sb 1786 df-eu 2057 df-mo 2058 df-clab 2192 df-cleq 2198 df-clel 2201 df-nfc 2337 df-ne 2377 df-nel 2472 df-ral 2489 df-rex 2490 df-reu 2491 df-rmo 2492 df-rab 2493 df-v 2774 df-sbc 2999 df-dif 3168 df-un 3170 df-in 3172 df-ss 3179 df-pw 3618 df-sn 3639 df-pr 3640 df-op 3642 df-uni 3851 df-br 4045 df-opab 4106 df-mpt 4107 df-id 4340 df-po 4343 df-iso 4344 df-xp 4681 df-rel 4682 df-cnv 4683 df-co 4684 df-dm 4685 df-rn 4686 df-res 4687 df-ima 4688 df-iota 5232 df-fun 5273 df-fn 5274 df-f 5275 df-fv 5279 df-riota 5899 df-ov 5947 df-oprab 5948 df-mpo 5949 df-pnf 8109 df-mnf 8110 df-xr 8111 df-ltxr 8112 df-le 8113 df-sub 8245 df-neg 8246 df-reap 8648 df-ap 8655 df-div 8746 df-2 9095 df-cj 11153 df-re 11154 df-im 11155 |
| This theorem is referenced by: cjsub 11203 cjnegi 11237 cjnegd 11267 absneg 11361 |
| Copyright terms: Public domain | W3C validator |