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

Theorem difabs 4249
Description: Absorption-like law for class difference: you can remove a class only once. (Contributed by FL, 2-Aug-2009.)
Assertion
Ref Expression
difabs ((𝐴 ∖ 𝐵) ∖ 𝐵) = (𝐴 ∖ 𝐵)

Proof of Theorem difabs
StepHypRef Expression
1 difun1 4245 . 2 (𝐴 ∖ (𝐵 ∪ 𝐵)) = ((𝐴 ∖ 𝐵) ∖ 𝐵)
2 unidm 4104 . . 3 (𝐵 ∪ 𝐵) = 𝐵
32difeq2i 4071 . 2 (𝐴 ∖ (𝐵 ∪ 𝐵)) = (𝐴 ∖ 𝐵)
41, 3eqtr3i 2786 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  df-in 3906
This theorem is used by:  axcclem  10528  lpdifsn  23454  compne  45409
  Copyright terms: Public domain W3C validator