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

Theorem difundi 4206
 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 4192 . . 3 (𝐵𝐶) = (V ∖ ((V ∖ 𝐵) ∩ (V ∖ 𝐶)))
21difeq2i 4047 . 2 (𝐴 ∖ (𝐵𝐶)) = (𝐴 ∖ (V ∖ ((V ∖ 𝐵) ∩ (V ∖ 𝐶))))
3 inindi 4153 . . 3 (𝐴 ∩ ((V ∖ 𝐵) ∩ (V ∖ 𝐶))) = ((𝐴 ∩ (V ∖ 𝐵)) ∩ (𝐴 ∩ (V ∖ 𝐶)))
4 dfin2 4187 . . 3 (𝐴 ∩ ((V ∖ 𝐵) ∩ (V ∖ 𝐶))) = (𝐴 ∖ (V ∖ ((V ∖ 𝐵) ∩ (V ∖ 𝐶))))
5 invdif 4195 . . . 4 (𝐴 ∩ (V ∖ 𝐵)) = (𝐴𝐵)
6 invdif 4195 . . . 4 (𝐴 ∩ (V ∖ 𝐶)) = (𝐴𝐶)
75, 6ineq12i 4137 . . 3 ((𝐴 ∩ (V ∖ 𝐵)) ∩ (𝐴 ∩ (V ∖ 𝐶))) = ((𝐴𝐵) ∩ (𝐴𝐶))
83, 4, 73eqtr3i 2829 . 2 (𝐴 ∖ (V ∖ ((V ∖ 𝐵) ∩ (V ∖ 𝐶)))) = ((𝐴𝐵) ∩ (𝐴𝐶))
92, 8eqtri 2821 1 (𝐴 ∖ (𝐵𝐶)) = ((𝐴𝐵) ∩ (𝐴𝐶))
 Colors of variables: wff setvar class Syntax hints:   = wceq 1538  Vcvv 3441   ∖ cdif 3878   ∪ cun 3879   ∩ cin 3880 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 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-ext 2770 This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-tru 1541  df-ex 1782  df-sb 2070  df-clab 2777  df-cleq 2791  df-clel 2870  df-rab 3115  df-v 3443  df-dif 3884  df-un 3886  df-in 3888 This theorem is referenced by:  undm  4212  uncld  21646  inmbl  24146  difuncomp  30317  clsun  33789  poimirlem8  35065  ntrclskb  40770  ntrclsk3  40771  ntrclsk13  40772
 Copyright terms: Public domain W3C validator