Metamath Proof Explorer


Theorem in32

Description: A rearrangement of intersection. (Contributed by NM, 21-Apr-2001) (Proof shortened by Andrew Salmon, 26-Jun-2011)

Ref Expression
Assertion in32 ⊢ A ∩ B ∩ C = A ∩ C ∩ B

Proof

Step Hyp Ref Expression
1 inass ⊢ A ∩ B ∩ C = A ∩ B ∩ C
2 in12 ⊢ A ∩ B ∩ C = B ∩ A ∩ C
3 incom ⊢ B ∩ A ∩ C = A ∩ C ∩ B
4 1 2 3 3eqtri ⊢ A ∩ B ∩ C = A ∩ C ∩ B