| 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 11206 | . 2 ⊢ (𝐴 ∈ ℂ → ∃𝑥 ∈ ℝ ∃𝑦 ∈ ℝ 𝐴 = (𝑥 + (i · 𝑦))) | |
| 2 | 0cn 11199 | . . . . . . 7 ⊢ 0 ∈ ℂ | |
| 3 | recn 11191 | . . . . . . 7 ⊢ (𝑥 ∈ ℝ → 𝑥 ∈ ℂ) | |
| 4 | ax-icn 11160 | . . . . . . . 8 ⊢ i ∈ ℂ | |
| 5 | recn 11191 | . . . . . . . 8 ⊢ (𝑦 ∈ ℝ → 𝑦 ∈ ℂ) | |
| 6 | mulcl 11185 | . . . . . . . 8 ⊢ ((i ∈ ℂ ∧ 𝑦 ∈ ℂ) → (i · 𝑦) ∈ ℂ) | |
| 7 | 4, 5, 6 | sylancr 598 | . . . . . . 7 ⊢ (𝑦 ∈ ℝ → (i · 𝑦) ∈ ℂ) |
| 8 | adddi 11190 | . . . . . . 7 ⊢ ((0 ∈ ℂ ∧ 𝑥 ∈ ℂ ∧ (i · 𝑦) ∈ ℂ) → (0 · (𝑥 + (i · 𝑦))) = ((0 · 𝑥) + (0 · (i · 𝑦)))) | |
| 9 | 2, 3, 7, 8 | mp3an3an 1496 | . . . . . 6 ⊢ ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → (0 · (𝑥 + (i · 𝑦))) = ((0 · 𝑥) + (0 · (i · 𝑦)))) |
| 10 | mul02lem2 11388 | . . . . . . 7 ⊢ (𝑥 ∈ ℝ → (0 · 𝑥) = 0) | |
| 11 | mul12 11376 | . . . . . . . . 9 ⊢ ((0 ∈ ℂ ∧ i ∈ ℂ ∧ 𝑦 ∈ ℂ) → (0 · (i · 𝑦)) = (i · (0 · 𝑦))) | |
| 12 | 2, 4, 5, 11 | mp3an12i 1494 | . . . . . . . 8 ⊢ (𝑦 ∈ ℝ → (0 · (i · 𝑦)) = (i · (0 · 𝑦))) |
| 13 | mul02lem2 11388 | . . . . . . . . 9 ⊢ (𝑦 ∈ ℝ → (0 · 𝑦) = 0) | |
| 14 | 13 | oveq2d 7428 | . . . . . . . 8 ⊢ (𝑦 ∈ ℝ → (i · (0 · 𝑦)) = (i · 0)) |
| 15 | 12, 14 | eqtrd 2798 | . . . . . . 7 ⊢ (𝑦 ∈ ℝ → (0 · (i · 𝑦)) = (i · 0)) |
| 16 | 10, 15 | oveqan12d 7431 | . . . . . 6 ⊢ ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → ((0 · 𝑥) + (0 · (i · 𝑦))) = (0 + (i · 0))) |
| 17 | 9, 16 | eqtrd 2798 | . . . . 5 ⊢ ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → (0 · (𝑥 + (i · 𝑦))) = (0 + (i · 0))) |
| 18 | cnre 11206 | . . . . . . . 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 2765 | . . . . . . . . 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 3207 | . . . . . . 7 ⊢ (∃𝑥 ∈ ℝ ∃𝑦 ∈ ℝ 0 = (𝑥 + (i · 𝑦)) → (0 · 0) = (0 + (i · 0))) |
| 24 | 19, 23 | ax-mp 5 | . . . . . 6 ⊢ (0 · 0) = (0 + (i · 0)) |
| 25 | 0re 11211 | . . . . . . 7 ⊢ 0 ∈ ℝ | |
| 26 | mul02lem2 11388 | . . . . . . 7 ⊢ (0 ∈ ℝ → (0 · 0) = 0) | |
| 27 | 25, 26 | ax-mp 5 | . . . . . 6 ⊢ (0 · 0) = 0 |
| 28 | 24, 27 | eqtr3i 2788 | . . . . 5 ⊢ (0 + (i · 0)) = 0 |
| 29 | 17, 28 | eqtrdi 2814 | . . . 4 ⊢ ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → (0 · (𝑥 + (i · 𝑦))) = 0) |
| 30 | oveq2 7420 | . . . . 5 ⊢ (𝐴 = (𝑥 + (i · 𝑦)) → (0 · 𝐴) = (0 · (𝑥 + (i · 𝑦)))) | |
| 31 | 30 | eqeq1d 2765 | . . . 4 ⊢ (𝐴 = (𝑥 + (i · 𝑦)) → ((0 · 𝐴) = 0 ↔ (0 · (𝑥 + (i · 𝑦))) = 0)) |
| 32 | 29, 31 | syl5ibrcom 250 | . . 3 ⊢ ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → (𝐴 = (𝑥 + (i · 𝑦)) → (0 · 𝐴) = 0)) |
| 33 | 32 | rexlimivv 3207 | . 2 ⊢ (∃𝑥 ∈ ℝ ∃𝑦 ∈ ℝ 𝐴 = (𝑥 + (i · 𝑦)) → (0 · 𝐴) = 0) |
| 34 | 1, 33 | syl 18 | 1 ⊢ (𝐴 ∈ ℂ → (0 · 𝐴) = 0) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 = wceq 1570 ∈ wcel 2143 ∃wrex 3089 (class class class)co 7412 ℂcc 11099 ℝcr 11100 0cc0 11101 ici 11103 + caddc 11104 · cmul 11106 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-sep 5258 ax-nul 5270 ax-pow 5338 ax-pr 5406 ax-un 7734 ax-resscn 11158 ax-1cn 11159 ax-icn 11160 ax-addcl 11161 ax-addrcl 11162 ax-mulcl 11163 ax-mulrcl 11164 ax-mulcom 11165 ax-addass 11166 ax-mulass 11167 ax-distr 11168 ax-i2m1 11169 ax-1ne0 11170 ax-1rid 11171 ax-rnegex 11172 ax-rrecex 11173 ax-cnre 11174 ax-pre-lttri 11175 ax-pre-lttrn 11176 ax-pre-ltadd 11177 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3065 df-ral 3080 df-rex 3090 df-rab 3417 df-v 3457 df-sbc 3746 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4288 df-if 4489 df-pw 4565 df-sn 4591 df-pr 4593 df-op 4597 df-uni 4874 df-br 5111 df-opab 5175 df-mpt 5194 df-id 5558 df-po 5571 df-so 5572 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-ov 7415 df-er 8695 df-en 8945 df-dom 8946 df-sdom 8947 df-pnf 11246 df-mnf 11247 df-ltxr 11249 |
| This theorem is referenced by: mul01 11390 cnegex2 11393 mul02i 11400 mul02d 11409 bcval5 14356 fsumconst 15843 demoivreALT 16258 nnnn0modprm0 16867 cnfldmulg 21535 itg2mulc 25887 dvcmulf 26085 coe0 26394 plymul0or 26420 sineq0 26667 jensen 27131 musumsum 27334 lgsne0 27477 brbtwn2 29233 ax5seglem4 29260 axeuclidlem 29290 axeuclid 29291 axcontlem2 29293 axcontlem4 29295 eulerpartlemb 34736 expgrowth 45025 dvcosax 46620 |
| Copyright terms: Public domain | W3C validator |