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

Theorem difun1 4244
Description: A relationship involving double difference and union. (Contributed by NM, 29-Aug-2004.)
Assertion
Ref Expression
difun1 (𝐴 ∖ (𝐵 ∪ 𝐶)) = ((𝐴 ∖ 𝐵) ∖ 𝐶)

Proof of Theorem difun1
StepHypRef Expression
1 inass 4124 . . . 4 ((𝐴 ∩ (V ∖ 𝐵)) ∩ (V ∖ 𝐶)) = (𝐴 ∩ ((V ∖ 𝐵) ∩ (V ∖ 𝐶)))
2 invdif 4224 . . . 4 ((𝐴 ∩ (V ∖ 𝐵)) ∩ (V ∖ 𝐶)) = ((𝐴 ∩ (V ∖ 𝐵)) ∖ 𝐶)
31, 2eqtr3i 2785 . . 3 (𝐴 ∩ ((V ∖ 𝐵) ∩ (V ∖ 𝐶))) = ((𝐴 ∩ (V ∖ 𝐵)) ∖ 𝐶)
4 undm 4242 . . . . 5 (V ∖ (𝐵 ∪ 𝐶)) = ((V ∖ 𝐵) ∩ (V ∖ 𝐶))
54ineq2i 4114 . . . 4 (𝐴 ∩ (V ∖ (𝐵 ∪ 𝐶))) = (𝐴 ∩ ((V ∖ 𝐵) ∩ (V ∖ 𝐶)))
6 invdif 4224 . . . 4 (𝐴 ∩ (V ∖ (𝐵 ∪ 𝐶))) = (𝐴 ∖ (𝐵 ∪ 𝐶))
75, 6eqtr3i 2785 . . 3 (𝐴 ∩ ((V ∖ 𝐵) ∩ (V ∖ 𝐶))) = (𝐴 ∖ (𝐵 ∪ 𝐶))
83, 7eqtr3i 2785 . 2 ((𝐴 ∩ (V ∖ 𝐵)) ∖ 𝐶) = (𝐴 ∖ (𝐵 ∪ 𝐶))
9 invdif 4224 . . 3 (𝐴 ∩ (V ∖ 𝐵)) = (𝐴 ∖ 𝐵)
109difeq1i 4059 . 2 ((𝐴 ∩ (V ∖ 𝐵)) ∖ 𝐶) = ((𝐴 ∖ 𝐵) ∖ 𝐶)
118, 10eqtr3i 2785 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:  dif32  4247  difabs  4248  difpr  4765  infdiffi  9659  mreexexlem4d  17821  nulmbl2  25857  unmbl  25858  difelsiga  34809  caragenuncllem  47565
  Copyright terms: Public domain W3C validator