Theorem iscnrm3rlem1 49252

Description: Lemma for iscnrm3rlem2 49253. The hypothesis could be generalized to (𝜑 → (𝑆 ∖ 𝑇) ⊆ 𝑋). (Contributed by Zhi Wang, 5-Sep-2024.)

Hypothesis

Ref	Expression
iscnrm3rlem1.1	⊢ (𝜑 → 𝑆 ⊆ 𝑋)

Assertion

Ref	Expression
iscnrm3rlem1	⊢ (𝜑 → (𝑆 ∖ 𝑇) = (𝑆 ∩ (𝑋 ∖ (𝑆 ∩ 𝑇))))

Proof of Theorem iscnrm3rlem1

Step	Hyp	Ref	Expression
1		difindi 4245	. . . 4 ⊢ (𝑋 ∖ (𝑆 ∩ 𝑇)) = ((𝑋 ∖ 𝑆) ∪ (𝑋 ∖ 𝑇))
2	1	ineq2i 4170	. . 3 ⊢ (𝑆 ∩ (𝑋 ∖ (𝑆 ∩ 𝑇))) = (𝑆 ∩ ((𝑋 ∖ 𝑆) ∪ (𝑋 ∖ 𝑇)))
3		indi 4237	. . 3 ⊢ (𝑆 ∩ ((𝑋 ∖ 𝑆) ∪ (𝑋 ∖ 𝑇))) = ((𝑆 ∩ (𝑋 ∖ 𝑆)) ∪ (𝑆 ∩ (𝑋 ∖ 𝑇)))
4		disjdif 4425	. . . . 5 ⊢ (𝑆 ∩ (𝑋 ∖ 𝑆)) = ∅
5	4	uneq1i 4117	. . . 4 ⊢ ((𝑆 ∩ (𝑋 ∖ 𝑆)) ∪ (𝑆 ∩ (𝑋 ∖ 𝑇))) = (∅ ∪ (𝑆 ∩ (𝑋 ∖ 𝑇)))
6		0un 4349	. . . 4 ⊢ (∅ ∪ (𝑆 ∩ (𝑋 ∖ 𝑇))) = (𝑆 ∩ (𝑋 ∖ 𝑇))
7		indif2 4234	. . . 4 ⊢ (𝑆 ∩ (𝑋 ∖ 𝑇)) = ((𝑆 ∩ 𝑋) ∖ 𝑇)
8	5, 6, 7	3eqtri 2764	. . 3 ⊢ ((𝑆 ∩ (𝑋 ∖ 𝑆)) ∪ (𝑆 ∩ (𝑋 ∖ 𝑇))) = ((𝑆 ∩ 𝑋) ∖ 𝑇)
9	2, 3, 8	3eqtri 2764	. 2 ⊢ (𝑆 ∩ (𝑋 ∖ (𝑆 ∩ 𝑇))) = ((𝑆 ∩ 𝑋) ∖ 𝑇)
10		iscnrm3rlem1.1	. . . 4 ⊢ (𝜑 → 𝑆 ⊆ 𝑋)
11		dfss2 3920	. . . 4 ⊢ (𝑆 ⊆ 𝑋 ↔ (𝑆 ∩ 𝑋) = 𝑆)
12	10, 11	sylib 218	. . 3 ⊢ (𝜑 → (𝑆 ∩ 𝑋) = 𝑆)
13	12	difeq1d 4078	. 2 ⊢ (𝜑 → ((𝑆 ∩ 𝑋) ∖ 𝑇) = (𝑆 ∖ 𝑇))
14	9, 13	eqtr2id 2785	1 ⊢ (𝜑 → (𝑆 ∖ 𝑇) = (𝑆 ∩ (𝑋 ∖ (𝑆 ∩ 𝑇))))

Syntax hints:   → wi 4   = wceq 1542   ∖ cdif 3899   ∪ cun 3900   ∩ cin 3901   ⊆ wss 3902  ∅c0 4286

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-ext 2709

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-rab 3401  df-v 3443  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4287

This theorem is referenced by:  iscnrm3rlem2  49253