| 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 5067 | . . . 4 ⊢ (𝐶 ⊆ 𝒫 𝑋 ↔ ∪ 𝐶 ⊆ 𝑋) | |
| 2 | elssuni 4905 | . . . . . . . 8 ⊢ (𝑐 ∈ 𝐶 → 𝑐 ⊆ ∪ 𝐶) | |
| 3 | sstr2 3945 | . . . . . . . 8 ⊢ (𝑐 ⊆ ∪ 𝐶 → (∪ 𝐶 ⊆ 𝑋 → 𝑐 ⊆ 𝑋)) | |
| 4 | 2, 3 | syl 18 | . . . . . . 7 ⊢ (𝑐 ∈ 𝐶 → (∪ 𝐶 ⊆ 𝑋 → 𝑐 ⊆ 𝑋)) |
| 5 | 4 | adantl 486 | . . . . . 6 ⊢ ((𝐽 ∈ Top ∧ 𝑐 ∈ 𝐶) → (∪ 𝐶 ⊆ 𝑋 → 𝑐 ⊆ 𝑋)) |
| 6 | intss1 4929 | . . . . . . . . 9 ⊢ (𝑐 ∈ 𝐶 → ∩ 𝐶 ⊆ 𝑐) | |
| 7 | clsint2.1 | . . . . . . . . . 10 ⊢ 𝑋 = ∪ 𝐽 | |
| 8 | 7 | clsss 23192 | . . . . . . . . 9 ⊢ ((𝐽 ∈ Top ∧ 𝑐 ⊆ 𝑋 ∧ ∩ 𝐶 ⊆ 𝑐) → ((cls‘𝐽)‘∩ 𝐶) ⊆ ((cls‘𝐽)‘𝑐)) |
| 9 | 6, 8 | syl3an3 1183 | . . . . . . . 8 ⊢ ((𝐽 ∈ Top ∧ 𝑐 ⊆ 𝑋 ∧ 𝑐 ∈ 𝐶) → ((cls‘𝐽)‘∩ 𝐶) ⊆ ((cls‘𝐽)‘𝑐)) |
| 10 | 9 | 3com23 1144 | . . . . . . 7 ⊢ ((𝐽 ∈ Top ∧ 𝑐 ∈ 𝐶 ∧ 𝑐 ⊆ 𝑋) → ((cls‘𝐽)‘∩ 𝐶) ⊆ ((cls‘𝐽)‘𝑐)) |
| 11 | 10 | 3expia 1139 | . . . . . 6 ⊢ ((𝐽 ∈ Top ∧ 𝑐 ∈ 𝐶) → (𝑐 ⊆ 𝑋 → ((cls‘𝐽)‘∩ 𝐶) ⊆ ((cls‘𝐽)‘𝑐))) |
| 12 | 5, 11 | syld 48 | . . . . 5 ⊢ ((𝐽 ∈ Top ∧ 𝑐 ∈ 𝐶) → (∪ 𝐶 ⊆ 𝑋 → ((cls‘𝐽)‘∩ 𝐶) ⊆ ((cls‘𝐽)‘𝑐))) |
| 13 | 12 | impancom 456 | . . . 4 ⊢ ((𝐽 ∈ Top ∧ ∪ 𝐶 ⊆ 𝑋) → (𝑐 ∈ 𝐶 → ((cls‘𝐽)‘∩ 𝐶) ⊆ ((cls‘𝐽)‘𝑐))) |
| 14 | 1, 13 | sylan2b 605 | . . 3 ⊢ ((𝐽 ∈ Top ∧ 𝐶 ⊆ 𝒫 𝑋) → (𝑐 ∈ 𝐶 → ((cls‘𝐽)‘∩ 𝐶) ⊆ ((cls‘𝐽)‘𝑐))) |
| 15 | 14 | ralrimiv 3156 | . 2 ⊢ ((𝐽 ∈ Top ∧ 𝐶 ⊆ 𝒫 𝑋) → ∀𝑐 ∈ 𝐶 ((cls‘𝐽)‘∩ 𝐶) ⊆ ((cls‘𝐽)‘𝑐)) |
| 16 | ssiin 5021 | . 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 400 = wceq 1570 ∈ wcel 2143 ∀wral 3079 ⊆ wss 3906 𝒫 cpw 4563 ∪ cuni 4873 ∩ cint 4913 ∩ ciin 4958 ‘cfv 6538 Topctop 23031 clsccl 23156 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-rep 5239 ax-sep 5258 ax-nul 5270 ax-pow 5338 ax-pr 5406 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-ral 3080 df-rex 3090 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3746 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4288 df-if 4489 df-pw 4565 df-sn 4591 df-pr 4593 df-op 4597 df-uni 4874 df-int 4914 df-iun 4959 df-iin 4960 df-br 5111 df-opab 5175 df-mpt 5194 df-id 5558 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-top 23032 df-cld 23157 df-cls 23159 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |