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

Theorem difindi 4237
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 4222 . . 3 (𝐵 ∩ 𝐶) = (V ∖ ((V ∖ 𝐵) ∪ (V ∖ 𝐶)))
21difeq2i 4060 . 2 (𝐴 ∖ (𝐵 ∩ 𝐶)) = (𝐴 ∖ (V ∖ ((V ∖ 𝐵) ∪ (V ∖ 𝐶))))
3 indi 4229 . . 3 (𝐴 ∩ ((V ∖ 𝐵) ∪ (V ∖ 𝐶))) = ((𝐴 ∩ (V ∖ 𝐵)) ∪ (𝐴 ∩ (V ∖ 𝐶)))
4 dfin2 4216 . . 3 (𝐴 ∩ ((V ∖ 𝐵) ∪ (V ∖ 𝐶))) = (𝐴 ∖ (V ∖ ((V ∖ 𝐵) ∪ (V ∖ 𝐶))))
5 invdif 4224 . . . 4 (𝐴 ∩ (V ∖ 𝐵)) = (𝐴 ∖ 𝐵)
6 invdif 4224 . . . 4 (𝐴 ∩ (V ∖ 𝐶)) = (𝐴 ∖ 𝐶)
75, 6uneq12i 4165 . . 3 ((𝐴 ∩ (V ∖ 𝐵)) ∪ (𝐴 ∩ (V ∖ 𝐶))) = ((𝐴 ∖ 𝐵) ∪ (𝐴 ∖ 𝐶))
83, 4, 73eqtr3i 2791 . 2 (𝐴 ∖ (V ∖ ((V ∖ 𝐵) ∪ (V ∖ 𝐶)))) = ((𝐴 ∖ 𝐵) ∪ (𝐴 ∖ 𝐶))
92, 8eqtri 2783 1 (𝐴 ∖ (𝐵 ∩ 𝐶)) = ((𝐴 ∖ 𝐵) ∪ (𝐴 ∖ 𝐶))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   = wceq 1569  Vcvv 3450   ∖ cdif 4045   ∩ cin 4089   ∪ cun 4149
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1572  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-rab 3413  df-v 3452  df-dif 4047  df-in 4091  df-un 4151
This theorem is used by:  difdif2  4241  indm  4243  fndifnfp  7181  dprddisj2  20255  fctop  23322  cctop  23324  mretopd  23410  restcld  23490  cfinfil  24212  csdfil  24213  indifundif  33120  difres  33194  unelcarsg  34944  clsk3nimkb  45040  ntrclskb  45069  ntrclsk3  45070  ntrclsk13  45071  salincl  47334  iscnrm3rlem1  50048
  Copyright terms: Public domain W3C validator