| 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 11286 | . 2 ⊢ (𝐴 ∈ ℂ → ∃𝑥 ∈ ℝ ∃𝑦 ∈ ℝ 𝐴 = (𝑥 + (i · 𝑦))) | |
| 2 | 0cn 11279 | . . . . . . 7 ⊢ 0 ∈ ℂ | |
| 3 | recn 11271 | . . . . . . 7 ⊢ (𝑥 ∈ ℝ → 𝑥 ∈ ℂ) | |
| 4 | ax-icn 11240 | . . . . . . . 8 ⊢ i ∈ ℂ | |
| 5 | recn 11271 | . . . . . . . 8 ⊢ (𝑦 ∈ ℝ → 𝑦 ∈ ℂ) | |
| 6 | mulcl 11265 | . . . . . . . 8 ⊢ ((i ∈ ℂ ∧ 𝑦 ∈ ℂ) → (i · 𝑦) ∈ ℂ) | |
| 7 | 4, 5, 6 | sylancr 599 | . . . . . . 7 ⊢ (𝑦 ∈ ℝ → (i · 𝑦) ∈ ℂ) |
| 8 | adddi 11270 | . . . . . . 7 ⊢ ((0 ∈ ℂ ∧ 𝑥 ∈ ℂ ∧ (i · 𝑦) ∈ ℂ) → (0 · (𝑥 + (i · 𝑦))) = ((0 · 𝑥) + (0 · (i · 𝑦)))) | |
| 9 | 2, 3, 7, 8 | mp3an3an 1496 | . . . . . 6 ⊢ ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → (0 · (𝑥 + (i · 𝑦))) = ((0 · 𝑥) + (0 · (i · 𝑦)))) |
| 10 | mul02lem2 11468 | . . . . . . 7 ⊢ (𝑥 ∈ ℝ → (0 · 𝑥) = 0) | |
| 11 | mul12 11456 | . . . . . . . . 9 ⊢ ((0 ∈ ℂ ∧ i ∈ ℂ ∧ 𝑦 ∈ ℂ) → (0 · (i · 𝑦)) = (i · (0 · 𝑦))) | |
| 12 | 2, 4, 5, 11 | mp3an12i 1494 | . . . . . . . 8 ⊢ (𝑦 ∈ ℝ → (0 · (i · 𝑦)) = (i · (0 · 𝑦))) |
| 13 | mul02lem2 11468 | . . . . . . . . 9 ⊢ (𝑦 ∈ ℝ → (0 · 𝑦) = 0) | |
| 14 | 13 | oveq2d 7428 | . . . . . . . 8 ⊢ (𝑦 ∈ ℝ → (i · (0 · 𝑦)) = (i · 0)) |
| 15 | 12, 14 | eqtrd 2796 | . . . . . . 7 ⊢ (𝑦 ∈ ℝ → (0 · (i · 𝑦)) = (i · 0)) |
| 16 | 10, 15 | oveqan12d 7431 | . . . . . 6 ⊢ ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → ((0 · 𝑥) + (0 · (i · 𝑦))) = (0 + (i · 0))) |
| 17 | 9, 16 | eqtrd 2796 | . . . . 5 ⊢ ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → (0 · (𝑥 + (i · 𝑦))) = (0 + (i · 0))) |
| 18 | cnre 11286 | . . . . . . . 8 ⊢ (0 ∈ ℂ → ∃𝑥 ∈ ℝ ∃𝑦 ∈ ℝ 0 = (𝑥 + (i · 𝑦))) | |
| 19 | 2, 18 | ax-mp 5 | . . . . . . 7 ⊢ ∃𝑥 ∈ ℝ ∃𝑦 ∈ ℝ 0 = (𝑥 + (i · 𝑦)) |
| 20 | oveq2 7420 | . . . . . . . . . 10 ⊢ (0 = (𝑥 + (i · 𝑦)) → (0 · 0) = (0 · (𝑥 + (i · 𝑦)))) | |
| 21 | 20 | eqeq1d 2763 | . . . . . . . . 9 ⊢ (0 = (𝑥 + (i · 𝑦)) → ((0 · 0) = (0 + (i · 0)) ↔ (0 · (𝑥 + (i · 𝑦))) = (0 + (i · 0)))) |
| 22 | 17, 21 | syl5ibrcom 250 | . . . . . . . 8 ⊢ ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → (0 = (𝑥 + (i · 𝑦)) → (0 · 0) = (0 + (i · 0)))) |
| 23 | 22 | rexlimivv 3205 | . . . . . . 7 ⊢ (∃𝑥 ∈ ℝ ∃𝑦 ∈ ℝ 0 = (𝑥 + (i · 𝑦)) → (0 · 0) = (0 + (i · 0))) |
| 24 | 19, 23 | ax-mp 5 | . . . . . 6 ⊢ (0 · 0) = (0 + (i · 0)) |
| 25 | 0re 11291 | . . . . . . 7 ⊢ 0 ∈ ℝ | |
| 26 | mul02lem2 11468 | . . . . . . 7 ⊢ (0 ∈ ℝ → (0 · 0) = 0) | |
| 27 | 25, 26 | ax-mp 5 | . . . . . 6 ⊢ (0 · 0) = 0 |
| 28 | 24, 27 | eqtr3i 2786 | . . . . 5 ⊢ (0 + (i · 0)) = 0 |
| 29 | 17, 28 | eqtrdi 2812 | . . . 4 ⊢ ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → (0 · (𝑥 + (i · 𝑦))) = 0) |
| 30 | oveq2 7420 | . . . . 5 ⊢ (𝐴 = (𝑥 + (i · 𝑦)) → (0 · 𝐴) = (0 · (𝑥 + (i · 𝑦)))) | |
| 31 | 30 | eqeq1d 2763 | . . . 4 ⊢ (𝐴 = (𝑥 + (i · 𝑦)) → ((0 · 𝐴) = 0 ↔ (0 · (𝑥 + (i · 𝑦))) = 0)) |
| 32 | 29, 31 | syl5ibrcom 250 | . . 3 ⊢ ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → (𝐴 = (𝑥 + (i · 𝑦)) → (0 · 𝐴) = 0)) |
| 33 | 32 | rexlimivv 3205 | . 2 ⊢ (∃𝑥 ∈ ℝ ∃𝑦 ∈ ℝ 𝐴 = (𝑥 + (i · 𝑦)) → (0 · 𝐴) = 0) |
| 34 | 1, 33 | syl 18 | 1 ⊢ (𝐴 ∈ ℂ → (0 · 𝐴) = 0) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ∃wrex 3087 (class class class)co 7412 ℂcc 11179 ℝcr 11180 0cc0 11181 ici 11183 + caddc 11184 · cmul 11186 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7740 ax-resscn 11238 ax-1cn 11239 ax-icn 11240 ax-addcl 11241 ax-addrcl 11242 ax-mulcl 11243 ax-mulrcl 11244 ax-mulcom 11245 ax-addass 11246 ax-mulass 11247 ax-distr 11248 ax-i2m1 11249 ax-1ne0 11250 ax-1rid 11251 ax-rnegex 11252 ax-rrecex 11253 ax-cnre 11254 ax-pre-lttri 11255 ax-pre-lttrn 11256 ax-pre-ltadd 11257 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3063 df-ral 3078 df-rex 3088 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5546 df-po 5559 df-so 5560 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-iota 6487 df-fun 6533 df-fn 6534 df-f 6535 df-f1 6536 df-fo 6537 df-f1o 6538 df-fv 6539 df-ov 7415 df-er 8701 df-en 8958 df-dom 8959 df-sdom 8960 df-pnf 11326 df-mnf 11327 df-ltxr 11329 |
| This theorem is used by: mul01 11470 cnegex2 11473 mul02i 11480 mul02d 11489 bcval5 14442 fsumconst 15936 demoivreALT 16349 nnnn0modprm0 16964 cnfldmulg 21690 itg2mulc 26048 dvcmulf 26245 coe0 26555 plymul0or 26581 sineq0 26834 jensen 27298 musumsum 27501 lgsne0 27644 brbtwn2 29465 ax5seglem4 29492 axeuclidlem 29522 axeuclid 29523 axcontlem2 29525 axcontlem4 29527 eulerpartlemb 34983 expgrowth 45278 dvcosax 46880 |
| Copyright terms: Public domain | W3C validator |