| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > mul02lem2 | Structured version Visualization version GIF version | ||
| Description: Lemma for mul02 11358. 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 11139 | . 2 ⊢ 1 ≠ 0 | |
| 2 | ax-1cn 11128 | . . . . . . . . 9 ⊢ 1 ∈ ℂ | |
| 3 | mul02lem1 11356 | . . . . . . . . 9 ⊢ (((𝐴 ∈ ℝ ∧ (0 · 𝐴) ≠ 0) ∧ 1 ∈ ℂ) → 1 = (1 + 1)) | |
| 4 | 2, 3 | mpan2 701 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℝ ∧ (0 · 𝐴) ≠ 0) → 1 = (1 + 1)) |
| 5 | 4 | eqcomd 2767 | . . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ (0 · 𝐴) ≠ 0) → (1 + 1) = 1) |
| 6 | 5 | oveq2d 7408 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ (0 · 𝐴) ≠ 0) → ((i · i) + (1 + 1)) = ((i · i) + 1)) |
| 7 | ax-icn 11129 | . . . . . . . . 9 ⊢ i ∈ ℂ | |
| 8 | 7, 7 | mulcli 11186 | . . . . . . . 8 ⊢ (i · i) ∈ ℂ |
| 9 | 8, 2, 2 | addassi 11189 | . . . . . . 7 ⊢ (((i · i) + 1) + 1) = ((i · i) + (1 + 1)) |
| 10 | ax-i2m1 11138 | . . . . . . . 8 ⊢ ((i · i) + 1) = 0 | |
| 11 | 10 | oveq1i 7402 | . . . . . . 7 ⊢ (((i · i) + 1) + 1) = (0 + 1) |
| 12 | 9, 11 | eqtr3i 2786 | . . . . . 6 ⊢ ((i · i) + (1 + 1)) = (0 + 1) |
| 13 | 00id 11355 | . . . . . . 7 ⊢ (0 + 0) = 0 | |
| 14 | 10, 13 | eqtr4i 2787 | . . . . . 6 ⊢ ((i · i) + 1) = (0 + 0) |
| 15 | 6, 12, 14 | 3eqtr3g 2819 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ (0 · 𝐴) ≠ 0) → (0 + 1) = (0 + 0)) |
| 16 | 1re 11178 | . . . . . 6 ⊢ 1 ∈ ℝ | |
| 17 | 0re 11180 | . . . . . 6 ⊢ 0 ∈ ℝ | |
| 18 | readdcan 11354 | . . . . . 6 ⊢ ((1 ∈ ℝ ∧ 0 ∈ ℝ ∧ 0 ∈ ℝ) → ((0 + 1) = (0 + 0) ↔ 1 = 0)) | |
| 19 | 16, 17, 17, 18 | mp3an 1481 | . . . . 5 ⊢ ((0 + 1) = (0 + 0) ↔ 1 = 0) |
| 20 | 15, 19 | sylib 220 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ (0 · 𝐴) ≠ 0) → 1 = 0) |
| 21 | 20 | ex 416 | . . 3 ⊢ (𝐴 ∈ ℝ → ((0 · 𝐴) ≠ 0 → 1 = 0)) |
| 22 | 21 | necon1d 2978 | . 2 ⊢ (𝐴 ∈ ℝ → (1 ≠ 0 → (0 · 𝐴) = 0)) |
| 23 | 1, 22 | mpi 20 | 1 ⊢ (𝐴 ∈ ℝ → (0 · 𝐴) = 0) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 ∧ wa 399 = wceq 1559 ∈ wcel 2141 ≠ wne 2956 (class class class)co 7392 ℂcc 11068 ℝcr 11069 0cc0 11070 1c1 11071 ici 11072 + caddc 11073 · cmul 11075 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-sep 5245 ax-nul 5255 ax-pow 5321 ax-pr 5389 ax-un 7714 ax-resscn 11127 ax-1cn 11128 ax-icn 11129 ax-addcl 11130 ax-addrcl 11131 ax-mulcl 11132 ax-mulrcl 11133 ax-mulcom 11134 ax-addass 11135 ax-mulass 11136 ax-distr 11137 ax-i2m1 11138 ax-1ne0 11139 ax-1rid 11140 ax-rnegex 11141 ax-rrecex 11142 ax-cnre 11143 ax-pre-lttri 11144 ax-pre-lttrn 11145 ax-pre-ltadd 11146 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1098 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-nf 1803 df-sb 2090 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3061 df-ral 3076 df-rex 3086 df-rab 3414 df-v 3455 df-sbc 3745 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4582 df-pr 4584 df-op 4588 df-uni 4865 df-br 5100 df-opab 5162 df-mpt 5181 df-id 5540 df-po 5553 df-so 5554 df-xp 5651 df-rel 5652 df-cnv 5653 df-co 5654 df-dm 5655 df-rn 5656 df-res 5657 df-ima 5658 df-iota 6473 df-fun 6519 df-fn 6520 df-f 6521 df-f1 6522 df-fo 6523 df-f1o 6524 df-fv 6525 df-ov 7395 df-er 8673 df-en 8924 df-dom 8925 df-sdom 8926 df-pnf 11215 df-mnf 11216 df-ltxr 11218 |
| This theorem is referenced by: mul02 11358 rexmul 13271 mbfmulc2lem 25689 i1fmulc 25745 itg1mulc 25746 reabssgn 44176 stoweidlem34 46572 ztprmneprm 48933 nn0sumshdiglemA 49205 nn0sumshdiglem1 49207 |
| Copyright terms: Public domain | W3C validator |