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

Theorem dfin3 4230
Description: Intersection defined in terms of union (De Morgan's law). Similar to Exercise 4.10(n) of [Mendelson] p. 231. (Contributed by NM, 8-Jan-2002.)
Assertion
Ref Expression
dfin3 (𝐴𝐵) = (V ∖ ((V ∖ 𝐴) ∪ (V ∖ 𝐵)))

Proof of Theorem dfin3
StepHypRef Expression
1 ddif 4095 . 2 (V ∖ (V ∖ (𝐴 ∖ (V ∖ 𝐵)))) = (𝐴 ∖ (V ∖ 𝐵))
2 dfun2 4223 . . . 4 ((V ∖ 𝐴) ∪ (V ∖ 𝐵)) = (V ∖ ((V ∖ (V ∖ 𝐴)) ∖ (V ∖ 𝐵)))
3 ddif 4095 . . . . . 6 (V ∖ (V ∖ 𝐴)) = 𝐴
43difeq1i 4077 . . . . 5 ((V ∖ (V ∖ 𝐴)) ∖ (V ∖ 𝐵)) = (𝐴 ∖ (V ∖ 𝐵))
54difeq2i 4078 . . . 4 (V ∖ ((V ∖ (V ∖ 𝐴)) ∖ (V ∖ 𝐵))) = (V ∖ (𝐴 ∖ (V ∖ 𝐵)))
62, 5eqtri 2788 . . 3 ((V ∖ 𝐴) ∪ (V ∖ 𝐵)) = (V ∖ (𝐴 ∖ (V ∖ 𝐵)))
76difeq2i 4078 . 2 (V ∖ ((V ∖ 𝐴) ∪ (V ∖ 𝐵))) = (V ∖ (V ∖ (𝐴 ∖ (V ∖ 𝐵))))
8 dfin2 4224 . 2 (𝐴𝐵) = (𝐴 ∖ (V ∖ 𝐵))
91, 7, 83eqtr4ri 2799 1 (𝐴𝐵) = (V ∖ ((V ∖ 𝐴) ∪ (V ∖ 𝐵)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   = wceq 1570  Vcvv 3457  cdif 3903  cun 3904  cin 3905
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 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-ext 2737
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2744  df-cleq 2757  df-clel 2840  df-rab 3419  df-v 3459  df-dif 3909  df-un 3911  df-in 3913
This theorem is used by:  difindi  4245
  Copyright terms: Public domain W3C validator