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

Theorem difundi 3987
Description: Distributive law for class difference. Theorem 39 of [Suppes] p. 29. (Contributed by NM, 17-Aug-2004.)
Assertion
Ref Expression
difundi (𝐴 ∖ (𝐵𝐶)) = ((𝐴𝐵) ∩ (𝐴𝐶))

Proof of Theorem difundi
StepHypRef Expression
1 dfun3 3973 . . 3 (𝐵𝐶) = (V ∖ ((V ∖ 𝐵) ∩ (V ∖ 𝐶)))
21difeq2i 3833 . 2 (𝐴 ∖ (𝐵𝐶)) = (𝐴 ∖ (V ∖ ((V ∖ 𝐵) ∩ (V ∖ 𝐶))))
3 inindi 3938 . . 3 (𝐴 ∩ ((V ∖ 𝐵) ∩ (V ∖ 𝐶))) = ((𝐴 ∩ (V ∖ 𝐵)) ∩ (𝐴 ∩ (V ∖ 𝐶)))
4 dfin2 3968 . . 3 (𝐴 ∩ ((V ∖ 𝐵) ∩ (V ∖ 𝐶))) = (𝐴 ∖ (V ∖ ((V ∖ 𝐵) ∩ (V ∖ 𝐶))))
5 invdif 3976 . . . 4 (𝐴 ∩ (V ∖ 𝐵)) = (𝐴𝐵)
6 invdif 3976 . . . 4 (𝐴 ∩ (V ∖ 𝐶)) = (𝐴𝐶)
75, 6ineq12i 3920 . . 3 ((𝐴 ∩ (V ∖ 𝐵)) ∩ (𝐴 ∩ (V ∖ 𝐶))) = ((𝐴𝐵) ∩ (𝐴𝐶))
83, 4, 73eqtr3i 2754 . 2 (𝐴 ∖ (V ∖ ((V ∖ 𝐵) ∩ (V ∖ 𝐶)))) = ((𝐴𝐵) ∩ (𝐴𝐶))
92, 8eqtri 2746 1 (𝐴 ∖ (𝐵𝐶)) = ((𝐴𝐵) ∩ (𝐴𝐶))
Colors of variables: wff setvar class
Syntax hints:   = wceq 1596  Vcvv 3304  cdif 3677  cun 3678  cin 3679
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1835  ax-4 1850  ax-5 1952  ax-6 2018  ax-7 2054  ax-9 2112  ax-10 2132  ax-11 2147  ax-12 2160  ax-13 2355  ax-ext 2704
This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-tru 1599  df-ex 1818  df-nf 1823  df-sb 2011  df-clab 2711  df-cleq 2717  df-clel 2720  df-nfc 2855  df-ral 3019  df-rab 3023  df-v 3306  df-dif 3683  df-un 3685  df-in 3687
This theorem is referenced by:  undm  3993  uncld  20968  inmbl  23431  difuncomp  29597  clsun  32550  poimirlem8  33649  ntrclskb  38786  ntrclsk3  38787  ntrclsk13  38788
  Copyright terms: Public domain W3C validator