| 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 11201 | . 2 ⊢ (𝐴 ∈ ℂ → 1 ∈ ℂ) | |
| 2 | id 23 | . 2 ⊢ (𝐴 ∈ ℂ → 𝐴 ∈ ℂ) | |
| 3 | mullid 11206 | . . 3 ⊢ (𝐴 ∈ ℂ → (1 · 𝐴) = 𝐴) | |
| 4 | 3, 3 | oveq12d 7429 | . 2 ⊢ (𝐴 ∈ ℂ → ((1 · 𝐴) + (1 · 𝐴)) = (𝐴 + 𝐴)) |
| 5 | 1, 2, 1, 4 | joinlmuladdmuld 11235 | 1 ⊢ (𝐴 ∈ ℂ → ((1 + 1) · 𝐴) = (𝐴 + 𝐴)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1567 ∈ wcel 2149 (class class class)co 7411 ℂcc 11097 1c1 11100 + caddc 11102 · cmul 11104 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-ext 2741 ax-resscn 11156 ax-1cn 11157 ax-icn 11158 ax-addcl 11159 ax-mulcl 11161 ax-mulcom 11163 ax-mulass 11165 ax-distr 11166 ax-1rid 11169 ax-cnre 11172 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-sb 2098 df-clab 2748 df-cleq 2761 df-clel 2844 df-rex 3096 df-rab 3424 df-v 3465 df-dif 3916 df-un 3918 df-ss 3930 df-nul 4295 df-if 4493 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4877 df-br 5114 df-iota 6493 df-fv 6545 df-ov 7414 |
| This theorem is referenced by: addcom 11395 addcomd 11411 eqneg 11934 2times 12375 |
| Copyright terms: Public domain | W3C validator |