| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ntrss | Structured version Visualization version GIF version | ||
| Description: Subset relationship for interior. (Contributed by NM, 3-Oct-2007.) |
| Ref | Expression |
|---|---|
| clscld.1 | ⊢ 𝑋 = ∪ 𝐽 |
| Ref | Expression |
|---|---|
| ntrss | ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋 ∧ 𝑇 ⊆ 𝑆) → ((int‘𝐽)‘𝑇) ⊆ ((int‘𝐽)‘𝑆)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | sscon 4123 | . . . . . . 7 ⊢ (𝑇 ⊆ 𝑆 → (𝑋 ∖ 𝑆) ⊆ (𝑋 ∖ 𝑇)) | |
| 2 | 1 | adantl 481 | . . . . . 6 ⊢ ((𝑆 ⊆ 𝑋 ∧ 𝑇 ⊆ 𝑆) → (𝑋 ∖ 𝑆) ⊆ (𝑋 ∖ 𝑇)) |
| 3 | difss 4116 | . . . . . 6 ⊢ (𝑋 ∖ 𝑇) ⊆ 𝑋 | |
| 4 | 2, 3 | jctil 519 | . . . . 5 ⊢ ((𝑆 ⊆ 𝑋 ∧ 𝑇 ⊆ 𝑆) → ((𝑋 ∖ 𝑇) ⊆ 𝑋 ∧ (𝑋 ∖ 𝑆) ⊆ (𝑋 ∖ 𝑇))) |
| 5 | clscld.1 | . . . . . . 7 ⊢ 𝑋 = ∪ 𝐽 | |
| 6 | 5 | clsss 22997 | . . . . . 6 ⊢ ((𝐽 ∈ Top ∧ (𝑋 ∖ 𝑇) ⊆ 𝑋 ∧ (𝑋 ∖ 𝑆) ⊆ (𝑋 ∖ 𝑇)) → ((cls‘𝐽)‘(𝑋 ∖ 𝑆)) ⊆ ((cls‘𝐽)‘(𝑋 ∖ 𝑇))) |
| 7 | 6 | 3expb 1120 | . . . . 5 ⊢ ((𝐽 ∈ Top ∧ ((𝑋 ∖ 𝑇) ⊆ 𝑋 ∧ (𝑋 ∖ 𝑆) ⊆ (𝑋 ∖ 𝑇))) → ((cls‘𝐽)‘(𝑋 ∖ 𝑆)) ⊆ ((cls‘𝐽)‘(𝑋 ∖ 𝑇))) |
| 8 | 4, 7 | sylan2 593 | . . . 4 ⊢ ((𝐽 ∈ Top ∧ (𝑆 ⊆ 𝑋 ∧ 𝑇 ⊆ 𝑆)) → ((cls‘𝐽)‘(𝑋 ∖ 𝑆)) ⊆ ((cls‘𝐽)‘(𝑋 ∖ 𝑇))) |
| 9 | 8 | sscond 4126 | . . 3 ⊢ ((𝐽 ∈ Top ∧ (𝑆 ⊆ 𝑋 ∧ 𝑇 ⊆ 𝑆)) → (𝑋 ∖ ((cls‘𝐽)‘(𝑋 ∖ 𝑇))) ⊆ (𝑋 ∖ ((cls‘𝐽)‘(𝑋 ∖ 𝑆)))) |
| 10 | sstr2 3970 | . . . . 5 ⊢ (𝑇 ⊆ 𝑆 → (𝑆 ⊆ 𝑋 → 𝑇 ⊆ 𝑋)) | |
| 11 | 10 | impcom 407 | . . . 4 ⊢ ((𝑆 ⊆ 𝑋 ∧ 𝑇 ⊆ 𝑆) → 𝑇 ⊆ 𝑋) |
| 12 | 5 | ntrval2 22994 | . . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝑇 ⊆ 𝑋) → ((int‘𝐽)‘𝑇) = (𝑋 ∖ ((cls‘𝐽)‘(𝑋 ∖ 𝑇)))) |
| 13 | 11, 12 | sylan2 593 | . . 3 ⊢ ((𝐽 ∈ Top ∧ (𝑆 ⊆ 𝑋 ∧ 𝑇 ⊆ 𝑆)) → ((int‘𝐽)‘𝑇) = (𝑋 ∖ ((cls‘𝐽)‘(𝑋 ∖ 𝑇)))) |
| 14 | 5 | ntrval2 22994 | . . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → ((int‘𝐽)‘𝑆) = (𝑋 ∖ ((cls‘𝐽)‘(𝑋 ∖ 𝑆)))) |
| 15 | 14 | adantrr 717 | . . 3 ⊢ ((𝐽 ∈ Top ∧ (𝑆 ⊆ 𝑋 ∧ 𝑇 ⊆ 𝑆)) → ((int‘𝐽)‘𝑆) = (𝑋 ∖ ((cls‘𝐽)‘(𝑋 ∖ 𝑆)))) |
| 16 | 9, 13, 15 | 3sstr4d 4019 | . 2 ⊢ ((𝐽 ∈ Top ∧ (𝑆 ⊆ 𝑋 ∧ 𝑇 ⊆ 𝑆)) → ((int‘𝐽)‘𝑇) ⊆ ((int‘𝐽)‘𝑆)) |
| 17 | 16 | 3impb 1114 | 1 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋 ∧ 𝑇 ⊆ 𝑆) → ((int‘𝐽)‘𝑇) ⊆ ((int‘𝐽)‘𝑆)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1086 = wceq 1540 ∈ wcel 2109 ∖ cdif 3928 ⊆ wss 3931 ∪ cuni 4888 ‘cfv 6536 Topctop 22836 intcnt 22960 clsccl 22961 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2708 ax-rep 5254 ax-sep 5271 ax-nul 5281 ax-pow 5340 ax-pr 5407 ax-un 7734 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2540 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2810 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3062 df-reu 3365 df-rab 3421 df-v 3466 df-sbc 3771 df-csb 3880 df-dif 3934 df-un 3936 df-in 3938 df-ss 3948 df-nul 4314 df-if 4506 df-pw 4582 df-sn 4607 df-pr 4609 df-op 4613 df-uni 4889 df-int 4928 df-iun 4974 df-iin 4975 df-br 5125 df-opab 5187 df-mpt 5207 df-id 5553 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-iota 6489 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-top 22837 df-cld 22962 df-ntr 22963 df-cls 22964 |
| This theorem is referenced by: ntrin 23004 ntrcls0 23019 dvreslem 25867 dvres2lem 25868 dvaddbr 25897 dvmulbr 25898 dvmulbrOLD 25899 dvcnvrelem2 25980 ntruni 36350 cldregopn 36354 limciccioolb 45630 limcicciooub 45646 cncfiooicclem1 45902 |
| Copyright terms: Public domain | W3C validator |