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

Theorem mul4 8405
Description: Rearrangement of 4 factors. (Contributed by NM, 8-Oct-1999.)
Assertion
Ref Expression
mul4  |-  ( ( ( A  e.  CC  /\  B  e.  CC )  /\  ( C  e.  CC  /\  D  e.  CC ) )  -> 
( ( A  x.  B )  x.  ( C  x.  D )
)  =  ( ( A  x.  C )  x.  ( B  x.  D ) ) )

Proof of Theorem mul4
StepHypRef Expression
1 mul32 8403 . . . . 5  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  ->  (
( A  x.  B
)  x.  C )  =  ( ( A  x.  C )  x.  B ) )
21oveq1d 6065 . . . 4  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  ->  (
( ( A  x.  B )  x.  C
)  x.  D )  =  ( ( ( A  x.  C )  x.  B )  x.  D ) )
323expa 1230 . . 3  |-  ( ( ( A  e.  CC  /\  B  e.  CC )  /\  C  e.  CC )  ->  ( ( ( A  x.  B )  x.  C )  x.  D )  =  ( ( ( A  x.  C )  x.  B
)  x.  D ) )
43adantrr 479 . 2  |-  ( ( ( A  e.  CC  /\  B  e.  CC )  /\  ( C  e.  CC  /\  D  e.  CC ) )  -> 
( ( ( A  x.  B )  x.  C )  x.  D
)  =  ( ( ( A  x.  C
)  x.  B )  x.  D ) )
5 mulcl 8254 . . 3  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( A  x.  B
)  e.  CC )
6 mulass 8258 . . . 4  |-  ( ( ( A  x.  B
)  e.  CC  /\  C  e.  CC  /\  D  e.  CC )  ->  (
( ( A  x.  B )  x.  C
)  x.  D )  =  ( ( A  x.  B )  x.  ( C  x.  D
) ) )
763expb 1231 . . 3  |-  ( ( ( A  x.  B
)  e.  CC  /\  ( C  e.  CC  /\  D  e.  CC ) )  ->  ( (
( A  x.  B
)  x.  C )  x.  D )  =  ( ( A  x.  B )  x.  ( C  x.  D )
) )
85, 7sylan 283 . 2  |-  ( ( ( A  e.  CC  /\  B  e.  CC )  /\  ( C  e.  CC  /\  D  e.  CC ) )  -> 
( ( ( A  x.  B )  x.  C )  x.  D
)  =  ( ( A  x.  B )  x.  ( C  x.  D ) ) )
9 mulcl 8254 . . . 4  |-  ( ( A  e.  CC  /\  C  e.  CC )  ->  ( A  x.  C
)  e.  CC )
10 mulass 8258 . . . . 5  |-  ( ( ( A  x.  C
)  e.  CC  /\  B  e.  CC  /\  D  e.  CC )  ->  (
( ( A  x.  C )  x.  B
)  x.  D )  =  ( ( A  x.  C )  x.  ( B  x.  D
) ) )
11103expb 1231 . . . 4  |-  ( ( ( A  x.  C
)  e.  CC  /\  ( B  e.  CC  /\  D  e.  CC ) )  ->  ( (
( A  x.  C
)  x.  B )  x.  D )  =  ( ( A  x.  C )  x.  ( B  x.  D )
) )
129, 11sylan 283 . . 3  |-  ( ( ( A  e.  CC  /\  C  e.  CC )  /\  ( B  e.  CC  /\  D  e.  CC ) )  -> 
( ( ( A  x.  C )  x.  B )  x.  D
)  =  ( ( A  x.  C )  x.  ( B  x.  D ) ) )
1312an4s 592 . 2  |-  ( ( ( A  e.  CC  /\  B  e.  CC )  /\  ( C  e.  CC  /\  D  e.  CC ) )  -> 
( ( ( A  x.  C )  x.  B )  x.  D
)  =  ( ( A  x.  C )  x.  ( B  x.  D ) ) )
144, 8, 133eqtr3d 2273 1  |-  ( ( ( A  e.  CC  /\  B  e.  CC )  /\  ( C  e.  CC  /\  D  e.  CC ) )  -> 
( ( A  x.  B )  x.  ( C  x.  D )
)  =  ( ( A  x.  C )  x.  ( B  x.  D ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    /\ w3a 1005    = wceq 1398    e. wcel 2203  (class class class)co 6050   CCcc 8125    x. cmul 8132
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-ext 2214  ax-mulcl 8225  ax-mulcom 8228  ax-mulass 8230
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-rex 2526  df-v 2815  df-un 3215  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-br 4110  df-iota 5312  df-fv 5360  df-ov 6053
This theorem is referenced by:  mul4i  8421  mul4d  8428  recextlem1  8925  divmuldivap  8986  mulexp  10940  demoivreALT  12460
  Copyright terms: Public domain W3C validator