Theorem mulassi 8101

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

Step	Hyp	Ref	Expression
1		axi.1	. 2 |- A e. CC
2		axi.2	. 2 |- B e. CC
3		axi.3	. 2 |- C e. CC
4		mulass 8076	. 2 |- ( ( A e. CC /\ B e. CC /\ C e. CC ) -> ( ( A x. B ) x. C ) = ( A x. ( B x. C ) ) )
5	1, 2, 3, 4	mp3an 1350	1 |- ( ( A x. B ) x. C ) = ( A x. ( B x. C ) )

Syntax hints:   = wceq 1373   e. wcel 2177  (class class class)co 5957   CCcc 7943   x. cmul 7950

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 8048

This theorem depends on definitions:  df-bi 117  df-3an 983

This theorem is referenced by:  8th4div3  9276  numma  9567  decbin0  9663  sq4e2t8  10804  3dec  10881  ef01bndlem  12142  3dvdsdec  12251  3dvds2dec  12252  dec5dvds  12810  karatsuba  12828  sincos4thpi  15387  sincos6thpi  15389  2lgsoddprmlem3d  15662