MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  in31 Structured version   Visualization version   GIF version

Theorem in31 4131
Description: A rearrangement of intersection. (Contributed by NM, 27-Aug-2012.)
Assertion
Ref Expression
in31 ((𝐴 ∩ 𝐵) ∩ 𝐶) = ((𝐶 ∩ 𝐵) ∩ 𝐴)

Proof of Theorem in31
StepHypRef Expression
1 in12 4128 . 2 (𝐶 ∩ (𝐴 ∩ 𝐵)) = (𝐴 ∩ (𝐶 ∩ 𝐵))
2 incom 4109 . 2 ((𝐴 ∩ 𝐵) ∩ 𝐶) = (𝐶 ∩ (𝐴 ∩ 𝐵))
3 incom 4109 . 2 ((𝐶 ∩ 𝐵) ∩ 𝐴) = (𝐴 ∩ (𝐶 ∩ 𝐵))
41, 2, 33eqtr4i 2796 1 ((𝐴 ∩ 𝐵) ∩ 𝐶) = ((𝐶 ∩ 𝐵) ∩ 𝐴)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   = wceq 1570   ∩ cin 4092
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735
This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-rab 3417  df-v 3456  df-in 4094
This theorem is used by:  inrot  4132
  Copyright terms: Public domain W3C validator