Theorem un23 3286

Description: A rearrangement of union. (Contributed by NM, 12-Aug-2004.) (Proof shortened by Andrew Salmon, 26-Jun-2011.)

Assertion

Ref	Expression
un23	|- ( ( A u. B ) u. C ) = ( ( A u. C ) u. B )

Proof of Theorem un23

Step	Hyp	Ref	Expression
1		unass 3284	. 2 |- ( ( A u. B ) u. C ) = ( A u. ( B u. C ) )
2		un12 3285	. 2 |- ( A u. ( B u. C ) ) = ( B u. ( A u. C ) )
3		uncom 3271	. 2 |- ( B u. ( A u. C ) ) = ( ( A u. C ) u. B )
4	1, 2, 3	3eqtri 2195	1 |- ( ( A u. B ) u. C ) = ( ( A u. C ) u. B )

Syntax hints:   = wceq 1348   u. cun 3119

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

This theorem depends on definitions:  df-bi 116  df-tru 1351  df-nf 1454  df-sb 1756  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-v 2732  df-un 3125

This theorem is referenced by:  setscom  12456