Theorem difabs 4256

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

Step	Hyp	Ref	Expression
1		difun1 4252	. 2 ⊢ (𝐴 ∖ (𝐵 ∪ 𝐵)) = ((𝐴 ∖ 𝐵) ∖ 𝐵)
2		unidm 4111	. . 3 ⊢ (𝐵 ∪ 𝐵) = 𝐵
3	2	difeq2i 4078	. 2 ⊢ (𝐴 ∖ (𝐵 ∪ 𝐵)) = (𝐴 ∖ 𝐵)
4	1, 3	eqtr3i 2788	1 ⊢ ((𝐴 ∖ 𝐵) ∖ 𝐵) = (𝐴 ∖ 𝐵)

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  df-in 3912

This theorem is referenced by:  axcclem  10436  lpdifsn  23300  compne  45150