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

Theorem mulassi 7995
Description: Associative law for multiplication. (Contributed by NM, 23-Nov-1994.)
Hypotheses
Ref Expression
axi.1  |-  A  e.  CC
axi.2  |-  B  e.  CC
axi.3  |-  C  e.  CC
Assertion
Ref Expression
mulassi  |-  ( ( A  x.  B )  x.  C )  =  ( A  x.  ( B  x.  C )
)

Proof of Theorem mulassi
StepHypRef Expression
1 axi.1 . 2  |-  A  e.  CC
2 axi.2 . 2  |-  B  e.  CC
3 axi.3 . 2  |-  C  e.  CC
4 mulass 7971 . 2  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  ->  (
( A  x.  B
)  x.  C )  =  ( A  x.  ( B  x.  C
) ) )
51, 2, 3, 4mp3an 1348 1  |-  ( ( A  x.  B )  x.  C )  =  ( A  x.  ( B  x.  C )
)
Colors of variables: wff set class
Syntax hints:    = wceq 1364    e. wcel 2160  (class class class)co 5895   CCcc 7838    x. cmul 7845
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-mulass 7943
This theorem depends on definitions:  df-bi 117  df-3an 982
This theorem is referenced by:  8th4div3  9167  numma  9456  decbin0  9552  sq4e2t8  10648  3dec  10725  ef01bndlem  11795  3dvdsdec  11901  3dvds2dec  11902  sincos4thpi  14713  sincos6thpi  14715  2lgsoddprmlem3d  14911
  Copyright terms: Public domain W3C validator