| 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 50482. 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 4241 | . . . . 5 ⊢ (𝑆 ∩ (((cls‘𝐽)‘𝑆) ∖ 𝑇)) = ((𝑆 ∩ ((cls‘𝐽)‘𝑆)) ∖ (𝑆 ∩ 𝑇)) | |
| 2 | 1 | a1i 11 | . . . 4 ⊢ (𝜑 → (𝑆 ∩ (((cls‘𝐽)‘𝑆) ∖ 𝑇)) = ((𝑆 ∩ ((cls‘𝐽)‘𝑆)) ∖ (𝑆 ∩ 𝑇))) |
| 3 | iscnrm3rlem4.3 | . . . . . 6 ⊢ (𝜑 → (𝑆 ∩ 𝑇) = ∅) | |
| 4 | 3 | difeq2d 4065 | . . . . 5 ⊢ (𝜑 → ((𝑆 ∩ ((cls‘𝐽)‘𝑆)) ∖ (𝑆 ∩ 𝑇)) = ((𝑆 ∩ ((cls‘𝐽)‘𝑆)) ∖ ∅)) |
| 5 | dif0 4329 | . . . . 5 ⊢ ((𝑆 ∩ ((cls‘𝐽)‘𝑆)) ∖ ∅) = (𝑆 ∩ ((cls‘𝐽)‘𝑆)) | |
| 6 | 4, 5 | eqtrdi 2817 | . . . 4 ⊢ (𝜑 → ((𝑆 ∩ ((cls‘𝐽)‘𝑆)) ∖ (𝑆 ∩ 𝑇)) = (𝑆 ∩ ((cls‘𝐽)‘𝑆))) |
| 7 | iscnrm3rlem4.1 | . . . . . 6 ⊢ (𝜑 → 𝐽 ∈ Top) | |
| 8 | iscnrm3rlem4.2 | . . . . . 6 ⊢ (𝜑 → 𝑆 ⊆ ∪ 𝐽) | |
| 9 | eqid 2766 | . . . . . . 7 ⊢ ∪ 𝐽 = ∪ 𝐽 | |
| 10 | 9 | sscls 23431 | . . . . . 6 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ ∪ 𝐽) → 𝑆 ⊆ ((cls‘𝐽)‘𝑆)) |
| 11 | 7, 8, 10 | syl2anc 596 | . . . . 5 ⊢ (𝜑 → 𝑆 ⊆ ((cls‘𝐽)‘𝑆)) |
| 12 | dfss2 4096 | . . . . 5 ⊢ (𝑆 ⊆ ((cls‘𝐽)‘𝑆) ↔ (𝑆 ∩ ((cls‘𝐽)‘𝑆)) = 𝑆) | |
| 13 | 11, 12 | sylib 221 | . . . 4 ⊢ (𝜑 → (𝑆 ∩ ((cls‘𝐽)‘𝑆)) = 𝑆) |
| 14 | 2, 6, 13 | 3eqtrd 2805 | . . 3 ⊢ (𝜑 → (𝑆 ∩ (((cls‘𝐽)‘𝑆) ∖ 𝑇)) = 𝑆) |
| 15 | dfss2 4096 | . . 3 ⊢ (𝑆 ⊆ (((cls‘𝐽)‘𝑆) ∖ 𝑇) ↔ (𝑆 ∩ (((cls‘𝐽)‘𝑆) ∖ 𝑇)) = 𝑆) | |
| 16 | 14, 15 | sylibr 237 | . 2 ⊢ (𝜑 → 𝑆 ⊆ (((cls‘𝐽)‘𝑆) ∖ 𝑇)) |
| 17 | iscnrm3rlem4.4 | . 2 ⊢ (𝜑 → (((cls‘𝐽)‘𝑆) ∖ 𝑇) ⊆ 𝑁) | |
| 18 | 16, 17 | sstrd 3922 | 1 ⊢ (𝜑 → 𝑆 ⊆ 𝑁) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1572 ∈ wcel 2150 ⊆ wss 3899 ∖ cdif 4047 ∩ cin 4091 ∅c0 4280 ∪ cuni 4871 ‘cfv 6565 Topctop 23268 clsccl 23393 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1830 ax-4 1844 ax-5 1947 ax-6 2004 ax-7 2045 ax-8 2152 ax-9 2160 ax-10 2183 ax-11 2200 ax-12 2219 ax-ext 2738 ax-rep 5237 ax-sep 5254 ax-nul 5265 ax-pow 5333 ax-pr 5397 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1106 df-tru 1575 df-fal 1585 df-ex 1815 df-nf 1819 df-sb 2104 df-mo 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2842 df-nfc 2916 df-ne 2963 df-ral 3084 df-rex 3094 df-reu 3369 df-rab 3416 df-v 3455 df-sbc 3742 df-csb 3851 df-ss 3900 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-pw 4561 df-sn 4588 df-pr 4590 df-op 4840 df-uni 4872 df-int 4912 df-iun 4957 df-br 5108 df-opab 5173 df-mpt 5192 df-id 5552 df-xp 5663 df-rel 5664 df-cnv 5665 df-co 5666 df-dm 5667 df-rn 5668 df-res 5669 df-ima 5670 df-iota 6519 df-fun 6567 df-fn 6568 df-f 6569 df-f1 6570 df-fo 6571 df-f1o 6572 df-fv 6573 df-top 23269 df-cld 23394 df-cls 23396 |
| This theorem is used by: iscnrm3rlem8 50482 |
| Copyright terms: Public domain | W3C validator |