Theorem add4i 8491

Description: Rearrangement of 4 terms in a sum. (Contributed by NM, 9-May-1999.)

Hypotheses

Ref	Expression
add.1	|- A e. CC
add.2	|- B e. CC
add.3	|- C e. CC
add4.4	|- D e. CC

Assertion

Ref	Expression
add4i	|- ( ( A + B ) + ( C + D ) ) = ( ( A + C ) + ( B + D ) )

Proof of Theorem add4i

Step	Hyp	Ref	Expression
1		add.1	. 2 |- A e. CC
2		add.2	. 2 |- B e. CC
3		add.3	. 2 |- C e. CC
4		add4.4	. 2 |- D e. CC
5		add4 8487	. 2 |- ( ( ( A e. CC /\ B e. CC ) /\ ( C e. CC /\ D e. CC ) ) -> ( ( A + B ) + ( C + D ) ) = ( ( A + C ) + ( B + D ) ) )
6	1, 2, 3, 4, 5	mp4an 431	1 |- ( ( A + B ) + ( C + D ) ) = ( ( A + C ) + ( B + D ) )

This proof depends on syntax axioms:   = 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-addcl 8275  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:  add42i  8492  negdii  8610  numma  9820