Theorem mul32d 8374

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 8351	. 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 1274	1 |- ( ph -> ( ( A x. B ) x. C ) = ( ( A x. C ) x. B ) )

Syntax hints:   -> wi 4   = 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-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-ext 2213  ax-mulcom 8176  ax-mulass 8178

This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-rex 2517  df-v 2805  df-un 3205  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-br 4094  df-iota 5293  df-fv 5341  df-ov 6031

This theorem is referenced by:  conjmulap  8951  modqmul1  10685  binom3  10965  bernneq  10968  bcm1k  11068  bcp1n  11069  resqrexlemcalc1  11637  resqrexlemnm  11641  reccn2ap  11936  binomlem  12107  tanaddap  12363  eirraplem  12401  dvds2ln  12448  divgcdcoprm0  12736  modprm0  12890  binom4  15773  gausslemma2d  15871  lgsquadlem1  15879  2lgslem3b  15896  2lgslem3c  15897  2lgslem3d  15898