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

Theorem undm 4250
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 4243 1 (V ∖ (𝐴𝐵)) = ((V ∖ 𝐴) ∩ (V ∖ 𝐵))
Colors of variables: wff setvar class
Syntax hints:   = wceq 1570  Vcvv 3455  cdif 3902  cun 3903  cin 3904
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-ext 2735
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-tru 1573  df-ex 1810  df-sb 2097  df-clab 2742  df-cleq 2755  df-clel 2838  df-rab 3417  df-v 3457  df-dif 3908  df-un 3910  df-in 3912
This theorem is referenced by:  difun1  4252
  Copyright terms: Public domain W3C validator