Theorem add32d 7930

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

Syntax hints:   -> wi 4   = wceq 1331   e. wcel 1480  (class class class)co 5774   CCcc 7618   + caddc 7623

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 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2121  ax-addcom 7720  ax-addass 7722

This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-nf 1437  df-sb 1736  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-rex 2422  df-v 2688  df-un 3075  df-sn 3533  df-pr 3534  df-op 3536  df-uni 3737  df-br 3930  df-iota 5088  df-fv 5131  df-ov 5777

This theorem is referenced by:  nppcan  7984  muladd  8146  peano5uzti  9159  flqaddz  10070  seq3shft2  10246  zesq  10410  abstri  10876  bdtrilem  11010