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

Theorem adddiri 9102
Description: Distributive law. (Contributed by NM, 16-Feb-1995.)
Hypotheses
Ref Expression
axi.1  |-  A  e.  CC
axi.2  |-  B  e.  CC
axi.3  |-  C  e.  CC
Assertion
Ref Expression
adddiri  |-  ( ( A  +  B )  x.  C )  =  ( ( A  x.  C )  +  ( B  x.  C ) )

Proof of Theorem adddiri
StepHypRef Expression
1 axi.1 . 2  |-  A  e.  CC
2 axi.2 . 2  |-  B  e.  CC
3 axi.3 . 2  |-  C  e.  CC
4 adddir 9084 . 2  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  ->  (
( A  +  B
)  x.  C )  =  ( ( A  x.  C )  +  ( B  x.  C
) ) )
51, 2, 3, 4mp3an 1280 1  |-  ( ( A  +  B )  x.  C )  =  ( ( A  x.  C )  +  ( B  x.  C ) )
Colors of variables: wff set class
Syntax hints:    = wceq 1653    e. wcel 1726  (class class class)co 6082   CCcc 8989    + caddc 8994    x. cmul 8996
This theorem is referenced by:  numma  10414  binom2i  11491  binom2aiOLD  11492  dec5nprm  13403  dec2nprm  13404  mod2xnegi  13408  karatsuba  13421  sincosq3sgn  20409  sincosq4sgn  20410  ang180lem2  20653  1cubrlem  20682  bposlem8  21076  normlem3  22615
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1556  ax-5 1567  ax-17 1627  ax-9 1667  ax-8 1688  ax-6 1745  ax-7 1750  ax-11 1762  ax-12 1951  ax-ext 2418  ax-addcl 9051  ax-mulcom 9055  ax-distr 9058
This theorem depends on definitions:  df-bi 179  df-or 361  df-an 362  df-3an 939  df-tru 1329  df-ex 1552  df-nf 1555  df-sb 1660  df-clab 2424  df-cleq 2430  df-clel 2433  df-nfc 2562  df-rex 2712  df-rab 2715  df-v 2959  df-dif 3324  df-un 3326  df-in 3328  df-ss 3335  df-nul 3630  df-if 3741  df-sn 3821  df-pr 3822  df-op 3824  df-uni 4017  df-br 4214  df-iota 5419  df-fv 5463  df-ov 6085
  Copyright terms: Public domain W3C validator