Theorem mul32 10203

Description: Commutative/associative law. (Contributed by NM, 8-Oct-1999.)

Assertion

Ref	Expression
mul32	|- ( ( A e. CC /\ B e. CC /\ C e. CC ) -> ( ( A x. B ) x. C ) = ( ( A x. C ) x. B ) )

Proof of Theorem mul32

Step	Hyp	Ref	Expression
1		mulcom 10022	. . . 4 |- ( ( B e. CC /\ C e. CC ) -> ( B x. C ) = ( C x. B ) )
2	1	oveq2d 6666	. . 3 |- ( ( B e. CC /\ C e. CC ) -> ( A x. ( B x. C ) ) = ( A x. ( C x. B ) ) )
3	2	3adant1 1079	. 2 |- ( ( A e. CC /\ B e. CC /\ C e. CC ) -> ( A x. ( B x. C ) ) = ( A x. ( C x. B ) ) )
4		mulass 10024	. 2 |- ( ( A e. CC /\ B e. CC /\ C e. CC ) -> ( ( A x. B ) x. C ) = ( A x. ( B x. C ) ) )
5		mulass 10024	. . 3 |- ( ( A e. CC /\ C e. CC /\ B e. CC ) -> ( ( A x. C ) x. B ) = ( A x. ( C x. B ) ) )
6	5	3com23 1271	. 2 |- ( ( A e. CC /\ B e. CC /\ C e. CC ) -> ( ( A x. C ) x. B ) = ( A x. ( C x. B ) ) )
7	3, 4, 6	3eqtr4d 2666	1 |- ( ( A e. CC /\ B e. CC /\ C e. CC ) -> ( ( A x. B ) x. C ) = ( ( A x. C ) x. B ) )

Syntax hints:   -> wi 4   /\ wa 384   /\ w3a 1037   = wceq 1483   e. wcel 1990  (class class class)co 6650   CCcc 9934   x. cmul 9941

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-mulcom 10000  ax-mulass 10002

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-rex 2918  df-rab 2921  df-v 3202  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-br 4654  df-iota 5851  df-fv 5896  df-ov 6653

This theorem is referenced by:  mul4  10205  mul02lem1  10212  mul32i  10232  mul32d  10246  muldvds1  15006  2sqlem6  25148  cnlnadjlem2  28927  cnlnadjlem7  28932