Theorem fclsfil 24309

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 24308	. 2 ⊢ (𝐴 ∈ (𝐽 fClus 𝐹) ↔ (𝐽 ∈ Top ∧ 𝐹 ∈ (Fil‘𝑋) ∧ ∀𝑠 ∈ 𝐹 𝐴 ∈ ((cls‘𝐽)‘𝑠)))
3	2	simp2bi 1164	1 ⊢ (𝐴 ∈ (𝐽 fClus 𝐹) → 𝐹 ∈ (Fil‘𝑋))

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2145  ∀wral 3077  ∪ cuni 4867  ‘cfv 6531  (class class class)co 7412  Topctop 23191  clsccl 23316  Filcfil 24144   fClus cfcls 24235

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-nel 3063  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-int 4908  df-iin 4954  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6487  df-fun 6533  df-fn 6534  df-fv 6539  df-ov 7415  df-oprab 7416  df-mpo 7417  df-fbas 21655  df-fil 24145  df-fcls 24240

This theorem is used by:  fclstopon  24311  fclsopni  24314  fclselbas  24315  fclsfnflim  24326  cnpfcfi  24339