| Mathbox for Zhi Wang |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > iscnrm3rlem4 | Structured version Visualization version GIF version | ||
| Description: Lemma for iscnrm3rlem8 49573. Given two disjoint subsets 𝑆 and 𝑇 of the underlying set of a topology 𝐽, if 𝑁 is a superset of (((cls‘𝐽)‘𝑆) ∖ 𝑇), then it is a superset of 𝑆. (Contributed by Zhi Wang, 5-Sep-2024.) |
| Ref | Expression |
|---|---|
| iscnrm3rlem4.1 | ⊢ (𝜑 → 𝐽 ∈ Top) |
| iscnrm3rlem4.2 | ⊢ (𝜑 → 𝑆 ⊆ ∪ 𝐽) |
| iscnrm3rlem4.3 | ⊢ (𝜑 → (𝑆 ∩ 𝑇) = ∅) |
| iscnrm3rlem4.4 | ⊢ (𝜑 → (((cls‘𝐽)‘𝑆) ∖ 𝑇) ⊆ 𝑁) |
| Ref | Expression |
|---|---|
| iscnrm3rlem4 | ⊢ (𝜑 → 𝑆 ⊆ 𝑁) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | indifdi 4248 | . . . . 5 ⊢ (𝑆 ∩ (((cls‘𝐽)‘𝑆) ∖ 𝑇)) = ((𝑆 ∩ ((cls‘𝐽)‘𝑆)) ∖ (𝑆 ∩ 𝑇)) | |
| 2 | 1 | a1i 11 | . . . 4 ⊢ (𝜑 → (𝑆 ∩ (((cls‘𝐽)‘𝑆) ∖ 𝑇)) = ((𝑆 ∩ ((cls‘𝐽)‘𝑆)) ∖ (𝑆 ∩ 𝑇))) |
| 3 | iscnrm3rlem4.3 | . . . . . 6 ⊢ (𝜑 → (𝑆 ∩ 𝑇) = ∅) | |
| 4 | 3 | difeq2d 4082 | . . . . 5 ⊢ (𝜑 → ((𝑆 ∩ ((cls‘𝐽)‘𝑆)) ∖ (𝑆 ∩ 𝑇)) = ((𝑆 ∩ ((cls‘𝐽)‘𝑆)) ∖ ∅)) |
| 5 | dif0 4333 | . . . . 5 ⊢ ((𝑆 ∩ ((cls‘𝐽)‘𝑆)) ∖ ∅) = (𝑆 ∩ ((cls‘𝐽)‘𝑆)) | |
| 6 | 4, 5 | eqtrdi 2815 | . . . 4 ⊢ (𝜑 → ((𝑆 ∩ ((cls‘𝐽)‘𝑆)) ∖ (𝑆 ∩ 𝑇)) = (𝑆 ∩ ((cls‘𝐽)‘𝑆))) |
| 7 | iscnrm3rlem4.1 | . . . . . 6 ⊢ (𝜑 → 𝐽 ∈ Top) | |
| 8 | iscnrm3rlem4.2 | . . . . . 6 ⊢ (𝜑 → 𝑆 ⊆ ∪ 𝐽) | |
| 9 | eqid 2764 | . . . . . . 7 ⊢ ∪ 𝐽 = ∪ 𝐽 | |
| 10 | 9 | sscls 23118 | . . . . . 6 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ ∪ 𝐽) → 𝑆 ⊆ ((cls‘𝐽)‘𝑆)) |
| 11 | 7, 8, 10 | syl2anc 593 | . . . . 5 ⊢ (𝜑 → 𝑆 ⊆ ((cls‘𝐽)‘𝑆)) |
| 12 | dfss2 3924 | . . . . 5 ⊢ (𝑆 ⊆ ((cls‘𝐽)‘𝑆) ↔ (𝑆 ∩ ((cls‘𝐽)‘𝑆)) = 𝑆) | |
| 13 | 11, 12 | sylib 220 | . . . 4 ⊢ (𝜑 → (𝑆 ∩ ((cls‘𝐽)‘𝑆)) = 𝑆) |
| 14 | 2, 6, 13 | 3eqtrd 2803 | . . 3 ⊢ (𝜑 → (𝑆 ∩ (((cls‘𝐽)‘𝑆) ∖ 𝑇)) = 𝑆) |
| 15 | dfss2 3924 | . . 3 ⊢ (𝑆 ⊆ (((cls‘𝐽)‘𝑆) ∖ 𝑇) ↔ (𝑆 ∩ (((cls‘𝐽)‘𝑆) ∖ 𝑇)) = 𝑆) | |
| 16 | 14, 15 | sylibr 236 | . 2 ⊢ (𝜑 → 𝑆 ⊆ (((cls‘𝐽)‘𝑆) ∖ 𝑇)) |
| 17 | iscnrm3rlem4.4 | . 2 ⊢ (𝜑 → (((cls‘𝐽)‘𝑆) ∖ 𝑇) ⊆ 𝑁) | |
| 18 | 16, 17 | sstrd 3948 | 1 ⊢ (𝜑 → 𝑆 ⊆ 𝑁) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1562 ∈ wcel 2144 ∖ cdif 3903 ∩ cin 3905 ⊆ wss 3906 ∅c0 4287 ∪ cuni 4867 ‘cfv 6523 Topctop 22955 clsccl 23080 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1817 ax-4 1831 ax-5 1932 ax-6 1989 ax-7 2030 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2214 ax-ext 2736 ax-rep 5229 ax-sep 5248 ax-nul 5258 ax-pow 5324 ax-pr 5392 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3an 1101 df-tru 1565 df-fal 1575 df-ex 1802 df-nf 1806 df-sb 2093 df-mo 2568 df-eu 2598 df-clab 2743 df-cleq 2756 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3079 df-rex 3089 df-reu 3370 df-rab 3417 df-v 3458 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4288 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-int 4908 df-iun 4953 df-br 5103 df-opab 5165 df-mpt 5184 df-id 5544 df-xp 5655 df-rel 5656 df-cnv 5657 df-co 5658 df-dm 5659 df-rn 5660 df-res 5661 df-ima 5662 df-iota 6479 df-fun 6525 df-fn 6526 df-f 6527 df-f1 6528 df-fo 6529 df-f1o 6530 df-fv 6531 df-top 22956 df-cld 23081 df-cls 23083 |
| This theorem is referenced by: iscnrm3rlem8 49573 |
| Copyright terms: Public domain | W3C validator |