Theorem mul32d 8196

Description: Commutative/associative law that swaps the last two factors in a triple product. (Contributed by Mario Carneiro, 27-May-2016.)

Hypotheses

Ref	Expression
muld.1	|- ( ph -> A e. CC )
addcomd.2	|- ( ph -> B e. CC )
mul12d.3	|- ( ph -> C e. CC )

Assertion

Ref	Expression
mul32d	|- ( ph -> ( ( A x. B ) x. C ) = ( ( A x. C ) x. B ) )

Proof of Theorem mul32d

Step	Hyp	Ref	Expression
1		muld.1	. 2 |- ( ph -> A e. CC )
2		addcomd.2	. 2 |- ( ph -> B e. CC )
3		mul12d.3	. 2 |- ( ph -> C e. CC )
4		mul32 8173	. 2 |- ( ( A e. CC /\ B e. CC /\ C e. CC ) -> ( ( A x. B ) x. C ) = ( ( A x. C ) x. B ) )
5	1, 2, 3, 4	syl3anc 1249	1 |- ( ph -> ( ( A x. B ) x. C ) = ( ( A x. C ) x. B ) )

Syntax hints:   -> wi 4   = wceq 1364   e. wcel 2167  (class class class)co 5925   CCcc 7894   x. cmul 7901

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-io 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-ext 2178  ax-mulcom 7997  ax-mulass 7999

This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1475  df-sb 1777  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-rex 2481  df-v 2765  df-un 3161  df-sn 3629  df-pr 3630  df-op 3632  df-uni 3841  df-br 4035  df-iota 5220  df-fv 5267  df-ov 5928

This theorem is referenced by:  conjmulap  8773  modqmul1  10486  binom3  10766  bernneq  10769  bcm1k  10869  bcp1n  10870  resqrexlemcalc1  11196  resqrexlemnm  11200  reccn2ap  11495  binomlem  11665  tanaddap  11921  eirraplem  11959  dvds2ln  12006  divgcdcoprm0  12294  modprm0  12448  binom4  15299  gausslemma2d  15394  lgsquadlem1  15402  2lgslem3b  15419  2lgslem3c  15420  2lgslem3d  15421