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

Theorem add32i 8385
Description: Commutative/associative law that swaps the last two terms in a triple sum. (Contributed by NM, 21-Jan-1997.)
Hypotheses
Ref Expression
add.1  |-  A  e.  CC
add.2  |-  B  e.  CC
add.3  |-  C  e.  CC
Assertion
Ref Expression
add32i  |-  ( ( A  +  B )  +  C )  =  ( ( A  +  C )  +  B
)

Proof of Theorem add32i
StepHypRef Expression
1 add.1 . 2  |-  A  e.  CC
2 add.2 . 2  |-  B  e.  CC
3 add.3 . 2  |-  C  e.  CC
4 add32 8380 . 2  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  ->  (
( A  +  B
)  +  C )  =  ( ( A  +  C )  +  B ) )
51, 2, 3, 4mp3an 1374 1  |-  ( ( A  +  B )  +  C )  =  ( ( A  +  C )  +  B
)
Colors of variables: wff set class
Syntax hints:    = 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-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:  karatsuba  13066  lgsdir2lem2  15831
  Copyright terms: Public domain W3C validator