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

Theorem add32d 8310
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 8301 . 2  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  ->  (
( A  +  B
)  +  C )  =  ( ( A  +  C )  +  B ) )
51, 2, 3, 4syl3anc 1271 1  |-  ( ph  ->  ( ( A  +  B )  +  C
)  =  ( ( A  +  C )  +  B ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1395    e. wcel 2200  (class class class)co 6000   CCcc 7993    + caddc 7998
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 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-ext 2211  ax-addcom 8095  ax-addass 8097
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-rex 2514  df-v 2801  df-un 3201  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3888  df-br 4083  df-iota 5277  df-fv 5325  df-ov 6003
This theorem is referenced by:  nppcan  8364  muladd  8526  peano5uzti  9551  flqaddz  10512  seq3shft2  10698  zesq  10875  abstri  11610  bdtrilem  11745  pythagtriplem1  12783  pythagtriplem12  12793  gsumfzconst  13873
  Copyright terms: Public domain W3C validator