Metamath Proof Explorer


Theorem undif1

Description: Absorption of difference by union. This decomposes a union into two disjoint classes (see disjdif ). Theorem 35 of Suppes p. 29. (Contributed by NM, 19-May-1998)

Ref Expression
Assertion undif1 ⊢ A ∖ B ∪ B = A ∪ B

Proof

Step Hyp Ref Expression
1 undir ⊢ A ∩ V ∖ B ∪ B = A ∪ B ∩ V ∖ B ∪ B
2 invdif ⊢ A ∩ V ∖ B = A ∖ B
3 2 uneq1i ⊢ A ∩ V ∖ B ∪ B = A ∖ B ∪ B
4 uncom ⊢ V ∖ B ∪ B = B ∪ V ∖ B
5 unvdif ⊢ B ∪ V ∖ B = V
6 4 5 eqtri ⊢ V ∖ B ∪ B = V
7 6 ineq2i ⊢ A ∪ B ∩ V ∖ B ∪ B = A ∪ B ∩ V
8 inv1 ⊢ A ∪ B ∩ V = A ∪ B
9 7 8 eqtri ⊢ A ∪ B ∩ V ∖ B ∪ B = A ∪ B
10 1 3 9 3eqtr3i ⊢ A ∖ B ∪ B = A ∪ B