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

Theorem mul31 8039
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 7892 . . . 4  |-  ( ( B  e.  CC  /\  C  e.  CC )  ->  ( B  x.  C
)  =  ( C  x.  B ) )
21oveq2d 5867 . . 3  |-  ( ( B  e.  CC  /\  C  e.  CC )  ->  ( A  x.  ( B  x.  C )
)  =  ( A  x.  ( C  x.  B ) ) )
323adant1 1010 . 2  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  ->  ( A  x.  ( B  x.  C ) )  =  ( A  x.  ( C  x.  B )
) )
4 mulass 7894 . 2  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  ->  (
( A  x.  B
)  x.  C )  =  ( A  x.  ( B  x.  C
) ) )
5 mulcl 7890 . . . . 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 1010 . . 3  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  ->  ( C  x.  B )  e.  CC )
8 simp1 992 . . 3  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  ->  A  e.  CC )
97, 8mulcomd 7930 . 2  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  ->  (
( C  x.  B
)  x.  A )  =  ( A  x.  ( C  x.  B
) ) )
103, 4, 93eqtr4d 2213 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 973    = wceq 1348    e. wcel 2141  (class class class)co 5851   CCcc 7761    x. cmul 7768
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 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-ext 2152  ax-mulcl 7861  ax-mulcom 7864  ax-mulass 7866
This theorem depends on definitions:  df-bi 116  df-3an 975  df-tru 1351  df-nf 1454  df-sb 1756  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-rex 2454  df-v 2732  df-un 3125  df-sn 3587  df-pr 3588  df-op 3590  df-uni 3795  df-br 3988  df-iota 5158  df-fv 5204  df-ov 5854
This theorem is referenced by:  mul31d  8062
  Copyright terms: Public domain W3C validator