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

Theorem indifdir 4243
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 4242 . 2 (𝐶 ∩ (𝐴 ∖ 𝐵)) = ((𝐶 ∩ 𝐴) ∖ (𝐶 ∩ 𝐵))
2 incom 4109 . 2 ((𝐴 ∖ 𝐵) ∩ 𝐶) = (𝐶 ∩ (𝐴 ∖ 𝐵))
3 incom 4109 . . 3 (𝐴 ∩ 𝐶) = (𝐶 ∩ 𝐴)
4 incom 4109 . . 3 (𝐵 ∩ 𝐶) = (𝐶 ∩ 𝐵)
53, 4difeq12i 4064 . 2 ((𝐴 ∩ 𝐶) ∖ (𝐵 ∩ 𝐶)) = ((𝐶 ∩ 𝐴) ∖ (𝐶 ∩ 𝐵))
61, 2, 53eqtr4i 2796 1 ((𝐴 ∖ 𝐵) ∩ 𝐶) = ((𝐴 ∩ 𝐶) ∖ (𝐵 ∩ 𝐶))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   = wceq 1570   ∖ cdif 4048   ∩ 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-dif 4050  df-in 4094
This theorem is used by:  resdifdir  6257  preddif  6358  fresaun  6783  uniioombllem4  25962  subsalsal  47642
  Copyright terms: Public domain W3C validator