| 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 11106 | . 2 ⊢ (𝐴 ∈ ℂ → ∃𝑥 ∈ ℝ ∃𝑦 ∈ ℝ 𝐴 = (𝑥 + (i · 𝑦))) | |
| 2 | 0cn 11101 | . . . . . . 7 ⊢ 0 ∈ ℂ | |
| 3 | recn 11093 | . . . . . . 7 ⊢ (𝑥 ∈ ℝ → 𝑥 ∈ ℂ) | |
| 4 | ax-icn 11062 | . . . . . . . 8 ⊢ i ∈ ℂ | |
| 5 | recn 11093 | . . . . . . . 8 ⊢ (𝑦 ∈ ℝ → 𝑦 ∈ ℂ) | |
| 6 | mulcl 11087 | . . . . . . . 8 ⊢ ((i ∈ ℂ ∧ 𝑦 ∈ ℂ) → (i · 𝑦) ∈ ℂ) | |
| 7 | 4, 5, 6 | sylancr 587 | . . . . . . 7 ⊢ (𝑦 ∈ ℝ → (i · 𝑦) ∈ ℂ) |
| 8 | adddi 11092 | . . . . . . 7 ⊢ ((0 ∈ ℂ ∧ 𝑥 ∈ ℂ ∧ (i · 𝑦) ∈ ℂ) → (0 · (𝑥 + (i · 𝑦))) = ((0 · 𝑥) + (0 · (i · 𝑦)))) | |
| 9 | 2, 3, 7, 8 | mp3an3an 1469 | . . . . . 6 ⊢ ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → (0 · (𝑥 + (i · 𝑦))) = ((0 · 𝑥) + (0 · (i · 𝑦)))) |
| 10 | mul02lem2 11287 | . . . . . . 7 ⊢ (𝑥 ∈ ℝ → (0 · 𝑥) = 0) | |
| 11 | mul12 11275 | . . . . . . . . 9 ⊢ ((0 ∈ ℂ ∧ i ∈ ℂ ∧ 𝑦 ∈ ℂ) → (0 · (i · 𝑦)) = (i · (0 · 𝑦))) | |
| 12 | 2, 4, 5, 11 | mp3an12i 1467 | . . . . . . . 8 ⊢ (𝑦 ∈ ℝ → (0 · (i · 𝑦)) = (i · (0 · 𝑦))) |
| 13 | mul02lem2 11287 | . . . . . . . . 9 ⊢ (𝑦 ∈ ℝ → (0 · 𝑦) = 0) | |
| 14 | 13 | oveq2d 7362 | . . . . . . . 8 ⊢ (𝑦 ∈ ℝ → (i · (0 · 𝑦)) = (i · 0)) |
| 15 | 12, 14 | eqtrd 2766 | . . . . . . 7 ⊢ (𝑦 ∈ ℝ → (0 · (i · 𝑦)) = (i · 0)) |
| 16 | 10, 15 | oveqan12d 7365 | . . . . . 6 ⊢ ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → ((0 · 𝑥) + (0 · (i · 𝑦))) = (0 + (i · 0))) |
| 17 | 9, 16 | eqtrd 2766 | . . . . 5 ⊢ ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → (0 · (𝑥 + (i · 𝑦))) = (0 + (i · 0))) |
| 18 | cnre 11106 | . . . . . . . 8 ⊢ (0 ∈ ℂ → ∃𝑥 ∈ ℝ ∃𝑦 ∈ ℝ 0 = (𝑥 + (i · 𝑦))) | |
| 19 | 2, 18 | ax-mp 5 | . . . . . . 7 ⊢ ∃𝑥 ∈ ℝ ∃𝑦 ∈ ℝ 0 = (𝑥 + (i · 𝑦)) |
| 20 | oveq2 7354 | . . . . . . . . . 10 ⊢ (0 = (𝑥 + (i · 𝑦)) → (0 · 0) = (0 · (𝑥 + (i · 𝑦)))) | |
| 21 | 20 | eqeq1d 2733 | . . . . . . . . 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 3174 | . . . . . . 7 ⊢ (∃𝑥 ∈ ℝ ∃𝑦 ∈ ℝ 0 = (𝑥 + (i · 𝑦)) → (0 · 0) = (0 + (i · 0))) |
| 24 | 19, 23 | ax-mp 5 | . . . . . 6 ⊢ (0 · 0) = (0 + (i · 0)) |
| 25 | 0re 11111 | . . . . . . 7 ⊢ 0 ∈ ℝ | |
| 26 | mul02lem2 11287 | . . . . . . 7 ⊢ (0 ∈ ℝ → (0 · 0) = 0) | |
| 27 | 25, 26 | ax-mp 5 | . . . . . 6 ⊢ (0 · 0) = 0 |
| 28 | 24, 27 | eqtr3i 2756 | . . . . 5 ⊢ (0 + (i · 0)) = 0 |
| 29 | 17, 28 | eqtrdi 2782 | . . . 4 ⊢ ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → (0 · (𝑥 + (i · 𝑦))) = 0) |
| 30 | oveq2 7354 | . . . . 5 ⊢ (𝐴 = (𝑥 + (i · 𝑦)) → (0 · 𝐴) = (0 · (𝑥 + (i · 𝑦)))) | |
| 31 | 30 | eqeq1d 2733 | . . . 4 ⊢ (𝐴 = (𝑥 + (i · 𝑦)) → ((0 · 𝐴) = 0 ↔ (0 · (𝑥 + (i · 𝑦))) = 0)) |
| 32 | 29, 31 | syl5ibrcom 247 | . . 3 ⊢ ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → (𝐴 = (𝑥 + (i · 𝑦)) → (0 · 𝐴) = 0)) |
| 33 | 32 | rexlimivv 3174 | . 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 1541 ∈ wcel 2111 ∃wrex 3056 (class class class)co 7346 ℂcc 11001 ℝcr 11002 0cc0 11003 ici 11005 + caddc 11006 · cmul 11008 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2113 ax-9 2121 ax-10 2144 ax-11 2160 ax-12 2180 ax-ext 2703 ax-sep 5234 ax-nul 5244 ax-pow 5303 ax-pr 5370 ax-un 7668 ax-resscn 11060 ax-1cn 11061 ax-icn 11062 ax-addcl 11063 ax-addrcl 11064 ax-mulcl 11065 ax-mulrcl 11066 ax-mulcom 11067 ax-addass 11068 ax-mulass 11069 ax-distr 11070 ax-i2m1 11071 ax-1ne0 11072 ax-1rid 11073 ax-rnegex 11074 ax-rrecex 11075 ax-cnre 11076 ax-pre-lttri 11077 ax-pre-lttrn 11078 ax-pre-ltadd 11079 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2535 df-eu 2564 df-clab 2710 df-cleq 2723 df-clel 2806 df-nfc 2881 df-ne 2929 df-nel 3033 df-ral 3048 df-rex 3057 df-rab 3396 df-v 3438 df-sbc 3742 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4284 df-if 4476 df-pw 4552 df-sn 4577 df-pr 4579 df-op 4583 df-uni 4860 df-br 5092 df-opab 5154 df-mpt 5173 df-id 5511 df-po 5524 df-so 5525 df-xp 5622 df-rel 5623 df-cnv 5624 df-co 5625 df-dm 5626 df-rn 5627 df-res 5628 df-ima 5629 df-iota 6437 df-fun 6483 df-fn 6484 df-f 6485 df-f1 6486 df-fo 6487 df-f1o 6488 df-fv 6489 df-ov 7349 df-er 8622 df-en 8870 df-dom 8871 df-sdom 8872 df-pnf 11145 df-mnf 11146 df-ltxr 11148 |
| This theorem is referenced by: mul01 11289 cnegex2 11292 mul02i 11299 mul02d 11308 bcval5 14222 fsumconst 15694 demoivreALT 16107 nnnn0modprm0 16715 cnfldmulg 21338 itg2mulc 25673 dvcmulf 25873 coe0 26186 plymul0or 26213 sineq0 26458 jensen 26924 musumsum 27127 lgsne0 27271 brbtwn2 28881 ax5seglem4 28908 axeuclidlem 28938 axeuclid 28939 axcontlem2 28941 axcontlem4 28943 eulerpartlemb 34376 expgrowth 44367 dvcosax 45963 |
| Copyright terms: Public domain | W3C validator |