Metamath Proof Explorer


Theorem un4

Description: A rearrangement of the union of 4 classes. (Contributed by NM, 12-Aug-2004)

Ref Expression
Assertion un4 ⊢ A ∪ B ∪ C ∪ D = A ∪ C ∪ B ∪ D

Proof

Step Hyp Ref Expression
1 un12 ⊢ B ∪ C ∪ D = C ∪ B ∪ D
2 1 uneq2i ⊢ A ∪ B ∪ C ∪ D = A ∪ C ∪ B ∪ D
3 unass ⊢ A ∪ B ∪ C ∪ D = A ∪ B ∪ C ∪ D
4 unass ⊢ A ∪ C ∪ B ∪ D = A ∪ C ∪ B ∪ D
5 2 3 4 3eqtr4i ⊢ A ∪ B ∪ C ∪ D = A ∪ C ∪ B ∪ D