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

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

Proof of Theorem difindi
StepHypRef Expression
1 dfin3 4225 . . 3 (𝐵 ∩ 𝐶) = (V ∖ ((V ∖ 𝐵) ∪ (V ∖ 𝐶)))
21difeq2i 4063 . 2 (𝐴 ∖ (𝐵 ∩ 𝐶)) = (𝐴 ∖ (V ∖ ((V ∖ 𝐵) ∪ (V ∖ 𝐶))))
3 indi 4232 . . 3 (𝐴 ∩ ((V ∖ 𝐵) ∪ (V ∖ 𝐶))) = ((𝐴 ∩ (V ∖ 𝐵)) ∪ (𝐴 ∩ (V ∖ 𝐶)))
4 dfin2 4219 . . 3 (𝐴 ∩ ((V ∖ 𝐵) ∪ (V ∖ 𝐶))) = (𝐴 ∖ (V ∖ ((V ∖ 𝐵) ∪ (V ∖ 𝐶))))
5 invdif 4227 . . . 4 (𝐴 ∩ (V ∖ 𝐵)) = (𝐴 ∖ 𝐵)
6 invdif 4227 . . . 4 (𝐴 ∩ (V ∖ 𝐶)) = (𝐴 ∖ 𝐶)
75, 6uneq12i 4168 . . 3 ((𝐴 ∩ (V ∖ 𝐵)) ∪ (𝐴 ∩ (V ∖ 𝐶))) = ((𝐴 ∖ 𝐵) ∪ (𝐴 ∖ 𝐶))
83, 4, 73eqtr3i 2794 . 2 (𝐴 ∖ (V ∖ ((V ∖ 𝐵) ∪ (V ∖ 𝐶)))) = ((𝐴 ∖ 𝐵) ∪ (𝐴 ∖ 𝐶))
92, 8eqtri 2786 1 (𝐴 ∖ (𝐵 ∩ 𝐶)) = ((𝐴 ∖ 𝐵) ∪ (𝐴 ∖ 𝐶))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   = wceq 1570  Vcvv 3454   ∖ cdif 4048   ∩ cin 4092   ∪ cun 4152
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-or 862  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  df-un 4154
This theorem is used by:  difdif2  4244  indm  4246  fndifnfp  7201  dprddisj2  20282  fctop  23349  cctop  23351  mretopd  23437  restcld  23517  cfinfil  24239  csdfil  24240  indifundif  33189  difres  33263  unelcarsg  35011  clsk3nimkb  45230  ntrclskb  45259  ntrclsk3  45260  ntrclsk13  45261  salincl  47537  iscnrm3rlem1  50257
  Copyright terms: Public domain W3C validator