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

Theorem undm 3462
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 3456 1  |-  ( _V 
\  ( A  u.  B ) )  =  ( ( _V  \  A )  i^i  ( _V  \  B ) )
Colors of variables: wff set class
Syntax hints:    = wceq 1395   _Vcvv 2799    \ cdif 3194    u. cun 3195    i^i cin 3196
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-ext 2211
This theorem depends on definitions:  df-bi 117  df-tru 1398  df-nf 1507  df-sb 1809  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-v 2801  df-dif 3199  df-un 3201  df-in 3203
This theorem is referenced by:  difun1  3464
  Copyright terms: Public domain W3C validator