| 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 8208 | . . 3 ⊢ (𝐴 ∈ ℝ → 𝐴 ∈ ℂ) | |
| 2 | ax-icn 8170 | . . . 4 ⊢ i ∈ ℂ | |
| 3 | recn 8208 | . . . 4 ⊢ (𝐵 ∈ ℝ → 𝐵 ∈ ℂ) | |
| 4 | mulcl 8202 | . . . 4 ⊢ ((i ∈ ℂ ∧ 𝐵 ∈ ℂ) → (i · 𝐵) ∈ ℂ) | |
| 5 | 2, 3, 4 | sylancr 414 | . . 3 ⊢ (𝐵 ∈ ℝ → (i · 𝐵) ∈ ℂ) |
| 6 | cjadd 11507 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ (i · 𝐵) ∈ ℂ) → (∗‘(𝐴 + (i · 𝐵))) = ((∗‘𝐴) + (∗‘(i · 𝐵)))) | |
| 7 | 1, 5, 6 | syl2an 289 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (∗‘(𝐴 + (i · 𝐵))) = ((∗‘𝐴) + (∗‘(i · 𝐵)))) |
| 8 | cjre 11505 | . . 3 ⊢ (𝐴 ∈ ℝ → (∗‘𝐴) = 𝐴) | |
| 9 | cjmul 11508 | . . . . 5 ⊢ ((i ∈ ℂ ∧ 𝐵 ∈ ℂ) → (∗‘(i · 𝐵)) = ((∗‘i) · (∗‘𝐵))) | |
| 10 | 2, 3, 9 | sylancr 414 | . . . 4 ⊢ (𝐵 ∈ ℝ → (∗‘(i · 𝐵)) = ((∗‘i) · (∗‘𝐵))) |
| 11 | cji 11525 | . . . . . 6 ⊢ (∗‘i) = -i | |
| 12 | 11 | a1i 9 | . . . . 5 ⊢ (𝐵 ∈ ℝ → (∗‘i) = -i) |
| 13 | cjre 11505 | . . . . 5 ⊢ (𝐵 ∈ ℝ → (∗‘𝐵) = 𝐵) | |
| 14 | 12, 13 | oveq12d 6046 | . . . 4 ⊢ (𝐵 ∈ ℝ → ((∗‘i) · (∗‘𝐵)) = (-i · 𝐵)) |
| 15 | mulneg1 8616 | . . . . 5 ⊢ ((i ∈ ℂ ∧ 𝐵 ∈ ℂ) → (-i · 𝐵) = -(i · 𝐵)) | |
| 16 | 2, 3, 15 | sylancr 414 | . . . 4 ⊢ (𝐵 ∈ ℝ → (-i · 𝐵) = -(i · 𝐵)) |
| 17 | 10, 14, 16 | 3eqtrd 2268 | . . 3 ⊢ (𝐵 ∈ ℝ → (∗‘(i · 𝐵)) = -(i · 𝐵)) |
| 18 | 8, 17 | oveqan12d 6047 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((∗‘𝐴) + (∗‘(i · 𝐵))) = (𝐴 + -(i · 𝐵))) |
| 19 | negsub 8469 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ (i · 𝐵) ∈ ℂ) → (𝐴 + -(i · 𝐵)) = (𝐴 − (i · 𝐵))) | |
| 20 | 1, 5, 19 | syl2an 289 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 + -(i · 𝐵)) = (𝐴 − (i · 𝐵))) |
| 21 | 7, 18, 20 | 3eqtrd 2268 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (∗‘(𝐴 + (i · 𝐵))) = (𝐴 − (i · 𝐵))) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1398 ∈ wcel 2202 ‘cfv 5333 (class class class)co 6028 ℂcc 8073 ℝcr 8074 ici 8077 + caddc 8078 · cmul 8080 − cmin 8392 -cneg 8393 ∗ccj 11462 |
| 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 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2204 ax-14 2205 ax-ext 2213 ax-sep 4212 ax-pow 4270 ax-pr 4305 ax-un 4536 ax-setind 4641 ax-cnex 8166 ax-resscn 8167 ax-1cn 8168 ax-1re 8169 ax-icn 8170 ax-addcl 8171 ax-addrcl 8172 ax-mulcl 8173 ax-mulrcl 8174 ax-addcom 8175 ax-mulcom 8176 ax-addass 8177 ax-mulass 8178 ax-distr 8179 ax-i2m1 8180 ax-0lt1 8181 ax-1rid 8182 ax-0id 8183 ax-rnegex 8184 ax-precex 8185 ax-cnre 8186 ax-pre-ltirr 8187 ax-pre-ltwlin 8188 ax-pre-lttrn 8189 ax-pre-apti 8190 ax-pre-ltadd 8191 ax-pre-mulgt0 8192 ax-pre-mulext 8193 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2364 df-ne 2404 df-nel 2499 df-ral 2516 df-rex 2517 df-reu 2518 df-rmo 2519 df-rab 2520 df-v 2805 df-sbc 3033 df-dif 3203 df-un 3205 df-in 3207 df-ss 3214 df-pw 3658 df-sn 3679 df-pr 3680 df-op 3682 df-uni 3899 df-br 4094 df-opab 4156 df-mpt 4157 df-id 4396 df-po 4399 df-iso 4400 df-xp 4737 df-rel 4738 df-cnv 4739 df-co 4740 df-dm 4741 df-rn 4742 df-res 4743 df-ima 4744 df-iota 5293 df-fun 5335 df-fn 5336 df-f 5337 df-fv 5341 df-riota 5981 df-ov 6031 df-oprab 6032 df-mpo 6033 df-pnf 8258 df-mnf 8259 df-xr 8260 df-ltxr 8261 df-le 8262 df-sub 8394 df-neg 8395 df-reap 8797 df-ap 8804 df-div 8895 df-2 9244 df-cj 11465 df-re 11466 df-im 11467 |
| This theorem is referenced by: cjreim2 11527 cjap 11529 |
| Copyright terms: Public domain | W3C validator |