ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  mul31 Unicode version

Theorem mul31 7861
Description: Commutative/associative law. (Contributed by Scott Fenton, 3-Jan-2013.)
Assertion
Ref Expression
mul31  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  ->  (
( A  x.  B
)  x.  C )  =  ( ( C  x.  B )  x.  A ) )

Proof of Theorem mul31
StepHypRef Expression
1 mulcom 7717 . . . 4  |-  ( ( B  e.  CC  /\  C  e.  CC )  ->  ( B  x.  C
)  =  ( C  x.  B ) )
21oveq2d 5758 . . 3  |-  ( ( B  e.  CC  /\  C  e.  CC )  ->  ( A  x.  ( B  x.  C )
)  =  ( A  x.  ( C  x.  B ) ) )
323adant1 984 . 2  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  ->  ( A  x.  ( B  x.  C ) )  =  ( A  x.  ( C  x.  B )
) )
4 mulass 7719 . 2  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  ->  (
( A  x.  B
)  x.  C )  =  ( A  x.  ( B  x.  C
) ) )
5 mulcl 7715 . . . . 5  |-  ( ( C  e.  CC  /\  B  e.  CC )  ->  ( C  x.  B
)  e.  CC )
65ancoms 266 . . . 4  |-  ( ( B  e.  CC  /\  C  e.  CC )  ->  ( C  x.  B
)  e.  CC )
763adant1 984 . . 3  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  ->  ( C  x.  B )  e.  CC )
8 simp1 966 . . 3  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  ->  A  e.  CC )
97, 8mulcomd 7755 . 2  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  ->  (
( C  x.  B
)  x.  A )  =  ( A  x.  ( C  x.  B
) ) )
103, 4, 93eqtr4d 2160 1  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  ->  (
( A  x.  B
)  x.  C )  =  ( ( C  x.  B )  x.  A ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    /\ w3a 947    = wceq 1316    e. wcel 1465  (class class class)co 5742   CCcc 7586    x. cmul 7593
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 683  ax-5 1408  ax-7 1409  ax-gen 1410  ax-ie1 1454  ax-ie2 1455  ax-8 1467  ax-10 1468  ax-11 1469  ax-i12 1470  ax-bndl 1471  ax-4 1472  ax-17 1491  ax-i9 1495  ax-ial 1499  ax-i5r 1500  ax-ext 2099  ax-mulcl 7686  ax-mulcom 7689  ax-mulass 7691
This theorem depends on definitions:  df-bi 116  df-3an 949  df-tru 1319  df-nf 1422  df-sb 1721  df-clab 2104  df-cleq 2110  df-clel 2113  df-nfc 2247  df-rex 2399  df-v 2662  df-un 3045  df-sn 3503  df-pr 3504  df-op 3506  df-uni 3707  df-br 3900  df-iota 5058  df-fv 5101  df-ov 5745
This theorem is referenced by:  mul31d  7884
  Copyright terms: Public domain W3C validator