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 11694 | . . 3 ⊢ 2 = (1 + 1) | |
2 | 1 | oveq1i 7160 | . 2 ⊢ (2 · 𝐴) = ((1 + 1) · 𝐴) |
3 | 1p1times 10805 | . 2 ⊢ (𝐴 ∈ ℂ → ((1 + 1) · 𝐴) = (𝐴 + 𝐴)) | |
4 | 2, 3 | syl5eq 2868 | 1 ⊢ (𝐴 ∈ ℂ → (2 · 𝐴) = (𝐴 + 𝐴)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1533 ∈ wcel 2110 (class class class)co 7150 ℂcc 10529 1c1 10532 + caddc 10534 · cmul 10536 2c2 11686 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2156 ax-12 2172 ax-ext 2793 ax-resscn 10588 ax-1cn 10589 ax-icn 10590 ax-addcl 10591 ax-mulcl 10593 ax-mulcom 10595 ax-mulass 10597 ax-distr 10598 ax-1rid 10601 ax-cnre 10604 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ral 3143 df-rex 3144 df-rab 3147 df-v 3497 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-nul 4292 df-if 4468 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4833 df-br 5060 df-iota 6309 df-fv 6358 df-ov 7153 df-2 11694 |
This theorem is referenced by: times2 11768 2timesi 11769 2txmxeqx 11771 2halves 11859 halfaddsub 11864 avglt2 11870 2timesd 11874 expubnd 13535 absmax 14683 sinmul 15519 sin2t 15524 cos2t 15525 sadadd2lem2 15793 pythagtriplem4 16150 pythagtriplem14 16159 pythagtriplem16 16161 2sqreultlem 26017 2sqreunnltlem 26020 cncph 28590 pellexlem2 39420 acongrep 39570 sub2times 41532 2timesgt 41546 |
Copyright terms: Public domain | W3C validator |