ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  undm Unicode version

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

Proof of Theorem undm
StepHypRef Expression
1 difundi 3374 1  |-  ( _V 
\  ( A  u.  B ) )  =  ( ( _V  \  A )  i^i  ( _V  \  B ) )
Colors of variables: wff set class
Syntax hints:    = wceq 1343   _Vcvv 2726    \ cdif 3113    u. cun 3114    i^i cin 3115
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 604  ax-in2 605  ax-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-ext 2147
This theorem depends on definitions:  df-bi 116  df-tru 1346  df-nf 1449  df-sb 1751  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-v 2728  df-dif 3118  df-un 3120  df-in 3122
This theorem is referenced by:  difun1  3382
  Copyright terms: Public domain W3C validator