![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > clsss | Structured version Visualization version GIF version |
Description: Subset relationship for closure. (Contributed by NM, 10-Feb-2007.) |
Ref | Expression |
---|---|
clscld.1 | ⊢ 𝑋 = ∪ 𝐽 |
Ref | Expression |
---|---|
clsss | ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋 ∧ 𝑇 ⊆ 𝑆) → ((cls‘𝐽)‘𝑇) ⊆ ((cls‘𝐽)‘𝑆)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | sstr2 3951 | . . . . . 6 ⊢ (𝑇 ⊆ 𝑆 → (𝑆 ⊆ 𝑥 → 𝑇 ⊆ 𝑥)) | |
2 | 1 | adantr 481 | . . . . 5 ⊢ ((𝑇 ⊆ 𝑆 ∧ 𝑥 ∈ (Clsd‘𝐽)) → (𝑆 ⊆ 𝑥 → 𝑇 ⊆ 𝑥)) |
3 | 2 | ss2rabdv 4033 | . . . 4 ⊢ (𝑇 ⊆ 𝑆 → {𝑥 ∈ (Clsd‘𝐽) ∣ 𝑆 ⊆ 𝑥} ⊆ {𝑥 ∈ (Clsd‘𝐽) ∣ 𝑇 ⊆ 𝑥}) |
4 | intss 4930 | . . . 4 ⊢ ({𝑥 ∈ (Clsd‘𝐽) ∣ 𝑆 ⊆ 𝑥} ⊆ {𝑥 ∈ (Clsd‘𝐽) ∣ 𝑇 ⊆ 𝑥} → ∩ {𝑥 ∈ (Clsd‘𝐽) ∣ 𝑇 ⊆ 𝑥} ⊆ ∩ {𝑥 ∈ (Clsd‘𝐽) ∣ 𝑆 ⊆ 𝑥}) | |
5 | 3, 4 | syl 17 | . . 3 ⊢ (𝑇 ⊆ 𝑆 → ∩ {𝑥 ∈ (Clsd‘𝐽) ∣ 𝑇 ⊆ 𝑥} ⊆ ∩ {𝑥 ∈ (Clsd‘𝐽) ∣ 𝑆 ⊆ 𝑥}) |
6 | 5 | 3ad2ant3 1135 | . 2 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋 ∧ 𝑇 ⊆ 𝑆) → ∩ {𝑥 ∈ (Clsd‘𝐽) ∣ 𝑇 ⊆ 𝑥} ⊆ ∩ {𝑥 ∈ (Clsd‘𝐽) ∣ 𝑆 ⊆ 𝑥}) |
7 | simp1 1136 | . . 3 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋 ∧ 𝑇 ⊆ 𝑆) → 𝐽 ∈ Top) | |
8 | sstr2 3951 | . . . . 5 ⊢ (𝑇 ⊆ 𝑆 → (𝑆 ⊆ 𝑋 → 𝑇 ⊆ 𝑋)) | |
9 | 8 | impcom 408 | . . . 4 ⊢ ((𝑆 ⊆ 𝑋 ∧ 𝑇 ⊆ 𝑆) → 𝑇 ⊆ 𝑋) |
10 | 9 | 3adant1 1130 | . . 3 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋 ∧ 𝑇 ⊆ 𝑆) → 𝑇 ⊆ 𝑋) |
11 | clscld.1 | . . . 4 ⊢ 𝑋 = ∪ 𝐽 | |
12 | 11 | clsval 22386 | . . 3 ⊢ ((𝐽 ∈ Top ∧ 𝑇 ⊆ 𝑋) → ((cls‘𝐽)‘𝑇) = ∩ {𝑥 ∈ (Clsd‘𝐽) ∣ 𝑇 ⊆ 𝑥}) |
13 | 7, 10, 12 | syl2anc 584 | . 2 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋 ∧ 𝑇 ⊆ 𝑆) → ((cls‘𝐽)‘𝑇) = ∩ {𝑥 ∈ (Clsd‘𝐽) ∣ 𝑇 ⊆ 𝑥}) |
14 | 11 | clsval 22386 | . . 3 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → ((cls‘𝐽)‘𝑆) = ∩ {𝑥 ∈ (Clsd‘𝐽) ∣ 𝑆 ⊆ 𝑥}) |
15 | 14 | 3adant3 1132 | . 2 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋 ∧ 𝑇 ⊆ 𝑆) → ((cls‘𝐽)‘𝑆) = ∩ {𝑥 ∈ (Clsd‘𝐽) ∣ 𝑆 ⊆ 𝑥}) |
16 | 6, 13, 15 | 3sstr4d 3991 | 1 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋 ∧ 𝑇 ⊆ 𝑆) → ((cls‘𝐽)‘𝑇) ⊆ ((cls‘𝐽)‘𝑆)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ w3a 1087 = wceq 1541 ∈ wcel 2106 {crab 3407 ⊆ wss 3910 ∪ cuni 4865 ∩ cint 4907 ‘cfv 6496 Topctop 22240 Clsdccld 22365 clsccl 22367 |
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 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2707 ax-rep 5242 ax-sep 5256 ax-nul 5263 ax-pow 5320 ax-pr 5384 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2538 df-eu 2567 df-clab 2714 df-cleq 2728 df-clel 2814 df-nfc 2889 df-ne 2944 df-ral 3065 df-rex 3074 df-reu 3354 df-rab 3408 df-v 3447 df-sbc 3740 df-csb 3856 df-dif 3913 df-un 3915 df-in 3917 df-ss 3927 df-nul 4283 df-if 4487 df-pw 4562 df-sn 4587 df-pr 4589 df-op 4593 df-uni 4866 df-int 4908 df-iun 4956 df-br 5106 df-opab 5168 df-mpt 5189 df-id 5531 df-xp 5639 df-rel 5640 df-cnv 5641 df-co 5642 df-dm 5643 df-rn 5644 df-res 5645 df-ima 5646 df-iota 6448 df-fun 6498 df-fn 6499 df-f 6500 df-f1 6501 df-fo 6502 df-f1o 6503 df-fv 6504 df-top 22241 df-cld 22368 df-cls 22370 |
This theorem is referenced by: ntrss 22404 clsss2 22421 lpsscls 22490 lpss3 22493 cnclsi 22621 cncls 22623 lpcls 22713 cnextcn 23416 clssubg 23458 clsnsg 23459 utopreg 23602 hauseqcn 32419 kur14lem6 33745 clsint2 34791 opnregcld 34792 |
Copyright terms: Public domain | W3C validator |