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

Theorem adddiri 9607
Description: Distributive law (right-distributivity). (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 9587 . 2  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  ->  (
( A  +  B
)  x.  C )  =  ( ( A  x.  C )  +  ( B  x.  C
) ) )
51, 2, 3, 4mp3an 1324 1  |-  ( ( A  +  B )  x.  C )  =  ( ( A  x.  C )  +  ( B  x.  C ) )
Colors of variables: wff setvar class
Syntax hints:    = wceq 1379    e. wcel 1767  (class class class)co 6284   CCcc 9490    + caddc 9495    x. cmul 9497
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1601  ax-4 1612  ax-5 1680  ax-6 1719  ax-7 1739  ax-10 1786  ax-11 1791  ax-12 1803  ax-13 1968  ax-ext 2445  ax-addcl 9552  ax-mulcom 9556  ax-distr 9559
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3an 975  df-tru 1382  df-ex 1597  df-nf 1600  df-sb 1712  df-clab 2453  df-cleq 2459  df-clel 2462  df-nfc 2617  df-rex 2820  df-rab 2823  df-v 3115  df-dif 3479  df-un 3481  df-in 3483  df-ss 3490  df-nul 3786  df-if 3940  df-sn 4028  df-pr 4030  df-op 4034  df-uni 4246  df-br 4448  df-iota 5551  df-fv 5596  df-ov 6287
This theorem is referenced by:  numma  11007  binom2i  12245  binom2aiOLD  12246  dec5nprm  14411  dec2nprm  14412  mod2xnegi  14416  karatsuba  14429  sincosq3sgn  22654  sincosq4sgn  22655  ang180lem2  22898  1cubrlem  22928  bposlem8  23322  normlem3  25733  problem2  28523  areaquad  30817
  Copyright terms: Public domain W3C validator