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

Theorem indifdir 4235
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 4234 . 2 (𝐶 ∩ (𝐴𝐵)) = ((𝐶𝐴) ∖ (𝐶𝐵))
2 incom 4149 . 2 ((𝐴𝐵) ∩ 𝐶) = (𝐶 ∩ (𝐴𝐵))
3 incom 4149 . . 3 (𝐴𝐶) = (𝐶𝐴)
4 incom 4149 . . 3 (𝐵𝐶) = (𝐶𝐵)
53, 4difeq12i 4064 . 2 ((𝐴𝐶) ∖ (𝐵𝐶)) = ((𝐶𝐴) ∖ (𝐶𝐵))
61, 2, 53eqtr4i 2769 1 ((𝐴𝐵) ∩ 𝐶) = ((𝐴𝐶) ∖ (𝐵𝐶))
Colors of variables: wff setvar class
Syntax hints:   = wceq 1542  cdif 3886  cin 3888
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-ext 2708
This theorem depends on definitions:  df-bi 207  df-an 396  df-tru 1545  df-ex 1782  df-sb 2069  df-clab 2715  df-cleq 2728  df-clel 2811  df-rab 3390  df-v 3431  df-dif 3892  df-in 3896
This theorem is referenced by:  resdifdir  6201  preddif  6293  fresaun  6711  uniioombllem4  25553  subsalsal  46787
  Copyright terms: Public domain W3C validator