| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > mul02lem2 | Structured version Visualization version GIF version | ||
| Description: Lemma for mul02 11315. 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 11099 | . 2 ⊢ 1 ≠ 0 | |
| 2 | ax-1cn 11088 | . . . . . . . . 9 ⊢ 1 ∈ ℂ | |
| 3 | mul02lem1 11313 | . . . . . . . . 9 ⊢ (((𝐴 ∈ ℝ ∧ (0 · 𝐴) ≠ 0) ∧ 1 ∈ ℂ) → 1 = (1 + 1)) | |
| 4 | 2, 3 | mpan2 692 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℝ ∧ (0 · 𝐴) ≠ 0) → 1 = (1 + 1)) |
| 5 | 4 | eqcomd 2743 | . . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ (0 · 𝐴) ≠ 0) → (1 + 1) = 1) |
| 6 | 5 | oveq2d 7376 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ (0 · 𝐴) ≠ 0) → ((i · i) + (1 + 1)) = ((i · i) + 1)) |
| 7 | ax-icn 11089 | . . . . . . . . 9 ⊢ i ∈ ℂ | |
| 8 | 7, 7 | mulcli 11143 | . . . . . . . 8 ⊢ (i · i) ∈ ℂ |
| 9 | 8, 2, 2 | addassi 11146 | . . . . . . 7 ⊢ (((i · i) + 1) + 1) = ((i · i) + (1 + 1)) |
| 10 | ax-i2m1 11098 | . . . . . . . 8 ⊢ ((i · i) + 1) = 0 | |
| 11 | 10 | oveq1i 7370 | . . . . . . 7 ⊢ (((i · i) + 1) + 1) = (0 + 1) |
| 12 | 9, 11 | eqtr3i 2762 | . . . . . 6 ⊢ ((i · i) + (1 + 1)) = (0 + 1) |
| 13 | 00id 11312 | . . . . . . 7 ⊢ (0 + 0) = 0 | |
| 14 | 10, 13 | eqtr4i 2763 | . . . . . 6 ⊢ ((i · i) + 1) = (0 + 0) |
| 15 | 6, 12, 14 | 3eqtr3g 2795 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ (0 · 𝐴) ≠ 0) → (0 + 1) = (0 + 0)) |
| 16 | 1re 11136 | . . . . . 6 ⊢ 1 ∈ ℝ | |
| 17 | 0re 11138 | . . . . . 6 ⊢ 0 ∈ ℝ | |
| 18 | readdcan 11311 | . . . . . 6 ⊢ ((1 ∈ ℝ ∧ 0 ∈ ℝ ∧ 0 ∈ ℝ) → ((0 + 1) = (0 + 0) ↔ 1 = 0)) | |
| 19 | 16, 17, 17, 18 | mp3an 1464 | . . . . 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 2955 | . 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 1542 ∈ wcel 2114 ≠ wne 2933 (class class class)co 7360 ℂcc 11028 ℝcr 11029 0cc0 11030 1c1 11031 ici 11032 + caddc 11033 · cmul 11035 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5242 ax-nul 5252 ax-pow 5311 ax-pr 5378 ax-un 7682 ax-resscn 11087 ax-1cn 11088 ax-icn 11089 ax-addcl 11090 ax-addrcl 11091 ax-mulcl 11092 ax-mulrcl 11093 ax-mulcom 11094 ax-addass 11095 ax-mulass 11096 ax-distr 11097 ax-i2m1 11098 ax-1ne0 11099 ax-1rid 11100 ax-rnegex 11101 ax-rrecex 11102 ax-cnre 11103 ax-pre-lttri 11104 ax-pre-lttrn 11105 ax-pre-ltadd 11106 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3062 df-rab 3401 df-v 3443 df-sbc 3742 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4287 df-if 4481 df-pw 4557 df-sn 4582 df-pr 4584 df-op 4588 df-uni 4865 df-br 5100 df-opab 5162 df-mpt 5181 df-id 5520 df-po 5533 df-so 5534 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-iota 6449 df-fun 6495 df-fn 6496 df-f 6497 df-f1 6498 df-fo 6499 df-f1o 6500 df-fv 6501 df-ov 7363 df-er 8637 df-en 8888 df-dom 8889 df-sdom 8890 df-pnf 11172 df-mnf 11173 df-ltxr 11175 |
| This theorem is referenced by: mul02 11315 rexmul 13190 mbfmulc2lem 25608 i1fmulc 25664 itg1mulc 25665 reabssgn 43913 stoweidlem34 46314 ztprmneprm 48629 nn0sumshdiglemA 48901 nn0sumshdiglem1 48903 |
| Copyright terms: Public domain | W3C validator |