| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > mul02lem2 | Structured version Visualization version GIF version | ||
| Description: Lemma for mul02 11311. Zero times a real is zero. (Contributed by Scott Fenton, 3-Jan-2013.) |
| Ref | Expression |
|---|---|
| mul02lem2 | ⊢ (𝐴 ∈ ℝ → (0 · 𝐴) = 0) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ax-1ne0 11095 | . 2 ⊢ 1 ≠ 0 | |
| 2 | ax-1cn 11084 | . . . . . . . . 9 ⊢ 1 ∈ ℂ | |
| 3 | mul02lem1 11309 | . . . . . . . . 9 ⊢ (((𝐴 ∈ ℝ ∧ (0 · 𝐴) ≠ 0) ∧ 1 ∈ ℂ) → 1 = (1 + 1)) | |
| 4 | 2, 3 | mpan2 691 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℝ ∧ (0 · 𝐴) ≠ 0) → 1 = (1 + 1)) |
| 5 | 4 | eqcomd 2742 | . . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ (0 · 𝐴) ≠ 0) → (1 + 1) = 1) |
| 6 | 5 | oveq2d 7374 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ (0 · 𝐴) ≠ 0) → ((i · i) + (1 + 1)) = ((i · i) + 1)) |
| 7 | ax-icn 11085 | . . . . . . . . 9 ⊢ i ∈ ℂ | |
| 8 | 7, 7 | mulcli 11139 | . . . . . . . 8 ⊢ (i · i) ∈ ℂ |
| 9 | 8, 2, 2 | addassi 11142 | . . . . . . 7 ⊢ (((i · i) + 1) + 1) = ((i · i) + (1 + 1)) |
| 10 | ax-i2m1 11094 | . . . . . . . 8 ⊢ ((i · i) + 1) = 0 | |
| 11 | 10 | oveq1i 7368 | . . . . . . 7 ⊢ (((i · i) + 1) + 1) = (0 + 1) |
| 12 | 9, 11 | eqtr3i 2761 | . . . . . 6 ⊢ ((i · i) + (1 + 1)) = (0 + 1) |
| 13 | 00id 11308 | . . . . . . 7 ⊢ (0 + 0) = 0 | |
| 14 | 10, 13 | eqtr4i 2762 | . . . . . 6 ⊢ ((i · i) + 1) = (0 + 0) |
| 15 | 6, 12, 14 | 3eqtr3g 2794 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ (0 · 𝐴) ≠ 0) → (0 + 1) = (0 + 0)) |
| 16 | 1re 11132 | . . . . . 6 ⊢ 1 ∈ ℝ | |
| 17 | 0re 11134 | . . . . . 6 ⊢ 0 ∈ ℝ | |
| 18 | readdcan 11307 | . . . . . 6 ⊢ ((1 ∈ ℝ ∧ 0 ∈ ℝ ∧ 0 ∈ ℝ) → ((0 + 1) = (0 + 0) ↔ 1 = 0)) | |
| 19 | 16, 17, 17, 18 | mp3an 1463 | . . . . 5 ⊢ ((0 + 1) = (0 + 0) ↔ 1 = 0) |
| 20 | 15, 19 | sylib 218 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ (0 · 𝐴) ≠ 0) → 1 = 0) |
| 21 | 20 | ex 412 | . . 3 ⊢ (𝐴 ∈ ℝ → ((0 · 𝐴) ≠ 0 → 1 = 0)) |
| 22 | 21 | necon1d 2954 | . 2 ⊢ (𝐴 ∈ ℝ → (1 ≠ 0 → (0 · 𝐴) = 0)) |
| 23 | 1, 22 | mpi 20 | 1 ⊢ (𝐴 ∈ ℝ → (0 · 𝐴) = 0) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1541 ∈ wcel 2113 ≠ wne 2932 (class class class)co 7358 ℂcc 11024 ℝcr 11025 0cc0 11026 1c1 11027 ici 11028 + caddc 11029 · cmul 11031 |
| 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 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680 ax-resscn 11083 ax-1cn 11084 ax-icn 11085 ax-addcl 11086 ax-addrcl 11087 ax-mulcl 11088 ax-mulrcl 11089 ax-mulcom 11090 ax-addass 11091 ax-mulass 11092 ax-distr 11093 ax-i2m1 11094 ax-1ne0 11095 ax-1rid 11096 ax-rnegex 11097 ax-rrecex 11098 ax-cnre 11099 ax-pre-lttri 11100 ax-pre-lttrn 11101 ax-pre-ltadd 11102 |
| 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 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3061 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-br 5099 df-opab 5161 df-mpt 5180 df-id 5519 df-po 5532 df-so 5533 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-ov 7361 df-er 8635 df-en 8884 df-dom 8885 df-sdom 8886 df-pnf 11168 df-mnf 11169 df-ltxr 11171 |
| This theorem is referenced by: mul02 11311 rexmul 13186 mbfmulc2lem 25604 i1fmulc 25660 itg1mulc 25661 reabssgn 43873 stoweidlem34 46274 ztprmneprm 48589 nn0sumshdiglemA 48861 nn0sumshdiglem1 48863 |
| Copyright terms: Public domain | W3C validator |