Theorem undifabs 4433

Description: Absorption of difference by union. (Contributed by NM, 18-Aug-2013.)

Assertion

Ref	Expression
undifabs	⊢ (𝐴 ∪ (𝐴 ∖ 𝐵)) = 𝐴

Proof of Theorem undifabs

Step	Hyp	Ref	Expression
1		undif3 4244	. 2 ⊢ (𝐴 ∪ (𝐴 ∖ 𝐵)) = ((𝐴 ∪ 𝐴) ∖ (𝐵 ∖ 𝐴))
2		unidm 4155	. . 3 ⊢ (𝐴 ∪ 𝐴) = 𝐴
3	2	difeq1i 4058	. 2 ⊢ ((𝐴 ∪ 𝐴) ∖ (𝐵 ∖ 𝐴)) = (𝐴 ∖ (𝐵 ∖ 𝐴))
4		difdif 4070	. 2 ⊢ (𝐴 ∖ (𝐵 ∖ 𝐴)) = 𝐴
5	1, 3, 4	3eqtri 2787	1 ⊢ (𝐴 ∪ (𝐴 ∖ 𝐵)) = 𝐴

This proof depends on syntax axioms:   = wceq 1569   ∖ cdif 4044   ∪ cun 4148

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1572  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-rab 3413  df-v 3452  df-dif 4046  df-un 4150

This theorem is used by:  dfif5  4498  indifundif  33169  dfsucmap3  39502