Mathbox for Jeff Hankins |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > clsint2 | Structured version Visualization version GIF version |
Description: The closure of an intersection is a subset of the intersection of the closures. (Contributed by Jeff Hankins, 31-Aug-2009.) |
Ref | Expression |
---|---|
clsint2.1 | ⊢ 𝑋 = ∪ 𝐽 |
Ref | Expression |
---|---|
clsint2 | ⊢ ((𝐽 ∈ Top ∧ 𝐶 ⊆ 𝒫 𝑋) → ((cls‘𝐽)‘∩ 𝐶) ⊆ ∩ 𝑐 ∈ 𝐶 ((cls‘𝐽)‘𝑐)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | sspwuni 5008 | . . . 4 ⊢ (𝐶 ⊆ 𝒫 𝑋 ↔ ∪ 𝐶 ⊆ 𝑋) | |
2 | elssuni 4851 | . . . . . . . 8 ⊢ (𝑐 ∈ 𝐶 → 𝑐 ⊆ ∪ 𝐶) | |
3 | sstr2 3908 | . . . . . . . 8 ⊢ (𝑐 ⊆ ∪ 𝐶 → (∪ 𝐶 ⊆ 𝑋 → 𝑐 ⊆ 𝑋)) | |
4 | 2, 3 | syl 17 | . . . . . . 7 ⊢ (𝑐 ∈ 𝐶 → (∪ 𝐶 ⊆ 𝑋 → 𝑐 ⊆ 𝑋)) |
5 | 4 | adantl 485 | . . . . . 6 ⊢ ((𝐽 ∈ Top ∧ 𝑐 ∈ 𝐶) → (∪ 𝐶 ⊆ 𝑋 → 𝑐 ⊆ 𝑋)) |
6 | intss1 4874 | . . . . . . . . 9 ⊢ (𝑐 ∈ 𝐶 → ∩ 𝐶 ⊆ 𝑐) | |
7 | clsint2.1 | . . . . . . . . . 10 ⊢ 𝑋 = ∪ 𝐽 | |
8 | 7 | clsss 21951 | . . . . . . . . 9 ⊢ ((𝐽 ∈ Top ∧ 𝑐 ⊆ 𝑋 ∧ ∩ 𝐶 ⊆ 𝑐) → ((cls‘𝐽)‘∩ 𝐶) ⊆ ((cls‘𝐽)‘𝑐)) |
9 | 6, 8 | syl3an3 1167 | . . . . . . . 8 ⊢ ((𝐽 ∈ Top ∧ 𝑐 ⊆ 𝑋 ∧ 𝑐 ∈ 𝐶) → ((cls‘𝐽)‘∩ 𝐶) ⊆ ((cls‘𝐽)‘𝑐)) |
10 | 9 | 3com23 1128 | . . . . . . 7 ⊢ ((𝐽 ∈ Top ∧ 𝑐 ∈ 𝐶 ∧ 𝑐 ⊆ 𝑋) → ((cls‘𝐽)‘∩ 𝐶) ⊆ ((cls‘𝐽)‘𝑐)) |
11 | 10 | 3expia 1123 | . . . . . 6 ⊢ ((𝐽 ∈ Top ∧ 𝑐 ∈ 𝐶) → (𝑐 ⊆ 𝑋 → ((cls‘𝐽)‘∩ 𝐶) ⊆ ((cls‘𝐽)‘𝑐))) |
12 | 5, 11 | syld 47 | . . . . 5 ⊢ ((𝐽 ∈ Top ∧ 𝑐 ∈ 𝐶) → (∪ 𝐶 ⊆ 𝑋 → ((cls‘𝐽)‘∩ 𝐶) ⊆ ((cls‘𝐽)‘𝑐))) |
13 | 12 | impancom 455 | . . . 4 ⊢ ((𝐽 ∈ Top ∧ ∪ 𝐶 ⊆ 𝑋) → (𝑐 ∈ 𝐶 → ((cls‘𝐽)‘∩ 𝐶) ⊆ ((cls‘𝐽)‘𝑐))) |
14 | 1, 13 | sylan2b 597 | . . 3 ⊢ ((𝐽 ∈ Top ∧ 𝐶 ⊆ 𝒫 𝑋) → (𝑐 ∈ 𝐶 → ((cls‘𝐽)‘∩ 𝐶) ⊆ ((cls‘𝐽)‘𝑐))) |
15 | 14 | ralrimiv 3104 | . 2 ⊢ ((𝐽 ∈ Top ∧ 𝐶 ⊆ 𝒫 𝑋) → ∀𝑐 ∈ 𝐶 ((cls‘𝐽)‘∩ 𝐶) ⊆ ((cls‘𝐽)‘𝑐)) |
16 | ssiin 4964 | . 2 ⊢ (((cls‘𝐽)‘∩ 𝐶) ⊆ ∩ 𝑐 ∈ 𝐶 ((cls‘𝐽)‘𝑐) ↔ ∀𝑐 ∈ 𝐶 ((cls‘𝐽)‘∩ 𝐶) ⊆ ((cls‘𝐽)‘𝑐)) | |
17 | 15, 16 | sylibr 237 | 1 ⊢ ((𝐽 ∈ Top ∧ 𝐶 ⊆ 𝒫 𝑋) → ((cls‘𝐽)‘∩ 𝐶) ⊆ ∩ 𝑐 ∈ 𝐶 ((cls‘𝐽)‘𝑐)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 399 = wceq 1543 ∈ wcel 2110 ∀wral 3061 ⊆ wss 3866 𝒫 cpw 4513 ∪ cuni 4819 ∩ cint 4859 ∩ ciin 4905 ‘cfv 6380 Topctop 21790 clsccl 21915 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1976 ax-7 2016 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2158 ax-12 2175 ax-ext 2708 ax-rep 5179 ax-sep 5192 ax-nul 5199 ax-pow 5258 ax-pr 5322 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 848 df-3an 1091 df-tru 1546 df-fal 1556 df-ex 1788 df-nf 1792 df-sb 2071 df-mo 2539 df-eu 2568 df-clab 2715 df-cleq 2729 df-clel 2816 df-nfc 2886 df-ne 2941 df-ral 3066 df-rex 3067 df-reu 3068 df-rab 3070 df-v 3410 df-sbc 3695 df-csb 3812 df-dif 3869 df-un 3871 df-in 3873 df-ss 3883 df-nul 4238 df-if 4440 df-pw 4515 df-sn 4542 df-pr 4544 df-op 4548 df-uni 4820 df-int 4860 df-iun 4906 df-iin 4907 df-br 5054 df-opab 5116 df-mpt 5136 df-id 5455 df-xp 5557 df-rel 5558 df-cnv 5559 df-co 5560 df-dm 5561 df-rn 5562 df-res 5563 df-ima 5564 df-iota 6338 df-fun 6382 df-fn 6383 df-f 6384 df-f1 6385 df-fo 6386 df-f1o 6387 df-fv 6388 df-top 21791 df-cld 21916 df-cls 21918 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |