| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > cjth | Structured version Visualization version GIF version | ||
| Description: The defining property of the complex conjugate. (Contributed by Mario Carneiro, 6-Nov-2013.) |
| Ref | Expression |
|---|---|
| cjth | ⊢ (𝐴 ∈ ℂ → ((𝐴 + (∗‘𝐴)) ∈ ℝ ∧ (i · (𝐴 − (∗‘𝐴))) ∈ ℝ)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cju 12124 | . . . 4 ⊢ (𝐴 ∈ ℂ → ∃!𝑥 ∈ ℂ ((𝐴 + 𝑥) ∈ ℝ ∧ (i · (𝐴 − 𝑥)) ∈ ℝ)) | |
| 2 | riotasbc 7324 | . . . 4 ⊢ (∃!𝑥 ∈ ℂ ((𝐴 + 𝑥) ∈ ℝ ∧ (i · (𝐴 − 𝑥)) ∈ ℝ) → [(℩𝑥 ∈ ℂ ((𝐴 + 𝑥) ∈ ℝ ∧ (i · (𝐴 − 𝑥)) ∈ ℝ)) / 𝑥]((𝐴 + 𝑥) ∈ ℝ ∧ (i · (𝐴 − 𝑥)) ∈ ℝ)) | |
| 3 | 1, 2 | syl 17 | . . 3 ⊢ (𝐴 ∈ ℂ → [(℩𝑥 ∈ ℂ ((𝐴 + 𝑥) ∈ ℝ ∧ (i · (𝐴 − 𝑥)) ∈ ℝ)) / 𝑥]((𝐴 + 𝑥) ∈ ℝ ∧ (i · (𝐴 − 𝑥)) ∈ ℝ)) |
| 4 | cjval 15009 | . . . 4 ⊢ (𝐴 ∈ ℂ → (∗‘𝐴) = (℩𝑥 ∈ ℂ ((𝐴 + 𝑥) ∈ ℝ ∧ (i · (𝐴 − 𝑥)) ∈ ℝ))) | |
| 5 | 4 | sbceq1d 3747 | . . 3 ⊢ (𝐴 ∈ ℂ → ([(∗‘𝐴) / 𝑥]((𝐴 + 𝑥) ∈ ℝ ∧ (i · (𝐴 − 𝑥)) ∈ ℝ) ↔ [(℩𝑥 ∈ ℂ ((𝐴 + 𝑥) ∈ ℝ ∧ (i · (𝐴 − 𝑥)) ∈ ℝ)) / 𝑥]((𝐴 + 𝑥) ∈ ℝ ∧ (i · (𝐴 − 𝑥)) ∈ ℝ))) |
| 6 | 3, 5 | mpbird 257 | . 2 ⊢ (𝐴 ∈ ℂ → [(∗‘𝐴) / 𝑥]((𝐴 + 𝑥) ∈ ℝ ∧ (i · (𝐴 − 𝑥)) ∈ ℝ)) |
| 7 | fvex 6835 | . . 3 ⊢ (∗‘𝐴) ∈ V | |
| 8 | oveq2 7357 | . . . . 5 ⊢ (𝑥 = (∗‘𝐴) → (𝐴 + 𝑥) = (𝐴 + (∗‘𝐴))) | |
| 9 | 8 | eleq1d 2813 | . . . 4 ⊢ (𝑥 = (∗‘𝐴) → ((𝐴 + 𝑥) ∈ ℝ ↔ (𝐴 + (∗‘𝐴)) ∈ ℝ)) |
| 10 | oveq2 7357 | . . . . . 6 ⊢ (𝑥 = (∗‘𝐴) → (𝐴 − 𝑥) = (𝐴 − (∗‘𝐴))) | |
| 11 | 10 | oveq2d 7365 | . . . . 5 ⊢ (𝑥 = (∗‘𝐴) → (i · (𝐴 − 𝑥)) = (i · (𝐴 − (∗‘𝐴)))) |
| 12 | 11 | eleq1d 2813 | . . . 4 ⊢ (𝑥 = (∗‘𝐴) → ((i · (𝐴 − 𝑥)) ∈ ℝ ↔ (i · (𝐴 − (∗‘𝐴))) ∈ ℝ)) |
| 13 | 9, 12 | anbi12d 632 | . . 3 ⊢ (𝑥 = (∗‘𝐴) → (((𝐴 + 𝑥) ∈ ℝ ∧ (i · (𝐴 − 𝑥)) ∈ ℝ) ↔ ((𝐴 + (∗‘𝐴)) ∈ ℝ ∧ (i · (𝐴 − (∗‘𝐴))) ∈ ℝ))) |
| 14 | 7, 13 | sbcie 3784 | . 2 ⊢ ([(∗‘𝐴) / 𝑥]((𝐴 + 𝑥) ∈ ℝ ∧ (i · (𝐴 − 𝑥)) ∈ ℝ) ↔ ((𝐴 + (∗‘𝐴)) ∈ ℝ ∧ (i · (𝐴 − (∗‘𝐴))) ∈ ℝ)) |
| 15 | 6, 14 | sylib 218 | 1 ⊢ (𝐴 ∈ ℂ → ((𝐴 + (∗‘𝐴)) ∈ ℝ ∧ (i · (𝐴 − (∗‘𝐴))) ∈ ℝ)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1540 ∈ wcel 2109 ∃!wreu 3341 [wsbc 3742 ‘cfv 6482 ℩crio 7305 (class class class)co 7349 ℂcc 11007 ℝcr 11008 ici 11011 + caddc 11012 · cmul 11014 − cmin 11347 ∗ccj 15003 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-sep 5235 ax-nul 5245 ax-pow 5304 ax-pr 5371 ax-un 7671 ax-resscn 11066 ax-1cn 11067 ax-icn 11068 ax-addcl 11069 ax-addrcl 11070 ax-mulcl 11071 ax-mulrcl 11072 ax-mulcom 11073 ax-addass 11074 ax-mulass 11075 ax-distr 11076 ax-i2m1 11077 ax-1ne0 11078 ax-1rid 11079 ax-rnegex 11080 ax-rrecex 11081 ax-cnre 11082 ax-pre-lttri 11083 ax-pre-lttrn 11084 ax-pre-ltadd 11085 ax-pre-mulgt0 11086 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-rmo 3343 df-reu 3344 df-rab 3395 df-v 3438 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-nul 4285 df-if 4477 df-pw 4553 df-sn 4578 df-pr 4580 df-op 4584 df-uni 4859 df-br 5093 df-opab 5155 df-mpt 5174 df-id 5514 df-po 5527 df-so 5528 df-xp 5625 df-rel 5626 df-cnv 5627 df-co 5628 df-dm 5629 df-rn 5630 df-res 5631 df-ima 5632 df-iota 6438 df-fun 6484 df-fn 6485 df-f 6486 df-f1 6487 df-fo 6488 df-f1o 6489 df-fv 6490 df-riota 7306 df-ov 7352 df-oprab 7353 df-mpo 7354 df-er 8625 df-en 8873 df-dom 8874 df-sdom 8875 df-pnf 11151 df-mnf 11152 df-xr 11153 df-ltxr 11154 df-le 11155 df-sub 11349 df-neg 11350 df-div 11778 df-cj 15006 |
| This theorem is referenced by: recl 15017 crre 15021 constrrecl 33736 |
| Copyright terms: Public domain | W3C validator |