| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > mul02 | Structured version Visualization version GIF version | ||
| Description: Multiplication by 0. Theorem I.6 of [Apostol] p. 18. Based on ideas by Eric Schmidt. (Contributed by NM, 10-Aug-1999.) (Revised by Scott Fenton, 3-Jan-2013.) |
| Ref | Expression |
|---|---|
| mul02 | ⊢ (𝐴 ∈ ℂ → (0 · 𝐴) = 0) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cnre 11133 | . 2 ⊢ (𝐴 ∈ ℂ → ∃𝑥 ∈ ℝ ∃𝑦 ∈ ℝ 𝐴 = (𝑥 + (i · 𝑦))) | |
| 2 | 0cn 11128 | . . . . . . 7 ⊢ 0 ∈ ℂ | |
| 3 | recn 11120 | . . . . . . 7 ⊢ (𝑥 ∈ ℝ → 𝑥 ∈ ℂ) | |
| 4 | ax-icn 11089 | . . . . . . . 8 ⊢ i ∈ ℂ | |
| 5 | recn 11120 | . . . . . . . 8 ⊢ (𝑦 ∈ ℝ → 𝑦 ∈ ℂ) | |
| 6 | mulcl 11114 | . . . . . . . 8 ⊢ ((i ∈ ℂ ∧ 𝑦 ∈ ℂ) → (i · 𝑦) ∈ ℂ) | |
| 7 | 4, 5, 6 | sylancr 588 | . . . . . . 7 ⊢ (𝑦 ∈ ℝ → (i · 𝑦) ∈ ℂ) |
| 8 | adddi 11119 | . . . . . . 7 ⊢ ((0 ∈ ℂ ∧ 𝑥 ∈ ℂ ∧ (i · 𝑦) ∈ ℂ) → (0 · (𝑥 + (i · 𝑦))) = ((0 · 𝑥) + (0 · (i · 𝑦)))) | |
| 9 | 2, 3, 7, 8 | mp3an3an 1470 | . . . . . 6 ⊢ ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → (0 · (𝑥 + (i · 𝑦))) = ((0 · 𝑥) + (0 · (i · 𝑦)))) |
| 10 | mul02lem2 11314 | . . . . . . 7 ⊢ (𝑥 ∈ ℝ → (0 · 𝑥) = 0) | |
| 11 | mul12 11302 | . . . . . . . . 9 ⊢ ((0 ∈ ℂ ∧ i ∈ ℂ ∧ 𝑦 ∈ ℂ) → (0 · (i · 𝑦)) = (i · (0 · 𝑦))) | |
| 12 | 2, 4, 5, 11 | mp3an12i 1468 | . . . . . . . 8 ⊢ (𝑦 ∈ ℝ → (0 · (i · 𝑦)) = (i · (0 · 𝑦))) |
| 13 | mul02lem2 11314 | . . . . . . . . 9 ⊢ (𝑦 ∈ ℝ → (0 · 𝑦) = 0) | |
| 14 | 13 | oveq2d 7376 | . . . . . . . 8 ⊢ (𝑦 ∈ ℝ → (i · (0 · 𝑦)) = (i · 0)) |
| 15 | 12, 14 | eqtrd 2772 | . . . . . . 7 ⊢ (𝑦 ∈ ℝ → (0 · (i · 𝑦)) = (i · 0)) |
| 16 | 10, 15 | oveqan12d 7379 | . . . . . 6 ⊢ ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → ((0 · 𝑥) + (0 · (i · 𝑦))) = (0 + (i · 0))) |
| 17 | 9, 16 | eqtrd 2772 | . . . . 5 ⊢ ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → (0 · (𝑥 + (i · 𝑦))) = (0 + (i · 0))) |
| 18 | cnre 11133 | . . . . . . . 8 ⊢ (0 ∈ ℂ → ∃𝑥 ∈ ℝ ∃𝑦 ∈ ℝ 0 = (𝑥 + (i · 𝑦))) | |
| 19 | 2, 18 | ax-mp 5 | . . . . . . 7 ⊢ ∃𝑥 ∈ ℝ ∃𝑦 ∈ ℝ 0 = (𝑥 + (i · 𝑦)) |
| 20 | oveq2 7368 | . . . . . . . . . 10 ⊢ (0 = (𝑥 + (i · 𝑦)) → (0 · 0) = (0 · (𝑥 + (i · 𝑦)))) | |
| 21 | 20 | eqeq1d 2739 | . . . . . . . . 9 ⊢ (0 = (𝑥 + (i · 𝑦)) → ((0 · 0) = (0 + (i · 0)) ↔ (0 · (𝑥 + (i · 𝑦))) = (0 + (i · 0)))) |
| 22 | 17, 21 | syl5ibrcom 247 | . . . . . . . 8 ⊢ ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → (0 = (𝑥 + (i · 𝑦)) → (0 · 0) = (0 + (i · 0)))) |
| 23 | 22 | rexlimivv 3179 | . . . . . . 7 ⊢ (∃𝑥 ∈ ℝ ∃𝑦 ∈ ℝ 0 = (𝑥 + (i · 𝑦)) → (0 · 0) = (0 + (i · 0))) |
| 24 | 19, 23 | ax-mp 5 | . . . . . 6 ⊢ (0 · 0) = (0 + (i · 0)) |
| 25 | 0re 11138 | . . . . . . 7 ⊢ 0 ∈ ℝ | |
| 26 | mul02lem2 11314 | . . . . . . 7 ⊢ (0 ∈ ℝ → (0 · 0) = 0) | |
| 27 | 25, 26 | ax-mp 5 | . . . . . 6 ⊢ (0 · 0) = 0 |
| 28 | 24, 27 | eqtr3i 2762 | . . . . 5 ⊢ (0 + (i · 0)) = 0 |
| 29 | 17, 28 | eqtrdi 2788 | . . . 4 ⊢ ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → (0 · (𝑥 + (i · 𝑦))) = 0) |
| 30 | oveq2 7368 | . . . . 5 ⊢ (𝐴 = (𝑥 + (i · 𝑦)) → (0 · 𝐴) = (0 · (𝑥 + (i · 𝑦)))) | |
| 31 | 30 | eqeq1d 2739 | . . . 4 ⊢ (𝐴 = (𝑥 + (i · 𝑦)) → ((0 · 𝐴) = 0 ↔ (0 · (𝑥 + (i · 𝑦))) = 0)) |
| 32 | 29, 31 | syl5ibrcom 247 | . . 3 ⊢ ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → (𝐴 = (𝑥 + (i · 𝑦)) → (0 · 𝐴) = 0)) |
| 33 | 32 | rexlimivv 3179 | . 2 ⊢ (∃𝑥 ∈ ℝ ∃𝑦 ∈ ℝ 𝐴 = (𝑥 + (i · 𝑦)) → (0 · 𝐴) = 0) |
| 34 | 1, 33 | syl 17 | 1 ⊢ (𝐴 ∈ ℂ → (0 · 𝐴) = 0) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ∃wrex 3061 (class class class)co 7360 ℂcc 11028 ℝcr 11029 0cc0 11030 ici 11032 + caddc 11033 · cmul 11035 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5242 ax-nul 5252 ax-pow 5311 ax-pr 5378 ax-un 7682 ax-resscn 11087 ax-1cn 11088 ax-icn 11089 ax-addcl 11090 ax-addrcl 11091 ax-mulcl 11092 ax-mulrcl 11093 ax-mulcom 11094 ax-addass 11095 ax-mulass 11096 ax-distr 11097 ax-i2m1 11098 ax-1ne0 11099 ax-1rid 11100 ax-rnegex 11101 ax-rrecex 11102 ax-cnre 11103 ax-pre-lttri 11104 ax-pre-lttrn 11105 ax-pre-ltadd 11106 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3062 df-rab 3401 df-v 3443 df-sbc 3742 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4287 df-if 4481 df-pw 4557 df-sn 4582 df-pr 4584 df-op 4588 df-uni 4865 df-br 5100 df-opab 5162 df-mpt 5181 df-id 5520 df-po 5533 df-so 5534 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-iota 6449 df-fun 6495 df-fn 6496 df-f 6497 df-f1 6498 df-fo 6499 df-f1o 6500 df-fv 6501 df-ov 7363 df-er 8637 df-en 8888 df-dom 8889 df-sdom 8890 df-pnf 11172 df-mnf 11173 df-ltxr 11175 |
| This theorem is referenced by: mul01 11316 cnegex2 11319 mul02i 11326 mul02d 11335 bcval5 14245 fsumconst 15717 demoivreALT 16130 nnnn0modprm0 16738 cnfldmulg 21362 itg2mulc 25708 dvcmulf 25908 coe0 26221 plymul0or 26248 sineq0 26493 jensen 26959 musumsum 27162 lgsne0 27306 brbtwn2 28961 ax5seglem4 28988 axeuclidlem 29018 axeuclid 29019 axcontlem2 29021 axcontlem4 29023 eulerpartlemb 34506 expgrowth 44612 dvcosax 46206 |
| Copyright terms: Public domain | W3C validator |