ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  1p1times Unicode version

Theorem 1p1times 8160
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 7972 . . . 4  |-  1  e.  CC
21a1i 9 . . 3  |-  ( A  e.  CC  ->  1  e.  CC )
3 id 19 . . 3  |-  ( A  e.  CC  ->  A  e.  CC )
42, 2, 3adddird 8052 . 2  |-  ( A  e.  CC  ->  (
( 1  +  1 )  x.  A )  =  ( ( 1  x.  A )  +  ( 1  x.  A
) ) )
5 mullid 8024 . . 3  |-  ( A  e.  CC  ->  (
1  x.  A )  =  A )
65, 5oveq12d 5940 . 2  |-  ( A  e.  CC  ->  (
( 1  x.  A
)  +  ( 1  x.  A ) )  =  ( A  +  A ) )
74, 6eqtrd 2229 1  |-  ( A  e.  CC  ->  (
( 1  +  1 )  x.  A )  =  ( A  +  A ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1364    e. wcel 2167  (class class class)co 5922   CCcc 7877   1c1 7880    + caddc 7882    x. cmul 7884
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-ext 2178  ax-resscn 7971  ax-1cn 7972  ax-icn 7974  ax-addcl 7975  ax-mulcl 7977  ax-mulcom 7980  ax-mulass 7982  ax-distr 7983  ax-1rid 7986  ax-cnre 7990
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1475  df-sb 1777  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ral 2480  df-rex 2481  df-v 2765  df-un 3161  df-in 3163  df-ss 3170  df-sn 3628  df-pr 3629  df-op 3631  df-uni 3840  df-br 4034  df-iota 5219  df-fv 5266  df-ov 5925
This theorem is referenced by:  eqneg  8759  2times  9118
  Copyright terms: Public domain W3C validator