Theorem mul12d 8050

Description: Commutative/associative law that swaps the first 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
mul12d	|- ( ph -> ( A x. ( B x. C ) ) = ( B x. ( A x. C ) ) )

Proof of Theorem mul12d

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		mul12 8027	. 2 |- ( ( A e. CC /\ B e. CC /\ C e. CC ) -> ( A x. ( B x. C ) ) = ( B x. ( A x. C ) ) )
5	1, 2, 3, 4	syl3anc 1228	1 |- ( ph -> ( A x. ( B x. C ) ) = ( B x. ( A x. C ) ) )

Syntax hints:   -> wi 4   = wceq 1343   e. wcel 2136  (class class class)co 5842   CCcc 7751   x. cmul 7758

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-ext 2147  ax-mulcom 7854  ax-mulass 7856

This theorem depends on definitions:  df-bi 116  df-3an 970  df-tru 1346  df-nf 1449  df-sb 1751  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-rex 2450  df-v 2728  df-un 3120  df-sn 3582  df-pr 3583  df-op 3585  df-uni 3790  df-br 3983  df-iota 5153  df-fv 5196  df-ov 5845

This theorem is referenced by:  mulreim  8502  divrecap  8584  remullem  10813  cvgratnnlemnexp  11465  cvgratnnlemmn  11466  tanval3ap  11655  sinadd  11677  dvdscmulr  11760  bezoutlemnewy  11929  dvdsmulgcd  11958  lcmgcdlem  12009  cncongr1  12035  prmdiv  12167  tangtx  13399  2sqlem4  13594