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

Theorem undifabs 4439
Description: Absorption of difference by union. (Contributed by NM, 18-Aug-2013.)
Assertion
Ref Expression
undifabs (𝐴 ∪ (𝐴𝐵)) = 𝐴

Proof of Theorem undifabs
StepHypRef Expression
1 undif3 4253 . 2 (𝐴 ∪ (𝐴𝐵)) = ((𝐴𝐴) ∖ (𝐵𝐴))
2 unidm 4111 . . 3 (𝐴𝐴) = 𝐴
32difeq1i 4077 . 2 ((𝐴𝐴) ∖ (𝐵𝐴)) = (𝐴 ∖ (𝐵𝐴))
4 difdif 4089 . 2 (𝐴 ∖ (𝐵𝐴)) = 𝐴
51, 3, 43eqtri 2790 1 (𝐴 ∪ (𝐴𝐵)) = 𝐴
Colors of variables: wff setvar class
Syntax hints:   = wceq 1570  cdif 3902  cun 3903
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
This theorem is referenced by:  dfif5  4504  indifundif  32870  dfsucmap3  39112
  Copyright terms: Public domain W3C validator