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

Theorem indifdir 4256
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 4255 . 2 (𝐶 ∩ (𝐴𝐵)) = ((𝐶𝐴) ∖ (𝐶𝐵))
2 incom 4170 . 2 ((𝐴𝐵) ∩ 𝐶) = (𝐶 ∩ (𝐴𝐵))
3 incom 4170 . . 3 (𝐴𝐶) = (𝐶𝐴)
4 incom 4170 . . 3 (𝐵𝐶) = (𝐶𝐵)
53, 4difeq12i 4087 . 2 ((𝐴𝐶) ∖ (𝐵𝐶)) = ((𝐶𝐴) ∖ (𝐶𝐵))
61, 2, 53eqtr4i 2802 1 ((𝐴𝐵) ∩ 𝐶) = ((𝐴𝐶) ∖ (𝐵𝐶))
Colors of variables: wff setvar class
Syntax hints:   = wceq 1567  cdif 3910  cin 3912
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-ext 2741
This theorem depends on definitions:  df-bi 210  df-an 401  df-tru 1570  df-ex 1807  df-sb 2098  df-clab 2748  df-cleq 2761  df-clel 2844  df-rab 3424  df-v 3465  df-dif 3916  df-in 3920
This theorem is referenced by:  resdifdir  6239  preddif  6331  fresaun  6750  uniioombllem4  25714  subsalsal  46965
  Copyright terms: Public domain W3C validator