Metamath Proof Explorer


Theorem rp-fakeuninass

Description: A special case where a mixture of union and intersection appears to conform to a mixed associative law. (Contributed by RP, 29-Feb-2020)

Ref Expression
Assertion rp-fakeuninass ⊢ A ⊆ C ↔ A ∪ B ∩ C = A ∪ B ∩ C

Proof

Step Hyp Ref Expression
1 rp-fakeinunass ⊢ A ⊆ C ↔ C ∩ B ∪ A = C ∩ B ∪ A
2 eqcom ⊢ C ∩ B ∪ A = C ∩ B ∪ A ↔ C ∩ B ∪ A = C ∩ B ∪ A
3 incom ⊢ C ∩ B ∪ A = B ∪ A ∩ C
4 uncom ⊢ B ∪ A = A ∪ B
5 4 ineq1i ⊢ B ∪ A ∩ C = A ∪ B ∩ C
6 3 5 eqtri ⊢ C ∩ B ∪ A = A ∪ B ∩ C
7 uncom ⊢ C ∩ B ∪ A = A ∪ C ∩ B
8 incom ⊢ C ∩ B = B ∩ C
9 8 uneq2i ⊢ A ∪ C ∩ B = A ∪ B ∩ C
10 7 9 eqtri ⊢ C ∩ B ∪ A = A ∪ B ∩ C
11 6 10 eqeq12i ⊢ C ∩ B ∪ A = C ∩ B ∪ A ↔ A ∪ B ∩ C = A ∪ B ∩ C
12 1 2 11 3bitri ⊢ A ⊆ C ↔ A ∪ B ∩ C = A ∪ B ∩ C