Theorem difuncomp 33141

Description: Express a class difference using unions and class complements. (Contributed by Thierry Arnoux, 21-Jun-2020.)

Assertion

Ref	Expression
difuncomp	⊢ (𝐴 ⊆ 𝐶 → (𝐴 ∖ 𝐵) = (𝐶 ∖ ((𝐶 ∖ 𝐴) ∪ 𝐵)))

Proof of Theorem difuncomp

Step	Hyp	Ref	Expression
1		sseqin2 4169	. . . . 5 ⊢ (𝐴 ⊆ 𝐶 ↔ (𝐶 ∩ 𝐴) = 𝐴)
2	1	biimpi 219	. . . 4 ⊢ (𝐴 ⊆ 𝐶 → (𝐶 ∩ 𝐴) = 𝐴)
3		incom 4155	. . . 4 ⊢ (𝐶 ∩ 𝐴) = (𝐴 ∩ 𝐶)
4	2, 3	eqtr3di 2811	. . 3 ⊢ (𝐴 ⊆ 𝐶 → 𝐴 = (𝐴 ∩ 𝐶))
5	4	difeq1d 4073	. 2 ⊢ (𝐴 ⊆ 𝐶 → (𝐴 ∖ 𝐵) = ((𝐴 ∩ 𝐶) ∖ 𝐵))
6		difundi 4236	. . . 4 ⊢ (𝐶 ∖ ((𝐶 ∖ 𝐴) ∪ 𝐵)) = ((𝐶 ∖ (𝐶 ∖ 𝐴)) ∩ (𝐶 ∖ 𝐵))
7		dfss4 4215	. . . . . 6 ⊢ (𝐴 ⊆ 𝐶 ↔ (𝐶 ∖ (𝐶 ∖ 𝐴)) = 𝐴)
8	7	biimpi 219	. . . . 5 ⊢ (𝐴 ⊆ 𝐶 → (𝐶 ∖ (𝐶 ∖ 𝐴)) = 𝐴)
9	8	ineq1d 4165	. . . 4 ⊢ (𝐴 ⊆ 𝐶 → ((𝐶 ∖ (𝐶 ∖ 𝐴)) ∩ (𝐶 ∖ 𝐵)) = (𝐴 ∩ (𝐶 ∖ 𝐵)))
10	6, 9	eqtrid 2808	. . 3 ⊢ (𝐴 ⊆ 𝐶 → (𝐶 ∖ ((𝐶 ∖ 𝐴) ∪ 𝐵)) = (𝐴 ∩ (𝐶 ∖ 𝐵)))
11		indif2 4227	. . 3 ⊢ (𝐴 ∩ (𝐶 ∖ 𝐵)) = ((𝐴 ∩ 𝐶) ∖ 𝐵)
12	10, 11	eqtrdi 2812	. 2 ⊢ (𝐴 ⊆ 𝐶 → (𝐶 ∖ ((𝐶 ∖ 𝐴) ∪ 𝐵)) = ((𝐴 ∩ 𝐶) ∖ 𝐵))
13	5, 12	eqtr4d 2799	1 ⊢ (𝐴 ⊆ 𝐶 → (𝐴 ∖ 𝐵) = (𝐶 ∖ ((𝐶 ∖ 𝐴) ∪ 𝐵)))

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∖ cdif 3896   ∪ cun 3897   ∩ cin 3898   ⊆ wss 3899

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-3an 1105  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  df-ss 3916

This theorem is used by:  ldgenpisyslem1  34789