| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > remul2 | GIF version | ||
| Description: Real part of a product. (Contributed by Mario Carneiro, 2-Aug-2014.) |
| Ref | Expression |
|---|---|
| remul2 | ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℂ) → (ℜ‘(𝐴 · 𝐵)) = (𝐴 · (ℜ‘𝐵))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | recn 8140 | . . 3 ⊢ (𝐴 ∈ ℝ → 𝐴 ∈ ℂ) | |
| 2 | remul 11391 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (ℜ‘(𝐴 · 𝐵)) = (((ℜ‘𝐴) · (ℜ‘𝐵)) − ((ℑ‘𝐴) · (ℑ‘𝐵)))) | |
| 3 | 1, 2 | sylan 283 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℂ) → (ℜ‘(𝐴 · 𝐵)) = (((ℜ‘𝐴) · (ℜ‘𝐵)) − ((ℑ‘𝐴) · (ℑ‘𝐵)))) |
| 4 | rere 11384 | . . . . 5 ⊢ (𝐴 ∈ ℝ → (ℜ‘𝐴) = 𝐴) | |
| 5 | 4 | adantr 276 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℂ) → (ℜ‘𝐴) = 𝐴) |
| 6 | 5 | oveq1d 6022 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℂ) → ((ℜ‘𝐴) · (ℜ‘𝐵)) = (𝐴 · (ℜ‘𝐵))) |
| 7 | reim0 11380 | . . . . 5 ⊢ (𝐴 ∈ ℝ → (ℑ‘𝐴) = 0) | |
| 8 | 7 | oveq1d 6022 | . . . 4 ⊢ (𝐴 ∈ ℝ → ((ℑ‘𝐴) · (ℑ‘𝐵)) = (0 · (ℑ‘𝐵))) |
| 9 | imcl 11373 | . . . . . 6 ⊢ (𝐵 ∈ ℂ → (ℑ‘𝐵) ∈ ℝ) | |
| 10 | 9 | recnd 8183 | . . . . 5 ⊢ (𝐵 ∈ ℂ → (ℑ‘𝐵) ∈ ℂ) |
| 11 | 10 | mul02d 8546 | . . . 4 ⊢ (𝐵 ∈ ℂ → (0 · (ℑ‘𝐵)) = 0) |
| 12 | 8, 11 | sylan9eq 2282 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℂ) → ((ℑ‘𝐴) · (ℑ‘𝐵)) = 0) |
| 13 | 6, 12 | oveq12d 6025 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℂ) → (((ℜ‘𝐴) · (ℜ‘𝐵)) − ((ℑ‘𝐴) · (ℑ‘𝐵))) = ((𝐴 · (ℜ‘𝐵)) − 0)) |
| 14 | recl 11372 | . . . . 5 ⊢ (𝐵 ∈ ℂ → (ℜ‘𝐵) ∈ ℝ) | |
| 15 | 14 | recnd 8183 | . . . 4 ⊢ (𝐵 ∈ ℂ → (ℜ‘𝐵) ∈ ℂ) |
| 16 | mulcl 8134 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ (ℜ‘𝐵) ∈ ℂ) → (𝐴 · (ℜ‘𝐵)) ∈ ℂ) | |
| 17 | 1, 15, 16 | syl2an 289 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℂ) → (𝐴 · (ℜ‘𝐵)) ∈ ℂ) |
| 18 | 17 | subid1d 8454 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℂ) → ((𝐴 · (ℜ‘𝐵)) − 0) = (𝐴 · (ℜ‘𝐵))) |
| 19 | 3, 13, 18 | 3eqtrd 2266 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℂ) → (ℜ‘(𝐴 · 𝐵)) = (𝐴 · (ℜ‘𝐵))) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1395 ∈ wcel 2200 ‘cfv 5318 (class class class)co 6007 ℂcc 8005 ℝcr 8006 0cc0 8007 · cmul 8012 − cmin 8325 ℜcre 11359 ℑcim 11360 |
| 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 8098 ax-resscn 8099 ax-1cn 8100 ax-1re 8101 ax-icn 8102 ax-addcl 8103 ax-addrcl 8104 ax-mulcl 8105 ax-mulrcl 8106 ax-addcom 8107 ax-mulcom 8108 ax-addass 8109 ax-mulass 8110 ax-distr 8111 ax-i2m1 8112 ax-0lt1 8113 ax-1rid 8114 ax-0id 8115 ax-rnegex 8116 ax-precex 8117 ax-cnre 8118 ax-pre-ltirr 8119 ax-pre-ltwlin 8120 ax-pre-lttrn 8121 ax-pre-apti 8122 ax-pre-ltadd 8123 ax-pre-mulgt0 8124 ax-pre-mulext 8125 |
| 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 8191 df-mnf 8192 df-xr 8193 df-ltxr 8194 df-le 8195 df-sub 8327 df-neg 8328 df-reap 8730 df-ap 8737 df-div 8828 df-2 9177 df-cj 11361 df-re 11362 df-im 11363 |
| This theorem is referenced by: redivap 11393 remul2d 11491 abscxp 15597 |
| Copyright terms: Public domain | W3C validator |