Theorem add12 8484

Description: Commutative/associative law that swaps the first two terms in a triple sum. (Contributed by NM, 11-May-2004.)

Assertion

Ref	Expression
add12	|- ( ( A e. CC /\ B e. CC /\ C e. CC ) -> ( A + ( B + C ) ) = ( B + ( A + C ) ) )

Proof of Theorem add12

Step	Hyp	Ref	Expression
1		addcom 8463	. . . 4 |- ( ( A e. CC /\ B e. CC ) -> ( A + B ) = ( B + A ) )
2	1	oveq1d 6100	. . 3 |- ( ( A e. CC /\ B e. CC ) -> ( ( A + B ) + C ) = ( ( B + A ) + C ) )
3	2	3adant3 1048	. 2 |- ( ( A e. CC /\ B e. CC /\ C e. CC ) -> ( ( A + B ) + C ) = ( ( B + A ) + C ) )
4		addass 8309	. 2 |- ( ( A e. CC /\ B e. CC /\ C e. CC ) -> ( ( A + B ) + C ) = ( A + ( B + C ) ) )
5		addass 8309	. . 3 |- ( ( B e. CC /\ A e. CC /\ C e. CC ) -> ( ( B + A ) + C ) = ( B + ( A + C ) ) )
6	5	3com12 1238	. 2 |- ( ( A e. CC /\ B e. CC /\ C e. CC ) -> ( ( B + A ) + C ) = ( B + ( A + C ) ) )
7	3, 4, 6	3eqtr3d 2279	1 |- ( ( A e. CC /\ B e. CC /\ C e. CC ) -> ( A + ( B + C ) ) = ( B + ( A + C ) ) )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   /\ w3a 1009   = wceq 1402   e. wcel 2209  (class class class)co 6085   CCcc 8177   + caddc 8182

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-ext 2220  ax-addcom 8279  ax-addass 8281

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-rex 2534  df-v 2823  df-un 3224  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4131  df-iota 5337  df-fv 5385  df-ov 6088

This theorem is used by:  add4  8487  add12i  8489  add12d  8493