| 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 11161 | . 2 ⊢ (𝐴 ∈ ℂ → 1 ∈ ℂ) | |
| 2 | id 22 | . 2 ⊢ (𝐴 ∈ ℂ → 𝐴 ∈ ℂ) | |
| 3 | mullid 11166 | . . 3 ⊢ (𝐴 ∈ ℂ → (1 · 𝐴) = 𝐴) | |
| 4 | 3, 3 | oveq12d 7399 | . 2 ⊢ (𝐴 ∈ ℂ → ((1 · 𝐴) + (1 · 𝐴)) = (𝐴 + 𝐴)) |
| 5 | 1, 2, 1, 4 | joinlmuladdmuld 11195 | 1 ⊢ (𝐴 ∈ ℂ → ((1 + 1) · 𝐴) = (𝐴 + 𝐴)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1550 ∈ wcel 2132 (class class class)co 7381 ℂcc 11057 1c1 11060 + caddc 11062 · cmul 11064 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1805 ax-4 1819 ax-5 1920 ax-6 1977 ax-7 2018 ax-8 2134 ax-9 2142 ax-ext 2724 ax-resscn 11116 ax-1cn 11117 ax-icn 11118 ax-addcl 11119 ax-mulcl 11121 ax-mulcom 11123 ax-mulass 11125 ax-distr 11126 ax-1rid 11129 ax-cnre 11132 |
| This theorem depends on definitions: df-bi 209 df-an 399 df-or 857 df-3an 1097 df-tru 1553 df-fal 1563 df-ex 1790 df-sb 2081 df-clab 2731 df-cleq 2744 df-clel 2827 df-rex 3077 df-rab 3405 df-v 3446 df-dif 3898 df-un 3900 df-ss 3912 df-nul 4277 df-if 4471 df-sn 4573 df-pr 4575 df-op 4579 df-uni 4856 df-br 5091 df-iota 6462 df-fv 6514 df-ov 7384 |
| This theorem is referenced by: addcom 11355 addcomd 11371 eqneg 11897 2times 12339 |
| Copyright terms: Public domain | W3C validator |