| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > cjreim | GIF version | ||
| Description: The conjugate of a representation of a complex number in terms of real and imaginary parts. (Contributed by NM, 1-Jul-2005.) |
| Ref | Expression |
|---|---|
| cjreim | ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (∗‘(𝐴 + (i · 𝐵))) = (𝐴 − (i · 𝐵))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | recn 8312 | . . 3 ⊢ (𝐴 ∈ ℝ → 𝐴 ∈ ℂ) | |
| 2 | ax-icn 8274 | . . . 4 ⊢ i ∈ ℂ | |
| 3 | recn 8312 | . . . 4 ⊢ (𝐵 ∈ ℝ → 𝐵 ∈ ℂ) | |
| 4 | mulcl 8306 | . . . 4 ⊢ ((i ∈ ℂ ∧ 𝐵 ∈ ℂ) → (i · 𝐵) ∈ ℂ) | |
| 5 | 2, 3, 4 | sylancr 418 | . . 3 ⊢ (𝐵 ∈ ℝ → (i · 𝐵) ∈ ℂ) |
| 6 | cjadd 11649 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ (i · 𝐵) ∈ ℂ) → (∗‘(𝐴 + (i · 𝐵))) = ((∗‘𝐴) + (∗‘(i · 𝐵)))) | |
| 7 | 1, 5, 6 | syl2an 289 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (∗‘(𝐴 + (i · 𝐵))) = ((∗‘𝐴) + (∗‘(i · 𝐵)))) |
| 8 | cjre 11647 | . . 3 ⊢ (𝐴 ∈ ℝ → (∗‘𝐴) = 𝐴) | |
| 9 | cjmul 11650 | . . . . 5 ⊢ ((i ∈ ℂ ∧ 𝐵 ∈ ℂ) → (∗‘(i · 𝐵)) = ((∗‘i) · (∗‘𝐵))) | |
| 10 | 2, 3, 9 | sylancr 418 | . . . 4 ⊢ (𝐵 ∈ ℝ → (∗‘(i · 𝐵)) = ((∗‘i) · (∗‘𝐵))) |
| 11 | cji 11668 | . . . . . 6 ⊢ (∗‘i) = -i | |
| 12 | 11 | a1i 9 | . . . . 5 ⊢ (𝐵 ∈ ℝ → (∗‘i) = -i) |
| 13 | cjre 11647 | . . . . 5 ⊢ (𝐵 ∈ ℝ → (∗‘𝐵) = 𝐵) | |
| 14 | 12, 13 | oveq12d 6103 | . . . 4 ⊢ (𝐵 ∈ ℝ → ((∗‘i) · (∗‘𝐵)) = (-i · 𝐵)) |
| 15 | mulneg1 8722 | . . . . 5 ⊢ ((i ∈ ℂ ∧ 𝐵 ∈ ℂ) → (-i · 𝐵) = -(i · 𝐵)) | |
| 16 | 2, 3, 15 | sylancr 418 | . . . 4 ⊢ (𝐵 ∈ ℝ → (-i · 𝐵) = -(i · 𝐵)) |
| 17 | 10, 14, 16 | 3eqtrd 2275 | . . 3 ⊢ (𝐵 ∈ ℝ → (∗‘(i · 𝐵)) = -(i · 𝐵)) |
| 18 | 8, 17 | oveqan12d 6104 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((∗‘𝐴) + (∗‘(i · 𝐵))) = (𝐴 + -(i · 𝐵))) |
| 19 | negsub 8574 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ (i · 𝐵) ∈ ℂ) → (𝐴 + -(i · 𝐵)) = (𝐴 − (i · 𝐵))) | |
| 20 | 1, 5, 19 | syl2an 289 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 + -(i · 𝐵)) = (𝐴 − (i · 𝐵))) |
| 21 | 7, 18, 20 | 3eqtrd 2275 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (∗‘(𝐴 + (i · 𝐵))) = (𝐴 − (i · 𝐵))) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 104 = wceq 1402 ∈ wcel 2209 ‘cfv 5377 (class class class)co 6085 ℂcc 8177 ℝcr 8178 ici 8181 + caddc 8182 · cmul 8184 − cmin 8497 -cneg 8498 ∗ccj 11604 |
| 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 4249 ax-pow 4311 ax-pr 4346 ax-un 4578 ax-setind 4684 ax-cnex 8270 ax-resscn 8271 ax-1cn 8272 ax-1re 8273 ax-icn 8274 ax-addcl 8275 ax-addrcl 8276 ax-mulcl 8277 ax-mulrcl 8278 ax-addcom 8279 ax-mulcom 8280 ax-addass 8281 ax-mulass 8282 ax-distr 8283 ax-i2m1 8284 ax-0lt1 8285 ax-1rid 8286 ax-0id 8287 ax-rnegex 8288 ax-precex 8289 ax-cnre 8290 ax-pre-ltirr 8291 ax-pre-ltwlin 8292 ax-pre-lttrn 8293 ax-pre-apti 8294 ax-pre-ltadd 8295 ax-pre-mulgt0 8296 ax-pre-mulext 8297 |
| 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 4131 df-opab 4193 df-mpt 4194 df-id 4438 df-po 4441 df-iso 4442 df-xp 4780 df-rel 4781 df-cnv 4782 df-co 4783 df-dm 4784 df-rn 4785 df-res 4786 df-ima 4787 df-iota 5337 df-fun 5379 df-fn 5380 df-f 5381 df-fv 5385 df-riota 6038 df-ov 6088 df-oprab 6089 df-mpo 6090 df-pnf 8362 df-mnf 8363 df-xr 8364 df-ltxr 8365 df-le 8366 df-sub 8499 df-neg 8500 df-reap 8903 df-ap 8910 df-div 9003 df-2 9363 df-cj 11607 df-re 11608 df-im 11609 |
| This theorem is used by: cjreim2 11670 cjap 11672 |
| Copyright terms: Public domain | W3C validator |