MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  1p1times Structured version   Unicode version

Theorem 1p1times 9237
Description: Two times a number. (Contributed by NM, 18-May-1999.) (Revised by Mario Carneiro, 27-May-2016.)
Assertion
Ref Expression
1p1times  |-  ( A  e.  CC  ->  (
( 1  +  1 )  x.  A )  =  ( A  +  A ) )

Proof of Theorem 1p1times
StepHypRef Expression
1 ax-1cn 9048 . . . 4  |-  1  e.  CC
21a1i 11 . . 3  |-  ( A  e.  CC  ->  1  e.  CC )
3 id 20 . . 3  |-  ( A  e.  CC  ->  A  e.  CC )
42, 2, 3adddird 9113 . 2  |-  ( A  e.  CC  ->  (
( 1  +  1 )  x.  A )  =  ( ( 1  x.  A )  +  ( 1  x.  A
) ) )
5 mulid2 9089 . . 3  |-  ( A  e.  CC  ->  (
1  x.  A )  =  A )
65, 5oveq12d 6099 . 2  |-  ( A  e.  CC  ->  (
( 1  x.  A
)  +  ( 1  x.  A ) )  =  ( A  +  A ) )
74, 6eqtrd 2468 1  |-  ( A  e.  CC  ->  (
( 1  +  1 )  x.  A )  =  ( A  +  A ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1652    e. wcel 1725  (class class class)co 6081   CCcc 8988   1c1 8991    + caddc 8993    x. cmul 8995
This theorem is referenced by:  addcom  9252  addcomd  9268  eqneg  9734
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1555  ax-5 1566  ax-17 1626  ax-9 1666  ax-8 1687  ax-6 1744  ax-7 1749  ax-11 1761  ax-12 1950  ax-ext 2417  ax-resscn 9047  ax-1cn 9048  ax-icn 9049  ax-addcl 9050  ax-mulcl 9052  ax-mulcom 9054  ax-mulass 9056  ax-distr 9057  ax-1rid 9060  ax-cnre 9063
This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-3an 938  df-tru 1328  df-ex 1551  df-nf 1554  df-sb 1659  df-clab 2423  df-cleq 2429  df-clel 2432  df-nfc 2561  df-ral 2710  df-rex 2711  df-rab 2714  df-v 2958  df-dif 3323  df-un 3325  df-in 3327  df-ss 3334  df-nul 3629  df-if 3740  df-sn 3820  df-pr 3821  df-op 3823  df-uni 4016  df-br 4213  df-iota 5418  df-fv 5462  df-ov 6084
  Copyright terms: Public domain W3C validator