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

Theorem add32d 8346
Description: Commutative/associative law that swaps the last two terms in a triple sum. (Contributed by Mario Carneiro, 27-May-2016.)
Hypotheses
Ref Expression
addd.1  |-  ( ph  ->  A  e.  CC )
addd.2  |-  ( ph  ->  B  e.  CC )
addd.3  |-  ( ph  ->  C  e.  CC )
Assertion
Ref Expression
add32d  |-  ( ph  ->  ( ( A  +  B )  +  C
)  =  ( ( A  +  C )  +  B ) )

Proof of Theorem add32d
StepHypRef Expression
1 addd.1 . 2  |-  ( ph  ->  A  e.  CC )
2 addd.2 . 2  |-  ( ph  ->  B  e.  CC )
3 addd.3 . 2  |-  ( ph  ->  C  e.  CC )
4 add32 8337 . 2  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  ->  (
( A  +  B
)  +  C )  =  ( ( A  +  C )  +  B ) )
51, 2, 3, 4syl3anc 1273 1  |-  ( ph  ->  ( ( A  +  B )  +  C
)  =  ( ( A  +  C )  +  B ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1397    e. wcel 2202  (class class class)co 6017   CCcc 8029    + caddc 8034
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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-ext 2213  ax-addcom 8131  ax-addass 8133
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-rex 2516  df-v 2804  df-un 3204  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-br 4089  df-iota 5286  df-fv 5334  df-ov 6020
This theorem is referenced by:  nppcan  8400  muladd  8562  peano5uzti  9587  flqaddz  10556  seq3shft2  10742  zesq  10919  abstri  11664  bdtrilem  11799  pythagtriplem1  12837  pythagtriplem12  12847  gsumfzconst  13927
  Copyright terms: Public domain W3C validator