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

Theorem difabs 4251
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 4247 . 2 (𝐴 ∖ (𝐵 ∪ 𝐵)) = ((𝐴 ∖ 𝐵) ∖ 𝐵)
2 unidm 4159 . . 3 (𝐵 ∪ 𝐵) = 𝐵
32difeq2i 4063 . 2 (𝐴 ∖ (𝐵 ∪ 𝐵)) = (𝐴 ∖ 𝐵)
41, 3eqtr3i 2788 1 ((𝐴 ∖ 𝐵) ∖ 𝐵) = (𝐴 ∖ 𝐵)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   = wceq 1570   ∖ cdif 4048   ∪ cun 4152
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-rab 3417  df-v 3456  df-dif 4050  df-in 4094  df-un 4154
This theorem is used by:  axcclem  10574  lpdifsn  23516  compne  45684
  Copyright terms: Public domain W3C validator