| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > 1p1times | Structured version Visualization version GIF version | ||
| Description: Two times a number. (Contributed by NM, 18-May-1999.) (Revised by Mario Carneiro, 27-May-2016.) |
| Ref | Expression |
|---|---|
| 1p1times | ⊢ (𝐴 ∈ ℂ → ((1 + 1) · 𝐴) = (𝐴 + 𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 1cnd 11128 | . 2 ⊢ (𝐴 ∈ ℂ → 1 ∈ ℂ) | |
| 2 | id 22 | . 2 ⊢ (𝐴 ∈ ℂ → 𝐴 ∈ ℂ) | |
| 3 | mullid 11132 | . . 3 ⊢ (𝐴 ∈ ℂ → (1 · 𝐴) = 𝐴) | |
| 4 | 3, 3 | oveq12d 7374 | . 2 ⊢ (𝐴 ∈ ℂ → ((1 · 𝐴) + (1 · 𝐴)) = (𝐴 + 𝐴)) |
| 5 | 1, 2, 1, 4 | joinlmuladdmuld 11161 | 1 ⊢ (𝐴 ∈ ℂ → ((1 + 1) · 𝐴) = (𝐴 + 𝐴)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1542 ∈ wcel 2114 (class class class)co 7356 ℂcc 11025 1c1 11028 + caddc 11030 · cmul 11032 |
| 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-ext 2707 ax-resscn 11084 ax-1cn 11085 ax-icn 11086 ax-addcl 11087 ax-mulcl 11089 ax-mulcom 11091 ax-mulass 11093 ax-distr 11094 ax-1rid 11097 ax-cnre 11100 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-sb 2069 df-clab 2714 df-cleq 2727 df-clel 2810 df-rex 3060 df-rab 3388 df-v 3429 df-dif 3888 df-un 3890 df-ss 3902 df-nul 4264 df-if 4457 df-sn 4558 df-pr 4560 df-op 4564 df-uni 4841 df-br 5075 df-iota 6443 df-fv 6495 df-ov 7359 |
| This theorem is referenced by: addcom 11321 addcomd 11337 eqneg 11864 2times 12301 |
| Copyright terms: Public domain | W3C validator |