MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  undm Structured version   Visualization version   GIF version

Theorem undm 4286
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 ∖ (𝐴𝐵)) = ((V ∖ 𝐴) ∩ (V ∖ 𝐵))

Proof of Theorem undm
StepHypRef Expression
1 difundi 4278 1 (V ∖ (𝐴𝐵)) = ((V ∖ 𝐴) ∩ (V ∖ 𝐵))
Colors of variables: wff setvar class
Syntax hints:   = wceq 1542  Vcvv 3475  cdif 3944  cun 3945  cin 3946
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-ext 2704
This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-tru 1545  df-ex 1783  df-sb 2069  df-clab 2711  df-cleq 2725  df-clel 2811  df-rab 3434  df-v 3477  df-dif 3950  df-un 3952  df-in 3954
This theorem is referenced by:  difun1  4288
  Copyright terms: Public domain W3C validator