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

Theorem mul12i 9097
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 9068 . 2  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  ->  ( A  x.  ( B  x.  C ) )  =  ( B  x.  ( A  x.  C )
) )
51, 2, 3, 4mp3an 1277 1  |-  ( A  x.  ( B  x.  C ) )  =  ( B  x.  ( A  x.  C )
)
Colors of variables: wff set class
Syntax hints:    = wceq 1642    e. wcel 1710  (class class class)co 5945   CCcc 8825    x. cmul 8832
This theorem is referenced by:  faclbnd4lem1  11399  decsplit  13195  root1eq1  20206  cxpeq  20208  1cubrlem  20248  efiatan2  20324  2efiatan  20325  tanatan  20326  log2ublem2  20354  log2ublem3  20355  bposlem8  20642  ip1ilem  21518  ipasslem10  21531  polid2i  21850  ax5seglem7  25122  bpoly3  25352
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1546  ax-5 1557  ax-17 1616  ax-9 1654  ax-8 1675  ax-6 1729  ax-7 1734  ax-11 1746  ax-12 1930  ax-ext 2339  ax-mulcom 8891  ax-mulass 8893
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3an 936  df-tru 1319  df-ex 1542  df-nf 1545  df-sb 1649  df-clab 2345  df-cleq 2351  df-clel 2354  df-nfc 2483  df-rex 2625  df-rab 2628  df-v 2866  df-dif 3231  df-un 3233  df-in 3235  df-ss 3242  df-nul 3532  df-if 3642  df-sn 3722  df-pr 3723  df-op 3725  df-uni 3909  df-br 4105  df-iota 5301  df-fv 5345  df-ov 5948
  Copyright terms: Public domain W3C validator