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

Theorem indm 3428
Description: DeMorgan's law for intersection. Theorem 5.2(13') of [Stoll] p. 19. (Contributed by NM, 18-Aug-2004.)
Assertion
Ref Expression
indm  |-  ( _V 
\  ( A  i^i  B ) )  =  ( ( _V  \  A
)  u.  ( _V 
\  B ) )

Proof of Theorem indm
StepHypRef Expression
1 difindi 3424 1  |-  ( _V 
\  ( A  i^i  B ) )  =  ( ( _V  \  A
)  u.  ( _V 
\  B ) )
Colors of variables: wff set class
Syntax hints:    = wceq 1623   _Vcvv 2789    \ cdif 3150    u. cun 3151    i^i cin 3152
This theorem is referenced by:  difdifdir  3542
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1533  ax-5 1544  ax-17 1603  ax-9 1636  ax-8 1644  ax-6 1704  ax-7 1709  ax-11 1716  ax-12 1868  ax-ext 2265
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-tru 1310  df-ex 1529  df-nf 1532  df-sb 1631  df-clab 2271  df-cleq 2277  df-clel 2280  df-nfc 2409  df-ral 2549  df-rab 2553  df-v 2791  df-dif 3156  df-un 3158  df-in 3160
  Copyright terms: Public domain W3C validator