| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > fclstop | Structured version Visualization version GIF version | ||
| Description: Reverse closure for the cluster point predicate. (Contributed by Mario Carneiro, 11-Apr-2015.) (Revised by Stefan O'Rear, 8-Aug-2015.) |
| Ref | Expression |
|---|---|
| fclstop | ⊢ (𝐴 ∈ (𝐽 fClus 𝐹) → 𝐽 ∈ Top) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2731 | . . 3 ⊢ ∪ 𝐽 = ∪ 𝐽 | |
| 2 | 1 | isfcls 23919 | . 2 ⊢ (𝐴 ∈ (𝐽 fClus 𝐹) ↔ (𝐽 ∈ Top ∧ 𝐹 ∈ (Fil‘∪ 𝐽) ∧ ∀𝑠 ∈ 𝐹 𝐴 ∈ ((cls‘𝐽)‘𝑠))) |
| 3 | 2 | simp1bi 1145 | 1 ⊢ (𝐴 ∈ (𝐽 fClus 𝐹) → 𝐽 ∈ Top) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∈ wcel 2111 ∀wral 3047 ∪ cuni 4854 ‘cfv 6476 (class class class)co 7341 Topctop 22803 clsccl 22928 Filcfil 23755 fClus cfcls 23846 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2113 ax-9 2121 ax-10 2144 ax-11 2160 ax-12 2180 ax-ext 2703 ax-sep 5229 ax-nul 5239 ax-pow 5298 ax-pr 5365 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2535 df-eu 2564 df-clab 2710 df-cleq 2723 df-clel 2806 df-nfc 2881 df-ne 2929 df-nel 3033 df-ral 3048 df-rex 3057 df-rab 3396 df-v 3438 df-sbc 3737 df-csb 3846 df-dif 3900 df-un 3902 df-in 3904 df-ss 3914 df-nul 4279 df-if 4471 df-pw 4547 df-sn 4572 df-pr 4574 df-op 4578 df-uni 4855 df-int 4893 df-iin 4939 df-br 5087 df-opab 5149 df-mpt 5168 df-id 5506 df-xp 5617 df-rel 5618 df-cnv 5619 df-co 5620 df-dm 5621 df-rn 5622 df-res 5623 df-ima 5624 df-iota 6432 df-fun 6478 df-fn 6479 df-fv 6484 df-ov 7344 df-oprab 7345 df-mpo 7346 df-fbas 21283 df-fil 23756 df-fcls 23851 |
| This theorem is referenced by: fclstopon 23922 fclsneii 23927 fclsfnflim 23937 flimfnfcls 23938 |
| Copyright terms: Public domain | W3C validator |