Theorem psdmullem 22365

Description: Lemma for psdmul 22366. Transitive law for union of class difference. (Contributed by SN, 5-May-2025.)

Hypotheses

Ref	Expression
psdmullem.cb	⊢ (𝜑 → 𝐶 ⊆ 𝐵)
psdmullem.ba	⊢ (𝜑 → 𝐵 ⊆ 𝐴)

Assertion

Ref	Expression
psdmullem	⊢ (𝜑 → ((𝐴 ∖ 𝐵) ∪ (𝐵 ∖ 𝐶)) = (𝐴 ∖ 𝐶))

Proof of Theorem psdmullem

Step	Hyp	Ref	Expression
1		undif3 4256	. 2 ⊢ ((𝐴 ∖ 𝐵) ∪ (𝐵 ∖ 𝐶)) = (((𝐴 ∖ 𝐵) ∪ 𝐵) ∖ (𝐶 ∖ (𝐴 ∖ 𝐵)))
2		psdmullem.ba	. . . 4 ⊢ (𝜑 → 𝐵 ⊆ 𝐴)
3		undifr 4449	. . . 4 ⊢ (𝐵 ⊆ 𝐴 ↔ ((𝐴 ∖ 𝐵) ∪ 𝐵) = 𝐴)
4	2, 3	sylib 221	. . 3 ⊢ (𝜑 → ((𝐴 ∖ 𝐵) ∪ 𝐵) = 𝐴)
5		difdif2 4252	. . . 4 ⊢ (𝐶 ∖ (𝐴 ∖ 𝐵)) = ((𝐶 ∖ 𝐴) ∪ (𝐶 ∩ 𝐵))
6		psdmullem.cb	. . . . . . . 8 ⊢ (𝜑 → 𝐶 ⊆ 𝐵)
7	6, 2	sstrd 3950	. . . . . . 7 ⊢ (𝜑 → 𝐶 ⊆ 𝐴)
8		ssdif0 4324	. . . . . . 7 ⊢ (𝐶 ⊆ 𝐴 ↔ (𝐶 ∖ 𝐴) = ∅)
9	7, 8	sylib 221	. . . . . 6 ⊢ (𝜑 → (𝐶 ∖ 𝐴) = ∅)
10		dfss2 3926	. . . . . . 7 ⊢ (𝐶 ⊆ 𝐵 ↔ (𝐶 ∩ 𝐵) = 𝐶)
11	6, 10	sylib 221	. . . . . 6 ⊢ (𝜑 → (𝐶 ∩ 𝐵) = 𝐶)
12	9, 11	uneq12d 4126	. . . . 5 ⊢ (𝜑 → ((𝐶 ∖ 𝐴) ∪ (𝐶 ∩ 𝐵)) = (∅ ∪ 𝐶))
13		0un 4356	. . . . 5 ⊢ (∅ ∪ 𝐶) = 𝐶
14	12, 13	eqtrdi 2817	. . . 4 ⊢ (𝜑 → ((𝐶 ∖ 𝐴) ∪ (𝐶 ∩ 𝐵)) = 𝐶)
15	5, 14	eqtrid 2813	. . 3 ⊢ (𝜑 → (𝐶 ∖ (𝐴 ∖ 𝐵)) = 𝐶)
16	4, 15	difeq12d 4085	. 2 ⊢ (𝜑 → (((𝐴 ∖ 𝐵) ∪ 𝐵) ∖ (𝐶 ∖ (𝐴 ∖ 𝐵))) = (𝐴 ∖ 𝐶))
17	1, 16	eqtrid 2813	1 ⊢ (𝜑 → ((𝐴 ∖ 𝐵) ∪ (𝐵 ∖ 𝐶)) = (𝐴 ∖ 𝐶))

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∖ cdif 3905   ∪ cun 3906   ∩ cin 3907   ⊆ wss 3908  ∅c0 4289

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 2148  ax-9 2156  ax-ext 2738

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2745  df-cleq 2758  df-clel 2841  df-rab 3420  df-v 3460  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290

This theorem is used by:  psdmul  22366