Theorem add32d 8080

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

Step	Hyp	Ref	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 8071	. 2 |- ( ( A e. CC /\ B e. CC /\ C e. CC ) -> ( ( A + B ) + C ) = ( ( A + C ) + B ) )
5	1, 2, 3, 4	syl3anc 1233	1 |- ( ph -> ( ( A + B ) + C ) = ( ( A + C ) + B ) )

Syntax hints:   -> wi 4   = wceq 1348   e. wcel 2141  (class class class)co 5851   CCcc 7765   + caddc 7770

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-ext 2152  ax-addcom 7867  ax-addass 7869

This theorem depends on definitions:  df-bi 116  df-3an 975  df-tru 1351  df-nf 1454  df-sb 1756  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-rex 2454  df-v 2732  df-un 3125  df-sn 3587  df-pr 3588  df-op 3590  df-uni 3795  df-br 3988  df-iota 5158  df-fv 5204  df-ov 5854

This theorem is referenced by:  nppcan  8134  muladd  8296  peano5uzti  9313  flqaddz  10246  seq3shft2  10422  zesq  10587  abstri  11061  bdtrilem  11195  pythagtriplem1  12212  pythagtriplem12  12222