| 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 8143 | . . 3 ⊢ (𝐴 ∈ ℝ → 𝐴 ∈ ℂ) | |
| 2 | ax-icn 8105 | . . . 4 ⊢ i ∈ ℂ | |
| 3 | recn 8143 | . . . 4 ⊢ (𝐵 ∈ ℝ → 𝐵 ∈ ℂ) | |
| 4 | mulcl 8137 | . . . 4 ⊢ ((i ∈ ℂ ∧ 𝐵 ∈ ℂ) → (i · 𝐵) ∈ ℂ) | |
| 5 | 2, 3, 4 | sylancr 414 | . . 3 ⊢ (𝐵 ∈ ℝ → (i · 𝐵) ∈ ℂ) |
| 6 | cjadd 11410 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ (i · 𝐵) ∈ ℂ) → (∗‘(𝐴 + (i · 𝐵))) = ((∗‘𝐴) + (∗‘(i · 𝐵)))) | |
| 7 | 1, 5, 6 | syl2an 289 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (∗‘(𝐴 + (i · 𝐵))) = ((∗‘𝐴) + (∗‘(i · 𝐵)))) |
| 8 | cjre 11408 | . . 3 ⊢ (𝐴 ∈ ℝ → (∗‘𝐴) = 𝐴) | |
| 9 | cjmul 11411 | . . . . 5 ⊢ ((i ∈ ℂ ∧ 𝐵 ∈ ℂ) → (∗‘(i · 𝐵)) = ((∗‘i) · (∗‘𝐵))) | |
| 10 | 2, 3, 9 | sylancr 414 | . . . 4 ⊢ (𝐵 ∈ ℝ → (∗‘(i · 𝐵)) = ((∗‘i) · (∗‘𝐵))) |
| 11 | cji 11428 | . . . . . 6 ⊢ (∗‘i) = -i | |
| 12 | 11 | a1i 9 | . . . . 5 ⊢ (𝐵 ∈ ℝ → (∗‘i) = -i) |
| 13 | cjre 11408 | . . . . 5 ⊢ (𝐵 ∈ ℝ → (∗‘𝐵) = 𝐵) | |
| 14 | 12, 13 | oveq12d 6025 | . . . 4 ⊢ (𝐵 ∈ ℝ → ((∗‘i) · (∗‘𝐵)) = (-i · 𝐵)) |
| 15 | mulneg1 8552 | . . . . 5 ⊢ ((i ∈ ℂ ∧ 𝐵 ∈ ℂ) → (-i · 𝐵) = -(i · 𝐵)) | |
| 16 | 2, 3, 15 | sylancr 414 | . . . 4 ⊢ (𝐵 ∈ ℝ → (-i · 𝐵) = -(i · 𝐵)) |
| 17 | 10, 14, 16 | 3eqtrd 2266 | . . 3 ⊢ (𝐵 ∈ ℝ → (∗‘(i · 𝐵)) = -(i · 𝐵)) |
| 18 | 8, 17 | oveqan12d 6026 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((∗‘𝐴) + (∗‘(i · 𝐵))) = (𝐴 + -(i · 𝐵))) |
| 19 | negsub 8405 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ (i · 𝐵) ∈ ℂ) → (𝐴 + -(i · 𝐵)) = (𝐴 − (i · 𝐵))) | |
| 20 | 1, 5, 19 | syl2an 289 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 + -(i · 𝐵)) = (𝐴 − (i · 𝐵))) |
| 21 | 7, 18, 20 | 3eqtrd 2266 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (∗‘(𝐴 + (i · 𝐵))) = (𝐴 − (i · 𝐵))) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1395 ∈ wcel 2200 ‘cfv 5318 (class class class)co 6007 ℂcc 8008 ℝcr 8009 ici 8012 + caddc 8013 · cmul 8015 − cmin 8328 -cneg 8329 ∗ccj 11365 |
| 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 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-sep 4202 ax-pow 4258 ax-pr 4293 ax-un 4524 ax-setind 4629 ax-cnex 8101 ax-resscn 8102 ax-1cn 8103 ax-1re 8104 ax-icn 8105 ax-addcl 8106 ax-addrcl 8107 ax-mulcl 8108 ax-mulrcl 8109 ax-addcom 8110 ax-mulcom 8111 ax-addass 8112 ax-mulass 8113 ax-distr 8114 ax-i2m1 8115 ax-0lt1 8116 ax-1rid 8117 ax-0id 8118 ax-rnegex 8119 ax-precex 8120 ax-cnre 8121 ax-pre-ltirr 8122 ax-pre-ltwlin 8123 ax-pre-lttrn 8124 ax-pre-apti 8125 ax-pre-ltadd 8126 ax-pre-mulgt0 8127 ax-pre-mulext 8128 |
| This theorem depends on definitions: df-bi 117 df-3an 1004 df-tru 1398 df-fal 1401 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-nel 2496 df-ral 2513 df-rex 2514 df-reu 2515 df-rmo 2516 df-rab 2517 df-v 2801 df-sbc 3029 df-dif 3199 df-un 3201 df-in 3203 df-ss 3210 df-pw 3651 df-sn 3672 df-pr 3673 df-op 3675 df-uni 3889 df-br 4084 df-opab 4146 df-mpt 4147 df-id 4384 df-po 4387 df-iso 4388 df-xp 4725 df-rel 4726 df-cnv 4727 df-co 4728 df-dm 4729 df-rn 4730 df-res 4731 df-ima 4732 df-iota 5278 df-fun 5320 df-fn 5321 df-f 5322 df-fv 5326 df-riota 5960 df-ov 6010 df-oprab 6011 df-mpo 6012 df-pnf 8194 df-mnf 8195 df-xr 8196 df-ltxr 8197 df-le 8198 df-sub 8330 df-neg 8331 df-reap 8733 df-ap 8740 df-div 8831 df-2 9180 df-cj 11368 df-re 11369 df-im 11370 |
| This theorem is referenced by: cjreim2 11430 cjap 11432 |
| Copyright terms: Public domain | W3C validator |