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

Theorem undm 3467
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 3461 1  |-  ( _V 
\  ( A  u.  B ) )  =  ( ( _V  \  A )  i^i  ( _V  \  B ) )
Colors of variables: wff set class
Syntax hints:    = wceq 1398   _Vcvv 2803    \ cdif 3198    u. cun 3199    i^i cin 3200
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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-ext 2213
This theorem depends on definitions:  df-bi 117  df-tru 1401  df-nf 1510  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-v 2805  df-dif 3203  df-un 3205  df-in 3207
This theorem is referenced by:  difun1  3469
  Copyright terms: Public domain W3C validator