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

Theorem dfin3 3548
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  |-  ( A  i^i  B )  =  ( _V  \  (
( _V  \  A
)  u.  ( _V 
\  B ) ) )

Proof of Theorem dfin3
StepHypRef Expression
1 ddif 3447 . 2  |-  ( _V 
\  ( _V  \ 
( A  \  ( _V  \  B ) ) ) )  =  ( A  \  ( _V 
\  B ) )
2 dfun2 3544 . . . 4  |-  ( ( _V  \  A )  u.  ( _V  \  B ) )  =  ( _V  \  (
( _V  \  ( _V  \  A ) ) 
\  ( _V  \  B ) ) )
3 ddif 3447 . . . . . 6  |-  ( _V 
\  ( _V  \  A ) )  =  A
43difeq1i 3429 . . . . 5  |-  ( ( _V  \  ( _V 
\  A ) ) 
\  ( _V  \  B ) )  =  ( A  \  ( _V  \  B ) )
54difeq2i 3430 . . . 4  |-  ( _V 
\  ( ( _V 
\  ( _V  \  A ) )  \ 
( _V  \  B
) ) )  =  ( _V  \  ( A  \  ( _V  \  B ) ) )
62, 5eqtri 2432 . . 3  |-  ( ( _V  \  A )  u.  ( _V  \  B ) )  =  ( _V  \  ( A  \  ( _V  \  B ) ) )
76difeq2i 3430 . 2  |-  ( _V 
\  ( ( _V 
\  A )  u.  ( _V  \  B
) ) )  =  ( _V  \  ( _V  \  ( A  \ 
( _V  \  B
) ) ) )
8 dfin2 3545 . 2  |-  ( A  i^i  B )  =  ( A  \  ( _V  \  B ) )
91, 7, 83eqtr4ri 2443 1  |-  ( A  i^i  B )  =  ( _V  \  (
( _V  \  A
)  u.  ( _V 
\  B ) ) )
Colors of variables: wff set class
Syntax hints:    = wceq 1649   _Vcvv 2924    \ cdif 3285    u. cun 3286    i^i cin 3287
This theorem is referenced by:  difindi  3563
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1552  ax-5 1563  ax-17 1623  ax-9 1662  ax-8 1683  ax-6 1740  ax-7 1745  ax-11 1757  ax-12 1946  ax-ext 2393
This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-tru 1325  df-ex 1548  df-nf 1551  df-sb 1656  df-clab 2399  df-cleq 2405  df-clel 2408  df-nfc 2537  df-ral 2679  df-rab 2683  df-v 2926  df-dif 3291  df-un 3293  df-in 3295
  Copyright terms: Public domain W3C validator