![]() |
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 10341 | . . . . 5 ⊢ (𝐴 ∈ ℂ → (ℜ‘𝐴) ∈ ℝ) | |
2 | 1 | recnd 7570 | . . . 4 ⊢ (𝐴 ∈ ℂ → (ℜ‘𝐴) ∈ ℂ) |
3 | ax-icn 7494 | . . . . 5 ⊢ i ∈ ℂ | |
4 | imcl 10342 | . . . . . 6 ⊢ (𝐴 ∈ ℂ → (ℑ‘𝐴) ∈ ℝ) | |
5 | 4 | recnd 7570 | . . . . 5 ⊢ (𝐴 ∈ ℂ → (ℑ‘𝐴) ∈ ℂ) |
6 | mulcl 7523 | . . . . 5 ⊢ ((i ∈ ℂ ∧ (ℑ‘𝐴) ∈ ℂ) → (i · (ℑ‘𝐴)) ∈ ℂ) | |
7 | 3, 5, 6 | sylancr 406 | . . . 4 ⊢ (𝐴 ∈ ℂ → (i · (ℑ‘𝐴)) ∈ ℂ) |
8 | 2, 7 | neg2subd 7864 | . . 3 ⊢ (𝐴 ∈ ℂ → (-(ℜ‘𝐴) − -(i · (ℑ‘𝐴))) = ((i · (ℑ‘𝐴)) − (ℜ‘𝐴))) |
9 | reneg 10356 | . . . 4 ⊢ (𝐴 ∈ ℂ → (ℜ‘-𝐴) = -(ℜ‘𝐴)) | |
10 | imneg 10364 | . . . . . 6 ⊢ (𝐴 ∈ ℂ → (ℑ‘-𝐴) = -(ℑ‘𝐴)) | |
11 | 10 | oveq2d 5682 | . . . . 5 ⊢ (𝐴 ∈ ℂ → (i · (ℑ‘-𝐴)) = (i · -(ℑ‘𝐴))) |
12 | mulneg2 7928 | . . . . . 6 ⊢ ((i ∈ ℂ ∧ (ℑ‘𝐴) ∈ ℂ) → (i · -(ℑ‘𝐴)) = -(i · (ℑ‘𝐴))) | |
13 | 3, 5, 12 | sylancr 406 | . . . . 5 ⊢ (𝐴 ∈ ℂ → (i · -(ℑ‘𝐴)) = -(i · (ℑ‘𝐴))) |
14 | 11, 13 | eqtrd 2121 | . . . 4 ⊢ (𝐴 ∈ ℂ → (i · (ℑ‘-𝐴)) = -(i · (ℑ‘𝐴))) |
15 | 9, 14 | oveq12d 5684 | . . 3 ⊢ (𝐴 ∈ ℂ → ((ℜ‘-𝐴) − (i · (ℑ‘-𝐴))) = (-(ℜ‘𝐴) − -(i · (ℑ‘𝐴)))) |
16 | 2, 7 | negsubdi2d 7863 | . . 3 ⊢ (𝐴 ∈ ℂ → -((ℜ‘𝐴) − (i · (ℑ‘𝐴))) = ((i · (ℑ‘𝐴)) − (ℜ‘𝐴))) |
17 | 8, 15, 16 | 3eqtr4d 2131 | . 2 ⊢ (𝐴 ∈ ℂ → ((ℜ‘-𝐴) − (i · (ℑ‘-𝐴))) = -((ℜ‘𝐴) − (i · (ℑ‘𝐴)))) |
18 | negcl 7736 | . . 3 ⊢ (𝐴 ∈ ℂ → -𝐴 ∈ ℂ) | |
19 | remim 10348 | . . 3 ⊢ (-𝐴 ∈ ℂ → (∗‘-𝐴) = ((ℜ‘-𝐴) − (i · (ℑ‘-𝐴)))) | |
20 | 18, 19 | syl 14 | . 2 ⊢ (𝐴 ∈ ℂ → (∗‘-𝐴) = ((ℜ‘-𝐴) − (i · (ℑ‘-𝐴)))) |
21 | remim 10348 | . . 3 ⊢ (𝐴 ∈ ℂ → (∗‘𝐴) = ((ℜ‘𝐴) − (i · (ℑ‘𝐴)))) | |
22 | 21 | negeqd 7731 | . 2 ⊢ (𝐴 ∈ ℂ → -(∗‘𝐴) = -((ℜ‘𝐴) − (i · (ℑ‘𝐴)))) |
23 | 17, 20, 22 | 3eqtr4d 2131 | 1 ⊢ (𝐴 ∈ ℂ → (∗‘-𝐴) = -(∗‘𝐴)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 = wceq 1290 ∈ wcel 1439 ‘cfv 5028 (class class class)co 5666 ℂcc 7402 ici 7406 · cmul 7409 − cmin 7707 -cneg 7708 ∗ccj 10327 ℜcre 10328 ℑcim 10329 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 580 ax-in2 581 ax-io 666 ax-5 1382 ax-7 1383 ax-gen 1384 ax-ie1 1428 ax-ie2 1429 ax-8 1441 ax-10 1442 ax-11 1443 ax-i12 1444 ax-bndl 1445 ax-4 1446 ax-13 1450 ax-14 1451 ax-17 1465 ax-i9 1469 ax-ial 1473 ax-i5r 1474 ax-ext 2071 ax-sep 3963 ax-pow 4015 ax-pr 4045 ax-un 4269 ax-setind 4366 ax-cnex 7490 ax-resscn 7491 ax-1cn 7492 ax-1re 7493 ax-icn 7494 ax-addcl 7495 ax-addrcl 7496 ax-mulcl 7497 ax-mulrcl 7498 ax-addcom 7499 ax-mulcom 7500 ax-addass 7501 ax-mulass 7502 ax-distr 7503 ax-i2m1 7504 ax-0lt1 7505 ax-1rid 7506 ax-0id 7507 ax-rnegex 7508 ax-precex 7509 ax-cnre 7510 ax-pre-ltirr 7511 ax-pre-ltwlin 7512 ax-pre-lttrn 7513 ax-pre-apti 7514 ax-pre-ltadd 7515 ax-pre-mulgt0 7516 ax-pre-mulext 7517 |
This theorem depends on definitions: df-bi 116 df-3an 927 df-tru 1293 df-fal 1296 df-nf 1396 df-sb 1694 df-eu 1952 df-mo 1953 df-clab 2076 df-cleq 2082 df-clel 2085 df-nfc 2218 df-ne 2257 df-nel 2352 df-ral 2365 df-rex 2366 df-reu 2367 df-rmo 2368 df-rab 2369 df-v 2622 df-sbc 2842 df-dif 3002 df-un 3004 df-in 3006 df-ss 3013 df-pw 3435 df-sn 3456 df-pr 3457 df-op 3459 df-uni 3660 df-br 3852 df-opab 3906 df-mpt 3907 df-id 4129 df-po 4132 df-iso 4133 df-xp 4457 df-rel 4458 df-cnv 4459 df-co 4460 df-dm 4461 df-rn 4462 df-res 4463 df-ima 4464 df-iota 4993 df-fun 5030 df-fn 5031 df-f 5032 df-fv 5036 df-riota 5622 df-ov 5669 df-oprab 5670 df-mpt2 5671 df-pnf 7578 df-mnf 7579 df-xr 7580 df-ltxr 7581 df-le 7582 df-sub 7709 df-neg 7710 df-reap 8106 df-ap 8113 df-div 8194 df-2 8535 df-cj 10330 df-re 10331 df-im 10332 |
This theorem is referenced by: cjsub 10380 cjnegi 10414 cjnegd 10444 absneg 10537 |
Copyright terms: Public domain | W3C validator |