| 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 12225 | . . 3 ⊢ 2 = (1 + 1) | |
| 2 | 1 | oveq1i 7379 | . 2 ⊢ (2 · 𝐴) = ((1 + 1) · 𝐴) |
| 3 | 1p1times 11321 | . 2 ⊢ (𝐴 ∈ ℂ → ((1 + 1) · 𝐴) = (𝐴 + 𝐴)) | |
| 4 | 2, 3 | eqtrid 2776 | 1 ⊢ (𝐴 ∈ ℂ → (2 · 𝐴) = (𝐴 + 𝐴)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1540 ∈ wcel 2109 (class class class)co 7369 ℂcc 11042 1c1 11045 + caddc 11047 · cmul 11049 2c2 12217 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-ext 2701 ax-resscn 11101 ax-1cn 11102 ax-icn 11103 ax-addcl 11104 ax-mulcl 11106 ax-mulcom 11108 ax-mulass 11110 ax-distr 11111 ax-1rid 11114 ax-cnre 11117 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-sb 2066 df-clab 2708 df-cleq 2721 df-clel 2803 df-rex 3054 df-rab 3403 df-v 3446 df-dif 3914 df-un 3916 df-ss 3928 df-nul 4293 df-if 4485 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4868 df-br 5103 df-iota 6452 df-fv 6507 df-ov 7372 df-2 12225 |
| This theorem is referenced by: times2 12294 2timesi 12295 2txmxeqx 12297 2halves 12376 halfaddsub 12391 avglt2 12397 2timesd 12401 expubnd 14119 absmax 15272 sinmul 16116 sin2t 16121 cos2t 16122 sadadd2lem2 16396 pythagtriplem4 16766 pythagtriplem14 16775 pythagtriplem16 16777 2sqreultlem 27391 2sqreunnltlem 27394 cncph 30798 pellexlem2 42811 acongrep 42962 sub2times 45264 2timesgt 45279 |
| Copyright terms: Public domain | W3C validator |