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

Theorem add4 8187
Description: Rearrangement of 4 terms in a sum. (Contributed by NM, 13-Nov-1999.) (Proof shortened by Andrew Salmon, 22-Oct-2011.)
Assertion
Ref Expression
add4  |-  ( ( ( A  e.  CC  /\  B  e.  CC )  /\  ( C  e.  CC  /\  D  e.  CC ) )  -> 
( ( A  +  B )  +  ( C  +  D ) )  =  ( ( A  +  C )  +  ( B  +  D ) ) )

Proof of Theorem add4
StepHypRef Expression
1 add12 8184 . . . . 5  |-  ( ( B  e.  CC  /\  C  e.  CC  /\  D  e.  CC )  ->  ( B  +  ( C  +  D ) )  =  ( C  +  ( B  +  D ) ) )
213expb 1206 . . . 4  |-  ( ( B  e.  CC  /\  ( C  e.  CC  /\  D  e.  CC ) )  ->  ( B  +  ( C  +  D ) )  =  ( C  +  ( B  +  D ) ) )
32oveq2d 5938 . . 3  |-  ( ( B  e.  CC  /\  ( C  e.  CC  /\  D  e.  CC ) )  ->  ( A  +  ( B  +  ( C  +  D
) ) )  =  ( A  +  ( C  +  ( B  +  D ) ) ) )
43adantll 476 . 2  |-  ( ( ( A  e.  CC  /\  B  e.  CC )  /\  ( C  e.  CC  /\  D  e.  CC ) )  -> 
( A  +  ( B  +  ( C  +  D ) ) )  =  ( A  +  ( C  +  ( B  +  D
) ) ) )
5 addcl 8004 . . 3  |-  ( ( C  e.  CC  /\  D  e.  CC )  ->  ( C  +  D
)  e.  CC )
6 addass 8009 . . . 4  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  ( C  +  D )  e.  CC )  ->  (
( A  +  B
)  +  ( C  +  D ) )  =  ( A  +  ( B  +  ( C  +  D )
) ) )
763expa 1205 . . 3  |-  ( ( ( A  e.  CC  /\  B  e.  CC )  /\  ( C  +  D )  e.  CC )  ->  ( ( A  +  B )  +  ( C  +  D
) )  =  ( A  +  ( B  +  ( C  +  D ) ) ) )
85, 7sylan2 286 . 2  |-  ( ( ( A  e.  CC  /\  B  e.  CC )  /\  ( C  e.  CC  /\  D  e.  CC ) )  -> 
( ( A  +  B )  +  ( C  +  D ) )  =  ( A  +  ( B  +  ( C  +  D
) ) ) )
9 addcl 8004 . . . 4  |-  ( ( B  e.  CC  /\  D  e.  CC )  ->  ( B  +  D
)  e.  CC )
10 addass 8009 . . . . 5  |-  ( ( A  e.  CC  /\  C  e.  CC  /\  ( B  +  D )  e.  CC )  ->  (
( A  +  C
)  +  ( B  +  D ) )  =  ( A  +  ( C  +  ( B  +  D )
) ) )
11103expa 1205 . . . 4  |-  ( ( ( A  e.  CC  /\  C  e.  CC )  /\  ( B  +  D )  e.  CC )  ->  ( ( A  +  C )  +  ( B  +  D
) )  =  ( A  +  ( C  +  ( B  +  D ) ) ) )
129, 11sylan2 286 . . 3  |-  ( ( ( A  e.  CC  /\  C  e.  CC )  /\  ( B  e.  CC  /\  D  e.  CC ) )  -> 
( ( A  +  C )  +  ( B  +  D ) )  =  ( A  +  ( C  +  ( B  +  D
) ) ) )
1312an4s 588 . 2  |-  ( ( ( A  e.  CC  /\  B  e.  CC )  /\  ( C  e.  CC  /\  D  e.  CC ) )  -> 
( ( A  +  C )  +  ( B  +  D ) )  =  ( A  +  ( C  +  ( B  +  D
) ) ) )
144, 8, 133eqtr4d 2239 1  |-  ( ( ( A  e.  CC  /\  B  e.  CC )  /\  ( C  e.  CC  /\  D  e.  CC ) )  -> 
( ( A  +  B )  +  ( C  +  D ) )  =  ( ( A  +  C )  +  ( B  +  D ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1364    e. wcel 2167  (class class class)co 5922   CCcc 7877    + caddc 7882
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 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-ext 2178  ax-addcl 7975  ax-addcom 7979  ax-addass 7981
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1475  df-sb 1777  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-rex 2481  df-v 2765  df-un 3161  df-sn 3628  df-pr 3629  df-op 3631  df-uni 3840  df-br 4034  df-iota 5219  df-fv 5266  df-ov 5925
This theorem is referenced by:  add42  8188  add4i  8191  add4d  8195  3dvds2dec  12031  opoe  12060  ptolemy  15060
  Copyright terms: Public domain W3C validator