New Foundations Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  NFE Home  >  Th. List  >  dfin3 Unicode version

Theorem dfin3 3494
 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

Proof of Theorem dfin3
StepHypRef Expression
1 ddif 3398 . 2
2 dfun2 3490 . . . 4
3 ddif 3398 . . . . . 6
43difeq1i 3381 . . . . 5
54difeq2i 3382 . . . 4
62, 5eqtri 2373 . . 3
76difeq2i 3382 . 2
8 dfin2 3491 . 2
91, 7, 83eqtr4ri 2384 1
 Colors of variables: wff setvar class Syntax hints:   wceq 1642  cvv 2859   cdif 3206   cun 3207   cin 3208 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1546  ax-5 1557  ax-17 1616  ax-9 1654  ax-8 1675  ax-6 1729  ax-7 1734  ax-11 1746  ax-12 1925  ax-ext 2334 This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-nan 1288  df-tru 1319  df-ex 1542  df-nf 1545  df-sb 1649  df-clab 2340  df-cleq 2346  df-clel 2349  df-nfc 2478  df-v 2861  df-nin 3211  df-compl 3212  df-in 3213  df-un 3214  df-dif 3215 This theorem is referenced by:  difindi  3509
 Copyright terms: Public domain W3C validator