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

Theorem add4i 8438
Description: Rearrangement of 4 terms in a sum. (Contributed by NM, 9-May-1999.)
Hypotheses
Ref Expression
add.1  |-  A  e.  CC
add.2  |-  B  e.  CC
add.3  |-  C  e.  CC
add4.4  |-  D  e.  CC
Assertion
Ref Expression
add4i  |-  ( ( A  +  B )  +  ( C  +  D ) )  =  ( ( A  +  C )  +  ( B  +  D ) )

Proof of Theorem add4i
StepHypRef Expression
1 add.1 . 2  |-  A  e.  CC
2 add.2 . 2  |-  B  e.  CC
3 add.3 . 2  |-  C  e.  CC
4 add4.4 . 2  |-  D  e.  CC
5 add4 8434 . 2  |-  ( ( ( A  e.  CC  /\  B  e.  CC )  /\  ( C  e.  CC  /\  D  e.  CC ) )  -> 
( ( A  +  B )  +  ( C  +  D ) )  =  ( ( A  +  C )  +  ( B  +  D ) ) )
61, 2, 3, 4, 5mp4an 427 1  |-  ( ( A  +  B )  +  ( C  +  D ) )  =  ( ( A  +  C )  +  ( B  +  D ) )
Colors of variables: wff set class
Syntax hints:    = wceq 1398    e. wcel 2203  (class class class)co 6050   CCcc 8125    + caddc 8130
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-addcl 8223  ax-addcom 8227  ax-addass 8229
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:  add42i  8439  negdii  8557  numma  9752
  Copyright terms: Public domain W3C validator