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

Theorem mul4 7145
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 7143 . . . . 5  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  ->  (
( A  x.  B
)  x.  C )  =  ( ( A  x.  C )  x.  B ) )
21oveq1d 5527 . . . 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 1104 . . 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 448 . 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 7008 . . 3  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( A  x.  B
)  e.  CC )
6 mulass 7012 . . . 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 1105 . . 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 267 . 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 7008 . . . 4  |-  ( ( A  e.  CC  /\  C  e.  CC )  ->  ( A  x.  C
)  e.  CC )
10 mulass 7012 . . . . 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 1105 . . . 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 267 . . 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 522 . 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 2080 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 97    /\ w3a 885    = wceq 1243    e. wcel 1393  (class class class)co 5512   CCcc 6887    x. cmul 6894
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-io 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022  ax-mulcl 6982  ax-mulcom 6985  ax-mulass 6987
This theorem depends on definitions:  df-bi 110  df-3an 887  df-tru 1246  df-nf 1350  df-sb 1646  df-clab 2027  df-cleq 2033  df-clel 2036  df-nfc 2167  df-rex 2312  df-v 2559  df-un 2922  df-sn 3381  df-pr 3382  df-op 3384  df-uni 3581  df-br 3765  df-iota 4867  df-fv 4910  df-ov 5515
This theorem is referenced by:  mul4i  7161  mul4d  7168  recextlem1  7632  divmuldivap  7688  mulexp  9294
  Copyright terms: Public domain W3C validator