Metamath Proof Explorer


Theorem un23

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

Ref Expression
Assertion un23 ⊢ A ∪ B ∪ C = A ∪ C ∪ B

Proof

Step Hyp Ref Expression
1 unass ⊢ A ∪ B ∪ C = A ∪ B ∪ C
2 un12 ⊢ A ∪ B ∪ C = B ∪ A ∪ C
3 uncom ⊢ B ∪ A ∪ C = A ∪ C ∪ B
4 1 2 3 3eqtri ⊢ A ∪ B ∪ C = A ∪ C ∪ B