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

Theorem add32d 7571
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 7562 . 2  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  ->  (
( A  +  B
)  +  C )  =  ( ( A  +  C )  +  B ) )
51, 2, 3, 4syl3anc 1172 1  |-  ( ph  ->  ( ( A  +  B )  +  C
)  =  ( ( A  +  C )  +  B ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1287    e. wcel 1436  (class class class)co 5594   CCcc 7269    + caddc 7274
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 663  ax-5 1379  ax-7 1380  ax-gen 1381  ax-ie1 1425  ax-ie2 1426  ax-8 1438  ax-10 1439  ax-11 1440  ax-i12 1441  ax-bndl 1442  ax-4 1443  ax-17 1462  ax-i9 1466  ax-ial 1470  ax-i5r 1471  ax-ext 2067  ax-addcom 7366  ax-addass 7368
This theorem depends on definitions:  df-bi 115  df-3an 924  df-tru 1290  df-nf 1393  df-sb 1690  df-clab 2072  df-cleq 2078  df-clel 2081  df-nfc 2214  df-rex 2361  df-v 2616  df-un 2990  df-sn 3431  df-pr 3432  df-op 3434  df-uni 3631  df-br 3815  df-iota 4937  df-fv 4980  df-ov 5597
This theorem is referenced by:  nppcan  7625  muladd  7783  peano5uzti  8764  flqaddz  9607  zesq  9921  abstri  10378
  Copyright terms: Public domain W3C validator