Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > 2times | Structured version Visualization version GIF version |
Description: Two times a number. (Contributed by NM, 10-Oct-2004.) (Revised by Mario Carneiro, 27-May-2016.) (Proof shortened by AV, 26-Feb-2020.) |
Ref | Expression |
---|---|
2times | ⊢ (𝐴 ∈ ℂ → (2 · 𝐴) = (𝐴 + 𝐴)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-2 11079 | . . 3 ⊢ 2 = (1 + 1) | |
2 | 1 | oveq1i 6660 | . 2 ⊢ (2 · 𝐴) = ((1 + 1) · 𝐴) |
3 | 1p1times 10207 | . 2 ⊢ (𝐴 ∈ ℂ → ((1 + 1) · 𝐴) = (𝐴 + 𝐴)) | |
4 | 2, 3 | syl5eq 2668 | 1 ⊢ (𝐴 ∈ ℂ → (2 · 𝐴) = (𝐴 + 𝐴)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1483 ∈ wcel 1990 (class class class)co 6650 ℂcc 9934 1c1 9937 + caddc 9939 · cmul 9941 2c2 11070 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-resscn 9993 ax-1cn 9994 ax-icn 9995 ax-addcl 9996 ax-mulcl 9998 ax-mulcom 10000 ax-mulass 10002 ax-distr 10003 ax-1rid 10006 ax-cnre 10009 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ral 2917 df-rex 2918 df-rab 2921 df-v 3202 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-nul 3916 df-if 4087 df-sn 4178 df-pr 4180 df-op 4184 df-uni 4437 df-br 4654 df-iota 5851 df-fv 5896 df-ov 6653 df-2 11079 |
This theorem is referenced by: times2 11146 2timesi 11147 2txmxeqx 11149 2halves 11260 halfaddsub 11265 avglt2 11271 2timesd 11275 expubnd 12921 subsq2 12973 absmax 14069 sinmul 14902 sin2t 14907 cos2t 14908 sadadd2lem2 15172 pythagtriplem4 15524 pythagtriplem14 15533 pythagtriplem16 15535 cncph 27674 pellexlem2 37394 acongrep 37547 sub2times 39485 2timesgt 39500 |
Copyright terms: Public domain | W3C validator |