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

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

Proof of Theorem undifabs
StepHypRef Expression
1 undif3 4246 . 2 (𝐴 ∪ (𝐴 ∖ 𝐵)) = ((𝐴 ∪ 𝐴) ∖ (𝐵 ∖ 𝐴))
2 unidm 4104 . . 3 (𝐴 ∪ 𝐴) = 𝐴
32difeq1i 4070 . 2 ((𝐴 ∪ 𝐴) ∖ (𝐵 ∖ 𝐴)) = (𝐴 ∖ (𝐵 ∖ 𝐴))
4 difdif 4082 . 2 (𝐴 ∖ (𝐵 ∖ 𝐴)) = 𝐴
51, 3, 43eqtri 2788 1 (𝐴 ∪ (𝐴 ∖ 𝐵)) = 𝐴
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   = wceq 1570   ∖ cdif 3896   ∪ cun 3897
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2733
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904
This theorem is used by:  dfif5  4499  indifundif  33113  dfsucmap3  39375
  Copyright terms: Public domain W3C validator