Theorem fclsfil 24057

Description: Reverse closure for the cluster point predicate. (Contributed by Mario Carneiro, 11-Apr-2015.) (Revised by Stefan O'Rear, 8-Aug-2015.)

Hypothesis

Ref	Expression
fclsval.x	⊢ 𝑋 = ∪ 𝐽

Assertion

Ref	Expression
fclsfil	⊢ (𝐴 ∈ (𝐽 fClus 𝐹) → 𝐹 ∈ (Fil‘𝑋))

Proof of Theorem fclsfil

Dummy variable 𝑠 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		fclsval.x	. . 3 ⊢ 𝑋 = ∪ 𝐽
2	1	isfcls 24056	. 2 ⊢ (𝐴 ∈ (𝐽 fClus 𝐹) ↔ (𝐽 ∈ Top ∧ 𝐹 ∈ (Fil‘𝑋) ∧ ∀𝑠 ∈ 𝐹 𝐴 ∈ ((cls‘𝐽)‘𝑠)))
3	2	simp2bi 1158	1 ⊢ (𝐴 ∈ (𝐽 fClus 𝐹) → 𝐹 ∈ (Fil‘𝑋))

Syntax hints:   → wi 4   = wceq 1559   ∈ wcel 2141  ∀wral 3075  ∪ cuni 4862  ‘cfv 6515  (class class class)co 7390  Topctop 22940  clsccl 23065  Filcfil 23892   fClus cfcls 23983

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-sep 5243  ax-nul 5253  ax-pow 5319  ax-pr 5387

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-nf 1803  df-sb 2090  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-nel 3061  df-ral 3076  df-rex 3086  df-rab 3414  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4284  df-if 4478  df-pw 4554  df-sn 4580  df-pr 4582  df-op 4586  df-uni 4863  df-int 4903  df-iin 4949  df-br 5098  df-opab 5160  df-mpt 5179  df-id 5538  df-xp 5649  df-rel 5650  df-cnv 5651  df-co 5652  df-dm 5653  df-rn 5654  df-res 5655  df-ima 5656  df-iota 6471  df-fun 6517  df-fn 6518  df-fv 6523  df-ov 7393  df-oprab 7394  df-mpo 7395  df-fbas 21408  df-fil 23893  df-fcls 23988

This theorem is referenced by:  fclstopon  24059  fclsopni  24062  fclselbas  24063  fclsfnflim  24074  cnpfcfi  24087