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

Theorem add4 8382
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 8379 . . . . 5  |-  ( ( B  e.  CC  /\  C  e.  CC  /\  D  e.  CC )  ->  ( B  +  ( C  +  D ) )  =  ( C  +  ( B  +  D ) ) )
213expb 1231 . . . 4  |-  ( ( B  e.  CC  /\  ( C  e.  CC  /\  D  e.  CC ) )  ->  ( B  +  ( C  +  D ) )  =  ( C  +  ( B  +  D ) ) )
32oveq2d 6044 . . 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 8200 . . 3  |-  ( ( C  e.  CC  /\  D  e.  CC )  ->  ( C  +  D
)  e.  CC )
6 addass 8205 . . . 4  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  ( C  +  D )  e.  CC )  ->  (
( A  +  B
)  +  ( C  +  D ) )  =  ( A  +  ( B  +  ( C  +  D )
) ) )
763expa 1230 . . 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 8200 . . . 4  |-  ( ( B  e.  CC  /\  D  e.  CC )  ->  ( B  +  D
)  e.  CC )
10 addass 8205 . . . . 5  |-  ( ( A  e.  CC  /\  C  e.  CC  /\  ( B  +  D )  e.  CC )  ->  (
( A  +  C
)  +  ( B  +  D ) )  =  ( A  +  ( C  +  ( B  +  D )
) ) )
11103expa 1230 . . . 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 592 . 2  |-  ( ( ( A  e.  CC  /\  B  e.  CC )  /\  ( C  e.  CC  /\  D  e.  CC ) )  -> 
( ( A  +  C )  +  ( B  +  D ) )  =  ( A  +  ( C  +  ( B  +  D
) ) ) )
144, 8, 133eqtr4d 2274 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 1398    e. wcel 2202  (class class class)co 6028   CCcc 8073    + caddc 8078
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 2213  ax-addcl 8171  ax-addcom 8175  ax-addass 8177
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-rex 2517  df-v 2805  df-un 3205  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-br 4094  df-iota 5293  df-fv 5341  df-ov 6031
This theorem is referenced by:  add42  8383  add4i  8386  add4d  8390  3dvds2dec  12490  opoe  12519  ptolemy  15618
  Copyright terms: Public domain W3C validator