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

Theorem add4 8118
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 8115 . . . . 5  |-  ( ( B  e.  CC  /\  C  e.  CC  /\  D  e.  CC )  ->  ( B  +  ( C  +  D ) )  =  ( C  +  ( B  +  D ) ) )
213expb 1204 . . . 4  |-  ( ( B  e.  CC  /\  ( C  e.  CC  /\  D  e.  CC ) )  ->  ( B  +  ( C  +  D ) )  =  ( C  +  ( B  +  D ) ) )
32oveq2d 5891 . . 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 7936 . . 3  |-  ( ( C  e.  CC  /\  D  e.  CC )  ->  ( C  +  D
)  e.  CC )
6 addass 7941 . . . 4  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  ( C  +  D )  e.  CC )  ->  (
( A  +  B
)  +  ( C  +  D ) )  =  ( A  +  ( B  +  ( C  +  D )
) ) )
763expa 1203 . . 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 7936 . . . 4  |-  ( ( B  e.  CC  /\  D  e.  CC )  ->  ( B  +  D
)  e.  CC )
10 addass 7941 . . . . 5  |-  ( ( A  e.  CC  /\  C  e.  CC  /\  ( B  +  D )  e.  CC )  ->  (
( A  +  C
)  +  ( B  +  D ) )  =  ( A  +  ( C  +  ( B  +  D )
) ) )
11103expa 1203 . . . 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 2220 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 1353    e. wcel 2148  (class class class)co 5875   CCcc 7809    + caddc 7814
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 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-ext 2159  ax-addcl 7907  ax-addcom 7911  ax-addass 7913
This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-nf 1461  df-sb 1763  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-rex 2461  df-v 2740  df-un 3134  df-sn 3599  df-pr 3600  df-op 3602  df-uni 3811  df-br 4005  df-iota 5179  df-fv 5225  df-ov 5878
This theorem is referenced by:  add42  8119  add4i  8122  add4d  8126  3dvds2dec  11871  opoe  11900  ptolemy  14248
  Copyright terms: Public domain W3C validator