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

Theorem indifdir 4241
Description: Distribute intersection over difference. (Contributed by Scott Fenton, 14-Apr-2011.) (Revised by BTernaryTau, 14-Aug-2024.)
Assertion
Ref Expression
indifdir ((𝐴 ∖ 𝐵) ∩ 𝐶) = ((𝐴 ∩ 𝐶) ∖ (𝐵 ∩ 𝐶))

Proof of Theorem indifdir
StepHypRef Expression
1 indifdi 4240 . 2 (𝐶 ∩ (𝐴 ∖ 𝐵)) = ((𝐶 ∩ 𝐴) ∖ (𝐶 ∩ 𝐵))
2 incom 4155 . 2 ((𝐴 ∖ 𝐵) ∩ 𝐶) = (𝐶 ∩ (𝐴 ∖ 𝐵))
3 incom 4155 . . 3 (𝐴 ∩ 𝐶) = (𝐶 ∩ 𝐴)
4 incom 4155 . . 3 (𝐵 ∩ 𝐶) = (𝐶 ∩ 𝐵)
53, 4difeq12i 4072 . 2 ((𝐴 ∩ 𝐶) ∖ (𝐵 ∩ 𝐶)) = ((𝐶 ∩ 𝐴) ∖ (𝐶 ∩ 𝐵))
61, 2, 53eqtr4i 2794 1 ((𝐴 ∖ 𝐵) ∩ 𝐶) = ((𝐴 ∩ 𝐶) ∖ (𝐵 ∩ 𝐶))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   = wceq 1570   ∖ cdif 3896   ∩ cin 3898
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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2733
This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-rab 3414  df-v 3453  df-dif 3902  df-in 3906
This theorem is used by:  resdifdir  6238  preddif  6332  fresaun  6753  uniioombllem4  25907  subsalsal  47368
  Copyright terms: Public domain W3C validator