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

Theorem mulassi 8231
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 8206 . 2  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  ->  (
( A  x.  B
)  x.  C )  =  ( A  x.  ( B  x.  C
) ) )
51, 2, 3, 4mp3an 1374 1  |-  ( ( A  x.  B )  x.  C )  =  ( A  x.  ( B  x.  C )
)
Colors of variables: wff set class
Syntax hints:    = wceq 1398    e. wcel 2202  (class class class)co 6028   CCcc 8073    x. cmul 8080
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 8178
This theorem depends on definitions:  df-bi 117  df-3an 1007
This theorem is referenced by:  8th4div3  9406  numma  9697  decbin0  9793  sq4e2t8  10943  3dec  11020  ef01bndlem  12378  3dvdsdec  12487  3dvds2dec  12488  dec5dvds  13046  karatsuba  13064  sincos4thpi  15631  sincos6thpi  15633  2lgsoddprmlem3d  15909
  Copyright terms: Public domain W3C validator