| 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 11640 | . . . . 5 ⊢ (𝐴 ∈ ℂ → (ℜ‘𝐴) ∈ ℝ) | |
| 2 | 1 | recnd 8360 | . . . 4 ⊢ (𝐴 ∈ ℂ → (ℜ‘𝐴) ∈ ℂ) |
| 3 | ax-icn 8280 | . . . . 5 ⊢ i ∈ ℂ | |
| 4 | imcl 11641 | . . . . . 6 ⊢ (𝐴 ∈ ℂ → (ℑ‘𝐴) ∈ ℝ) | |
| 5 | 4 | recnd 8360 | . . . . 5 ⊢ (𝐴 ∈ ℂ → (ℑ‘𝐴) ∈ ℂ) |
| 6 | mulcl 8312 | . . . . 5 ⊢ ((i ∈ ℂ ∧ (ℑ‘𝐴) ∈ ℂ) → (i · (ℑ‘𝐴)) ∈ ℂ) | |
| 7 | 3, 5, 6 | sylancr 418 | . . . 4 ⊢ (𝐴 ∈ ℂ → (i · (ℑ‘𝐴)) ∈ ℂ) |
| 8 | 2, 7 | neg2subd 8661 | . . 3 ⊢ (𝐴 ∈ ℂ → ( -(ℜ‘𝐴) − -(i · (ℑ‘𝐴))) = ((i · (ℑ‘𝐴)) − (ℜ‘𝐴))) |
| 9 | reneg 11655 | . . . 4 ⊢ (𝐴 ∈ ℂ → (ℜ‘ -𝐴) = -(ℜ‘𝐴)) | |
| 10 | imneg 11663 | . . . . . 6 ⊢ (𝐴 ∈ ℂ → (ℑ‘ -𝐴) = -(ℑ‘𝐴)) | |
| 11 | 10 | oveq2d 6104 | . . . . 5 ⊢ (𝐴 ∈ ℂ → (i · (ℑ‘ -𝐴)) = (i · -(ℑ‘𝐴))) |
| 12 | mulneg2 8730 | . . . . . 6 ⊢ ((i ∈ ℂ ∧ (ℑ‘𝐴) ∈ ℂ) → (i · -(ℑ‘𝐴)) = -(i · (ℑ‘𝐴))) | |
| 13 | 3, 5, 12 | sylancr 418 | . . . . 5 ⊢ (𝐴 ∈ ℂ → (i · -(ℑ‘𝐴)) = -(i · (ℑ‘𝐴))) |
| 14 | 11, 13 | eqtrd 2271 | . . . 4 ⊢ (𝐴 ∈ ℂ → (i · (ℑ‘ -𝐴)) = -(i · (ℑ‘𝐴))) |
| 15 | 9, 14 | oveq12d 6106 | . . 3 ⊢ (𝐴 ∈ ℂ → ((ℜ‘ -𝐴) − (i · (ℑ‘ -𝐴))) = ( -(ℜ‘𝐴) − -(i · (ℑ‘𝐴)))) |
| 16 | 2, 7 | negsubdi2d 8660 | . . 3 ⊢ (𝐴 ∈ ℂ → -((ℜ‘𝐴) − (i · (ℑ‘𝐴))) = ((i · (ℑ‘𝐴)) − (ℜ‘𝐴))) |
| 17 | 8, 15, 16 | 3eqtr4d 2281 | . 2 ⊢ (𝐴 ∈ ℂ → ((ℜ‘ -𝐴) − (i · (ℑ‘ -𝐴))) = -((ℜ‘𝐴) − (i · (ℑ‘𝐴)))) |
| 18 | negcl 8533 | . . 3 ⊢ (𝐴 ∈ ℂ → -𝐴 ∈ ℂ) | |
| 19 | remim 11647 | . . 3 ⊢ ( -𝐴 ∈ ℂ → (∗‘ -𝐴) = ((ℜ‘ -𝐴) − (i · (ℑ‘ -𝐴)))) | |
| 20 | 18, 19 | syl 14 | . 2 ⊢ (𝐴 ∈ ℂ → (∗‘ -𝐴) = ((ℜ‘ -𝐴) − (i · (ℑ‘ -𝐴)))) |
| 21 | remim 11647 | . . 3 ⊢ (𝐴 ∈ ℂ → (∗‘𝐴) = ((ℜ‘𝐴) − (i · (ℑ‘𝐴)))) | |
| 22 | 21 | negeqd 8528 | . 2 ⊢ (𝐴 ∈ ℂ → -(∗‘𝐴) = -((ℜ‘𝐴) − (i · (ℑ‘𝐴)))) |
| 23 | 17, 20, 22 | 3eqtr4d 2281 | 1 ⊢ (𝐴 ∈ ℂ → (∗‘ -𝐴) = -(∗‘𝐴)) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: → wi 4 = wceq 1402 ∈ wcel 2209 ‘cfv 5380 (class class class)co 6088 ℂcc 8183 ici 8187 · cmul 8190 − cmin 8504 -cneg 8505 ∗ccj 11626 ℜcre 11627 ℑcim 11628 |
| 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 4251 ax-pow 4313 ax-pr 4348 ax-un 4580 ax-setind 4686 ax-cnex 8276 ax-resscn 8277 ax-1cn 8278 ax-1re 8279 ax-icn 8280 ax-addcl 8281 ax-addrcl 8282 ax-mulcl 8283 ax-mulrcl 8284 ax-addcom 8285 ax-mulcom 8286 ax-addass 8287 ax-mulass 8288 ax-distr 8289 ax-i2m1 8290 ax-0lt1 8291 ax-1rid 8292 ax-0id 8293 ax-rnegex 8294 ax-precex 8295 ax-cnre 8296 ax-pre-ltirr 8297 ax-pre-ltwlin 8298 ax-pre-lttrn 8299 ax-pre-apti 8300 ax-pre-ltadd 8301 ax-pre-mulgt0 8302 ax-pre-mulext 8303 |
| 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 4132 df-opab 4194 df-mpt 4195 df-id 4440 df-po 4443 df-iso 4444 df-xp 4782 df-rel 4783 df-cnv 4784 df-co 4785 df-dm 4786 df-rn 4787 df-res 4788 df-ima 4789 df-iota 5340 df-fun 5382 df-fn 5383 df-f 5384 df-fv 5388 df-riota 6041 df-ov 6091 df-oprab 6092 df-mpo 6093 df-pnf 8368 df-mnf 8369 df-xr 8370 df-ltxr 8371 df-le 8372 df-sub 8506 df-neg 8507 df-reap 8911 df-ap 8918 df-div 9011 df-2 9372 df-cj 11629 df-re 11630 df-im 11631 |
| This theorem is used by: cjsub 11679 cjnegi 11714 cjnegd 11744 absneg 11838 |
| Copyright terms: Public domain | W3C validator |