| 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 8313 | . . 3 ⊢ (𝐴 ∈ ℝ → 𝐴 ∈ ℂ) | |
| 2 | remul 11652 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (ℜ‘(𝐴 · 𝐵)) = (((ℜ‘𝐴) · (ℜ‘𝐵)) − ((ℑ‘𝐴) · (ℑ‘𝐵)))) | |
| 3 | 1, 2 | sylan 283 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℂ) → (ℜ‘(𝐴 · 𝐵)) = (((ℜ‘𝐴) · (ℜ‘𝐵)) − ((ℑ‘𝐴) · (ℑ‘𝐵)))) |
| 4 | rere 11645 | . . . . 5 ⊢ (𝐴 ∈ ℝ → (ℜ‘𝐴) = 𝐴) | |
| 5 | 4 | adantr 276 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℂ) → (ℜ‘𝐴) = 𝐴) |
| 6 | 5 | oveq1d 6100 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℂ) → ((ℜ‘𝐴) · (ℜ‘𝐵)) = (𝐴 · (ℜ‘𝐵))) |
| 7 | reim0 11641 | . . . . 5 ⊢ (𝐴 ∈ ℝ → (ℑ‘𝐴) = 0) | |
| 8 | 7 | oveq1d 6100 | . . . 4 ⊢ (𝐴 ∈ ℝ → ((ℑ‘𝐴) · (ℑ‘𝐵)) = (0 · (ℑ‘𝐵))) |
| 9 | imcl 11634 | . . . . . 6 ⊢ (𝐵 ∈ ℂ → (ℑ‘𝐵) ∈ ℝ) | |
| 10 | 9 | recnd 8355 | . . . . 5 ⊢ (𝐵 ∈ ℂ → (ℑ‘𝐵) ∈ ℂ) |
| 11 | 10 | mul02d 8721 | . . . 4 ⊢ (𝐵 ∈ ℂ → (0 · (ℑ‘𝐵)) = 0) |
| 12 | 8, 11 | sylan9eq 2291 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℂ) → ((ℑ‘𝐴) · (ℑ‘𝐵)) = 0) |
| 13 | 6, 12 | oveq12d 6103 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℂ) → (((ℜ‘𝐴) · (ℜ‘𝐵)) − ((ℑ‘𝐴) · (ℑ‘𝐵))) = ((𝐴 · (ℜ‘𝐵)) − 0)) |
| 14 | recl 11633 | . . . . 5 ⊢ (𝐵 ∈ ℂ → (ℜ‘𝐵) ∈ ℝ) | |
| 15 | 14 | recnd 8355 | . . . 4 ⊢ (𝐵 ∈ ℂ → (ℜ‘𝐵) ∈ ℂ) |
| 16 | mulcl 8307 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ (ℜ‘𝐵) ∈ ℂ) → (𝐴 · (ℜ‘𝐵)) ∈ ℂ) | |
| 17 | 1, 15, 16 | syl2an 289 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℂ) → (𝐴 · (ℜ‘𝐵)) ∈ ℂ) |
| 18 | 17 | subid1d 8628 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℂ) → ((𝐴 · (ℜ‘𝐵)) − 0) = (𝐴 · (ℜ‘𝐵))) |
| 19 | 3, 13, 18 | 3eqtrd 2275 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℂ) → (ℜ‘(𝐴 · 𝐵)) = (𝐴 · (ℜ‘𝐵))) |
| 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 8178 ℝcr 8179 0cc0 8180 · cmul 8185 − cmin 8499 ℜcre 11620 ℑcim 11621 |
| 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 8271 ax-resscn 8272 ax-1cn 8273 ax-1re 8274 ax-icn 8275 ax-addcl 8276 ax-addrcl 8277 ax-mulcl 8278 ax-mulrcl 8279 ax-addcom 8280 ax-mulcom 8281 ax-addass 8282 ax-mulass 8283 ax-distr 8284 ax-i2m1 8285 ax-0lt1 8286 ax-1rid 8287 ax-0id 8288 ax-rnegex 8289 ax-precex 8290 ax-cnre 8291 ax-pre-ltirr 8292 ax-pre-ltwlin 8293 ax-pre-lttrn 8294 ax-pre-apti 8295 ax-pre-ltadd 8296 ax-pre-mulgt0 8297 ax-pre-mulext 8298 |
| 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 8363 df-mnf 8364 df-xr 8365 df-ltxr 8366 df-le 8367 df-sub 8501 df-neg 8502 df-reap 8906 df-ap 8913 df-div 9006 df-2 9366 df-cj 11622 df-re 11623 df-im 11624 |
| This theorem is used by: redivap 11654 remul2d 11753 abscxp 16073 |
| Copyright terms: Public domain | W3C validator |