MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  mul12i Unicode version

Theorem mul12i 9221
Description: Commutative/associative law that swaps the first two factors in a triple product. (Contributed by NM, 11-May-1999.) (Proof shortened by Andrew Salmon, 19-Nov-2011.)
Hypotheses
Ref Expression
mul.1  |-  A  e.  CC
mul.2  |-  B  e.  CC
mul.3  |-  C  e.  CC
Assertion
Ref Expression
mul12i  |-  ( A  x.  ( B  x.  C ) )  =  ( B  x.  ( A  x.  C )
)

Proof of Theorem mul12i
StepHypRef Expression
1 mul.1 . 2  |-  A  e.  CC
2 mul.2 . 2  |-  B  e.  CC
3 mul.3 . 2  |-  C  e.  CC
4 mul12 9192 . 2  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  ->  ( A  x.  ( B  x.  C ) )  =  ( B  x.  ( A  x.  C )
) )
51, 2, 3, 4mp3an 1279 1  |-  ( A  x.  ( B  x.  C ) )  =  ( B  x.  ( A  x.  C )
)
Colors of variables: wff set class
Syntax hints:    = wceq 1649    e. wcel 1721  (class class class)co 6044   CCcc 8948    x. cmul 8955
This theorem is referenced by:  faclbnd4lem1  11543  decsplit  13378  root1eq1  20596  cxpeq  20598  1cubrlem  20638  efiatan2  20714  2efiatan  20715  tanatan  20716  log2ublem2  20744  log2ublem3  20745  bposlem8  21032  ip1ilem  22284  ipasslem10  22297  polid2i  22616  ax5seglem7  25782  bpoly3  26012
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1552  ax-5 1563  ax-17 1623  ax-9 1662  ax-8 1683  ax-6 1740  ax-7 1745  ax-11 1757  ax-12 1946  ax-ext 2389  ax-mulcom 9014  ax-mulass 9016
This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-3an 938  df-tru 1325  df-ex 1548  df-nf 1551  df-sb 1656  df-clab 2395  df-cleq 2401  df-clel 2404  df-nfc 2533  df-rex 2676  df-rab 2679  df-v 2922  df-dif 3287  df-un 3289  df-in 3291  df-ss 3298  df-nul 3593  df-if 3704  df-sn 3784  df-pr 3785  df-op 3787  df-uni 3980  df-br 4177  df-iota 5381  df-fv 5425  df-ov 6047
  Copyright terms: Public domain W3C validator