MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  fclsfnflim Structured version   Visualization version   GIF version

Theorem fclsfnflim 22632
Description: A filter clusters at a point iff a finer filter converges to it. (Contributed by Jeff Hankins, 12-Nov-2009.) (Revised by Mario Carneiro, 26-Aug-2015.)
Assertion
Ref Expression
fclsfnflim (𝐹 ∈ (Fil‘𝑋) → (𝐴 ∈ (𝐽 fClus 𝐹) ↔ ∃𝑔 ∈ (Fil‘𝑋)(𝐹𝑔𝐴 ∈ (𝐽 fLim 𝑔))))
Distinct variable groups:   𝐴,𝑔   𝑔,𝐹   𝑔,𝐽   𝑔,𝑋

Proof of Theorem fclsfnflim
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 filsspw 22456 . . . . . . . 8 (𝐹 ∈ (Fil‘𝑋) → 𝐹 ⊆ 𝒫 𝑋)
21adantr 484 . . . . . . 7 ((𝐹 ∈ (Fil‘𝑋) ∧ 𝐴 ∈ (𝐽 fClus 𝐹)) → 𝐹 ⊆ 𝒫 𝑋)
3 fclstop 22616 . . . . . . . . . 10 (𝐴 ∈ (𝐽 fClus 𝐹) → 𝐽 ∈ Top)
43adantl 485 . . . . . . . . 9 ((𝐹 ∈ (Fil‘𝑋) ∧ 𝐴 ∈ (𝐽 fClus 𝐹)) → 𝐽 ∈ Top)
5 eqid 2798 . . . . . . . . . 10 𝐽 = 𝐽
65neisspw 21712 . . . . . . . . 9 (𝐽 ∈ Top → ((nei‘𝐽)‘{𝐴}) ⊆ 𝒫 𝐽)
74, 6syl 17 . . . . . . . 8 ((𝐹 ∈ (Fil‘𝑋) ∧ 𝐴 ∈ (𝐽 fClus 𝐹)) → ((nei‘𝐽)‘{𝐴}) ⊆ 𝒫 𝐽)
8 filunibas 22486 . . . . . . . . . 10 (𝐹 ∈ (Fil‘𝑋) → 𝐹 = 𝑋)
95fclsfil 22615 . . . . . . . . . . 11 (𝐴 ∈ (𝐽 fClus 𝐹) → 𝐹 ∈ (Fil‘ 𝐽))
10 filunibas 22486 . . . . . . . . . . 11 (𝐹 ∈ (Fil‘ 𝐽) → 𝐹 = 𝐽)
119, 10syl 17 . . . . . . . . . 10 (𝐴 ∈ (𝐽 fClus 𝐹) → 𝐹 = 𝐽)
128, 11sylan9req 2854 . . . . . . . . 9 ((𝐹 ∈ (Fil‘𝑋) ∧ 𝐴 ∈ (𝐽 fClus 𝐹)) → 𝑋 = 𝐽)
1312pweqd 4516 . . . . . . . 8 ((𝐹 ∈ (Fil‘𝑋) ∧ 𝐴 ∈ (𝐽 fClus 𝐹)) → 𝒫 𝑋 = 𝒫 𝐽)
147, 13sseqtrrd 3956 . . . . . . 7 ((𝐹 ∈ (Fil‘𝑋) ∧ 𝐴 ∈ (𝐽 fClus 𝐹)) → ((nei‘𝐽)‘{𝐴}) ⊆ 𝒫 𝑋)
152, 14unssd 4113 . . . . . 6 ((𝐹 ∈ (Fil‘𝑋) ∧ 𝐴 ∈ (𝐽 fClus 𝐹)) → (𝐹 ∪ ((nei‘𝐽)‘{𝐴})) ⊆ 𝒫 𝑋)
16 ssun1 4099 . . . . . . . 8 𝐹 ⊆ (𝐹 ∪ ((nei‘𝐽)‘{𝐴}))
17 filn0 22467 . . . . . . . 8 (𝐹 ∈ (Fil‘𝑋) → 𝐹 ≠ ∅)
18 ssn0 4308 . . . . . . . 8 ((𝐹 ⊆ (𝐹 ∪ ((nei‘𝐽)‘{𝐴})) ∧ 𝐹 ≠ ∅) → (𝐹 ∪ ((nei‘𝐽)‘{𝐴})) ≠ ∅)
1916, 17, 18sylancr 590 . . . . . . 7 (𝐹 ∈ (Fil‘𝑋) → (𝐹 ∪ ((nei‘𝐽)‘{𝐴})) ≠ ∅)
2019adantr 484 . . . . . 6 ((𝐹 ∈ (Fil‘𝑋) ∧ 𝐴 ∈ (𝐽 fClus 𝐹)) → (𝐹 ∪ ((nei‘𝐽)‘{𝐴})) ≠ ∅)
21 incom 4128 . . . . . . . . . . . 12 (𝑦𝑥) = (𝑥𝑦)
22 fclsneii 22622 . . . . . . . . . . . 12 ((𝐴 ∈ (𝐽 fClus 𝐹) ∧ 𝑦 ∈ ((nei‘𝐽)‘{𝐴}) ∧ 𝑥𝐹) → (𝑦𝑥) ≠ ∅)
2321, 22eqnetrrid 3062 . . . . . . . . . . 11 ((𝐴 ∈ (𝐽 fClus 𝐹) ∧ 𝑦 ∈ ((nei‘𝐽)‘{𝐴}) ∧ 𝑥𝐹) → (𝑥𝑦) ≠ ∅)
24233com23 1123 . . . . . . . . . 10 ((𝐴 ∈ (𝐽 fClus 𝐹) ∧ 𝑥𝐹𝑦 ∈ ((nei‘𝐽)‘{𝐴})) → (𝑥𝑦) ≠ ∅)
25243expb 1117 . . . . . . . . 9 ((𝐴 ∈ (𝐽 fClus 𝐹) ∧ (𝑥𝐹𝑦 ∈ ((nei‘𝐽)‘{𝐴}))) → (𝑥𝑦) ≠ ∅)
2625adantll 713 . . . . . . . 8 (((𝐹 ∈ (Fil‘𝑋) ∧ 𝐴 ∈ (𝐽 fClus 𝐹)) ∧ (𝑥𝐹𝑦 ∈ ((nei‘𝐽)‘{𝐴}))) → (𝑥𝑦) ≠ ∅)
2726ralrimivva 3156 . . . . . . 7 ((𝐹 ∈ (Fil‘𝑋) ∧ 𝐴 ∈ (𝐽 fClus 𝐹)) → ∀𝑥𝐹𝑦 ∈ ((nei‘𝐽)‘{𝐴})(𝑥𝑦) ≠ ∅)
28 filfbas 22453 . . . . . . . . 9 (𝐹 ∈ (Fil‘𝑋) → 𝐹 ∈ (fBas‘𝑋))
2928adantr 484 . . . . . . . 8 ((𝐹 ∈ (Fil‘𝑋) ∧ 𝐴 ∈ (𝐽 fClus 𝐹)) → 𝐹 ∈ (fBas‘𝑋))
30 istopon 21517 . . . . . . . . . . 11 (𝐽 ∈ (TopOn‘𝑋) ↔ (𝐽 ∈ Top ∧ 𝑋 = 𝐽))
314, 12, 30sylanbrc 586 . . . . . . . . . 10 ((𝐹 ∈ (Fil‘𝑋) ∧ 𝐴 ∈ (𝐽 fClus 𝐹)) → 𝐽 ∈ (TopOn‘𝑋))
325fclselbas 22621 . . . . . . . . . . . . 13 (𝐴 ∈ (𝐽 fClus 𝐹) → 𝐴 𝐽)
3332adantl 485 . . . . . . . . . . . 12 ((𝐹 ∈ (Fil‘𝑋) ∧ 𝐴 ∈ (𝐽 fClus 𝐹)) → 𝐴 𝐽)
3433, 12eleqtrrd 2893 . . . . . . . . . . 11 ((𝐹 ∈ (Fil‘𝑋) ∧ 𝐴 ∈ (𝐽 fClus 𝐹)) → 𝐴𝑋)
3534snssd 4702 . . . . . . . . . 10 ((𝐹 ∈ (Fil‘𝑋) ∧ 𝐴 ∈ (𝐽 fClus 𝐹)) → {𝐴} ⊆ 𝑋)
36 snnzg 4670 . . . . . . . . . . 11 (𝐴 ∈ (𝐽 fClus 𝐹) → {𝐴} ≠ ∅)
3736adantl 485 . . . . . . . . . 10 ((𝐹 ∈ (Fil‘𝑋) ∧ 𝐴 ∈ (𝐽 fClus 𝐹)) → {𝐴} ≠ ∅)
38 neifil 22485 . . . . . . . . . 10 ((𝐽 ∈ (TopOn‘𝑋) ∧ {𝐴} ⊆ 𝑋 ∧ {𝐴} ≠ ∅) → ((nei‘𝐽)‘{𝐴}) ∈ (Fil‘𝑋))
3931, 35, 37, 38syl3anc 1368 . . . . . . . . 9 ((𝐹 ∈ (Fil‘𝑋) ∧ 𝐴 ∈ (𝐽 fClus 𝐹)) → ((nei‘𝐽)‘{𝐴}) ∈ (Fil‘𝑋))
40 filfbas 22453 . . . . . . . . 9 (((nei‘𝐽)‘{𝐴}) ∈ (Fil‘𝑋) → ((nei‘𝐽)‘{𝐴}) ∈ (fBas‘𝑋))
4139, 40syl 17 . . . . . . . 8 ((𝐹 ∈ (Fil‘𝑋) ∧ 𝐴 ∈ (𝐽 fClus 𝐹)) → ((nei‘𝐽)‘{𝐴}) ∈ (fBas‘𝑋))
42 fbunfip 22474 . . . . . . . 8 ((𝐹 ∈ (fBas‘𝑋) ∧ ((nei‘𝐽)‘{𝐴}) ∈ (fBas‘𝑋)) → (¬ ∅ ∈ (fi‘(𝐹 ∪ ((nei‘𝐽)‘{𝐴}))) ↔ ∀𝑥𝐹𝑦 ∈ ((nei‘𝐽)‘{𝐴})(𝑥𝑦) ≠ ∅))
4329, 41, 42syl2anc 587 . . . . . . 7 ((𝐹 ∈ (Fil‘𝑋) ∧ 𝐴 ∈ (𝐽 fClus 𝐹)) → (¬ ∅ ∈ (fi‘(𝐹 ∪ ((nei‘𝐽)‘{𝐴}))) ↔ ∀𝑥𝐹𝑦 ∈ ((nei‘𝐽)‘{𝐴})(𝑥𝑦) ≠ ∅))
4427, 43mpbird 260 . . . . . 6 ((𝐹 ∈ (Fil‘𝑋) ∧ 𝐴 ∈ (𝐽 fClus 𝐹)) → ¬ ∅ ∈ (fi‘(𝐹 ∪ ((nei‘𝐽)‘{𝐴}))))
45 filtop 22460 . . . . . . . 8 (𝐹 ∈ (Fil‘𝑋) → 𝑋𝐹)
46 fsubbas 22472 . . . . . . . 8 (𝑋𝐹 → ((fi‘(𝐹 ∪ ((nei‘𝐽)‘{𝐴}))) ∈ (fBas‘𝑋) ↔ ((𝐹 ∪ ((nei‘𝐽)‘{𝐴})) ⊆ 𝒫 𝑋 ∧ (𝐹 ∪ ((nei‘𝐽)‘{𝐴})) ≠ ∅ ∧ ¬ ∅ ∈ (fi‘(𝐹 ∪ ((nei‘𝐽)‘{𝐴}))))))
4745, 46syl 17 . . . . . . 7 (𝐹 ∈ (Fil‘𝑋) → ((fi‘(𝐹 ∪ ((nei‘𝐽)‘{𝐴}))) ∈ (fBas‘𝑋) ↔ ((𝐹 ∪ ((nei‘𝐽)‘{𝐴})) ⊆ 𝒫 𝑋 ∧ (𝐹 ∪ ((nei‘𝐽)‘{𝐴})) ≠ ∅ ∧ ¬ ∅ ∈ (fi‘(𝐹 ∪ ((nei‘𝐽)‘{𝐴}))))))
4847adantr 484 . . . . . 6 ((𝐹 ∈ (Fil‘𝑋) ∧ 𝐴 ∈ (𝐽 fClus 𝐹)) → ((fi‘(𝐹 ∪ ((nei‘𝐽)‘{𝐴}))) ∈ (fBas‘𝑋) ↔ ((𝐹 ∪ ((nei‘𝐽)‘{𝐴})) ⊆ 𝒫 𝑋 ∧ (𝐹 ∪ ((nei‘𝐽)‘{𝐴})) ≠ ∅ ∧ ¬ ∅ ∈ (fi‘(𝐹 ∪ ((nei‘𝐽)‘{𝐴}))))))
4915, 20, 44, 48mpbir3and 1339 . . . . 5 ((𝐹 ∈ (Fil‘𝑋) ∧ 𝐴 ∈ (𝐽 fClus 𝐹)) → (fi‘(𝐹 ∪ ((nei‘𝐽)‘{𝐴}))) ∈ (fBas‘𝑋))
50 fgcl 22483 . . . . 5 ((fi‘(𝐹 ∪ ((nei‘𝐽)‘{𝐴}))) ∈ (fBas‘𝑋) → (𝑋filGen(fi‘(𝐹 ∪ ((nei‘𝐽)‘{𝐴})))) ∈ (Fil‘𝑋))
5149, 50syl 17 . . . 4 ((𝐹 ∈ (Fil‘𝑋) ∧ 𝐴 ∈ (𝐽 fClus 𝐹)) → (𝑋filGen(fi‘(𝐹 ∪ ((nei‘𝐽)‘{𝐴})))) ∈ (Fil‘𝑋))
52 fvex 6658 . . . . . . . . 9 ((nei‘𝐽)‘{𝐴}) ∈ V
53 unexg 7452 . . . . . . . . 9 ((𝐹 ∈ (Fil‘𝑋) ∧ ((nei‘𝐽)‘{𝐴}) ∈ V) → (𝐹 ∪ ((nei‘𝐽)‘{𝐴})) ∈ V)
5452, 53mpan2 690 . . . . . . . 8 (𝐹 ∈ (Fil‘𝑋) → (𝐹 ∪ ((nei‘𝐽)‘{𝐴})) ∈ V)
55 ssfii 8867 . . . . . . . 8 ((𝐹 ∪ ((nei‘𝐽)‘{𝐴})) ∈ V → (𝐹 ∪ ((nei‘𝐽)‘{𝐴})) ⊆ (fi‘(𝐹 ∪ ((nei‘𝐽)‘{𝐴}))))
5654, 55syl 17 . . . . . . 7 (𝐹 ∈ (Fil‘𝑋) → (𝐹 ∪ ((nei‘𝐽)‘{𝐴})) ⊆ (fi‘(𝐹 ∪ ((nei‘𝐽)‘{𝐴}))))
5756adantr 484 . . . . . 6 ((𝐹 ∈ (Fil‘𝑋) ∧ 𝐴 ∈ (𝐽 fClus 𝐹)) → (𝐹 ∪ ((nei‘𝐽)‘{𝐴})) ⊆ (fi‘(𝐹 ∪ ((nei‘𝐽)‘{𝐴}))))
5857unssad 4114 . . . . 5 ((𝐹 ∈ (Fil‘𝑋) ∧ 𝐴 ∈ (𝐽 fClus 𝐹)) → 𝐹 ⊆ (fi‘(𝐹 ∪ ((nei‘𝐽)‘{𝐴}))))
59 ssfg 22477 . . . . . 6 ((fi‘(𝐹 ∪ ((nei‘𝐽)‘{𝐴}))) ∈ (fBas‘𝑋) → (fi‘(𝐹 ∪ ((nei‘𝐽)‘{𝐴}))) ⊆ (𝑋filGen(fi‘(𝐹 ∪ ((nei‘𝐽)‘{𝐴})))))
6049, 59syl 17 . . . . 5 ((𝐹 ∈ (Fil‘𝑋) ∧ 𝐴 ∈ (𝐽 fClus 𝐹)) → (fi‘(𝐹 ∪ ((nei‘𝐽)‘{𝐴}))) ⊆ (𝑋filGen(fi‘(𝐹 ∪ ((nei‘𝐽)‘{𝐴})))))
6158, 60sstrd 3925 . . . 4 ((𝐹 ∈ (Fil‘𝑋) ∧ 𝐴 ∈ (𝐽 fClus 𝐹)) → 𝐹 ⊆ (𝑋filGen(fi‘(𝐹 ∪ ((nei‘𝐽)‘{𝐴})))))
6257unssbd 4115 . . . . . 6 ((𝐹 ∈ (Fil‘𝑋) ∧ 𝐴 ∈ (𝐽 fClus 𝐹)) → ((nei‘𝐽)‘{𝐴}) ⊆ (fi‘(𝐹 ∪ ((nei‘𝐽)‘{𝐴}))))
6362, 60sstrd 3925 . . . . 5 ((𝐹 ∈ (Fil‘𝑋) ∧ 𝐴 ∈ (𝐽 fClus 𝐹)) → ((nei‘𝐽)‘{𝐴}) ⊆ (𝑋filGen(fi‘(𝐹 ∪ ((nei‘𝐽)‘{𝐴})))))
64 elflim 22576 . . . . . 6 ((𝐽 ∈ (TopOn‘𝑋) ∧ (𝑋filGen(fi‘(𝐹 ∪ ((nei‘𝐽)‘{𝐴})))) ∈ (Fil‘𝑋)) → (𝐴 ∈ (𝐽 fLim (𝑋filGen(fi‘(𝐹 ∪ ((nei‘𝐽)‘{𝐴}))))) ↔ (𝐴𝑋 ∧ ((nei‘𝐽)‘{𝐴}) ⊆ (𝑋filGen(fi‘(𝐹 ∪ ((nei‘𝐽)‘{𝐴})))))))
6531, 51, 64syl2anc 587 . . . . 5 ((𝐹 ∈ (Fil‘𝑋) ∧ 𝐴 ∈ (𝐽 fClus 𝐹)) → (𝐴 ∈ (𝐽 fLim (𝑋filGen(fi‘(𝐹 ∪ ((nei‘𝐽)‘{𝐴}))))) ↔ (𝐴𝑋 ∧ ((nei‘𝐽)‘{𝐴}) ⊆ (𝑋filGen(fi‘(𝐹 ∪ ((nei‘𝐽)‘{𝐴})))))))
6634, 63, 65mpbir2and 712 . . . 4 ((𝐹 ∈ (Fil‘𝑋) ∧ 𝐴 ∈ (𝐽 fClus 𝐹)) → 𝐴 ∈ (𝐽 fLim (𝑋filGen(fi‘(𝐹 ∪ ((nei‘𝐽)‘{𝐴}))))))
67 sseq2 3941 . . . . . 6 (𝑔 = (𝑋filGen(fi‘(𝐹 ∪ ((nei‘𝐽)‘{𝐴})))) → (𝐹𝑔𝐹 ⊆ (𝑋filGen(fi‘(𝐹 ∪ ((nei‘𝐽)‘{𝐴}))))))
68 oveq2 7143 . . . . . . 7 (𝑔 = (𝑋filGen(fi‘(𝐹 ∪ ((nei‘𝐽)‘{𝐴})))) → (𝐽 fLim 𝑔) = (𝐽 fLim (𝑋filGen(fi‘(𝐹 ∪ ((nei‘𝐽)‘{𝐴}))))))
6968eleq2d 2875 . . . . . 6 (𝑔 = (𝑋filGen(fi‘(𝐹 ∪ ((nei‘𝐽)‘{𝐴})))) → (𝐴 ∈ (𝐽 fLim 𝑔) ↔ 𝐴 ∈ (𝐽 fLim (𝑋filGen(fi‘(𝐹 ∪ ((nei‘𝐽)‘{𝐴})))))))
7067, 69anbi12d 633 . . . . 5 (𝑔 = (𝑋filGen(fi‘(𝐹 ∪ ((nei‘𝐽)‘{𝐴})))) → ((𝐹𝑔𝐴 ∈ (𝐽 fLim 𝑔)) ↔ (𝐹 ⊆ (𝑋filGen(fi‘(𝐹 ∪ ((nei‘𝐽)‘{𝐴})))) ∧ 𝐴 ∈ (𝐽 fLim (𝑋filGen(fi‘(𝐹 ∪ ((nei‘𝐽)‘{𝐴}))))))))
7170rspcev 3571 . . . 4 (((𝑋filGen(fi‘(𝐹 ∪ ((nei‘𝐽)‘{𝐴})))) ∈ (Fil‘𝑋) ∧ (𝐹 ⊆ (𝑋filGen(fi‘(𝐹 ∪ ((nei‘𝐽)‘{𝐴})))) ∧ 𝐴 ∈ (𝐽 fLim (𝑋filGen(fi‘(𝐹 ∪ ((nei‘𝐽)‘{𝐴}))))))) → ∃𝑔 ∈ (Fil‘𝑋)(𝐹𝑔𝐴 ∈ (𝐽 fLim 𝑔)))
7251, 61, 66, 71syl12anc 835 . . 3 ((𝐹 ∈ (Fil‘𝑋) ∧ 𝐴 ∈ (𝐽 fClus 𝐹)) → ∃𝑔 ∈ (Fil‘𝑋)(𝐹𝑔𝐴 ∈ (𝐽 fLim 𝑔)))
7372ex 416 . 2 (𝐹 ∈ (Fil‘𝑋) → (𝐴 ∈ (𝐽 fClus 𝐹) → ∃𝑔 ∈ (Fil‘𝑋)(𝐹𝑔𝐴 ∈ (𝐽 fLim 𝑔))))
74 simprl 770 . . . . . 6 ((𝐹 ∈ (Fil‘𝑋) ∧ (𝑔 ∈ (Fil‘𝑋) ∧ (𝐹𝑔𝐴 ∈ (𝐽 fLim 𝑔)))) → 𝑔 ∈ (Fil‘𝑋))
75 simprrr 781 . . . . . . 7 ((𝐹 ∈ (Fil‘𝑋) ∧ (𝑔 ∈ (Fil‘𝑋) ∧ (𝐹𝑔𝐴 ∈ (𝐽 fLim 𝑔)))) → 𝐴 ∈ (𝐽 fLim 𝑔))
76 flimtopon 22575 . . . . . . 7 (𝐴 ∈ (𝐽 fLim 𝑔) → (𝐽 ∈ (TopOn‘𝑋) ↔ 𝑔 ∈ (Fil‘𝑋)))
7775, 76syl 17 . . . . . 6 ((𝐹 ∈ (Fil‘𝑋) ∧ (𝑔 ∈ (Fil‘𝑋) ∧ (𝐹𝑔𝐴 ∈ (𝐽 fLim 𝑔)))) → (𝐽 ∈ (TopOn‘𝑋) ↔ 𝑔 ∈ (Fil‘𝑋)))
7874, 77mpbird 260 . . . . 5 ((𝐹 ∈ (Fil‘𝑋) ∧ (𝑔 ∈ (Fil‘𝑋) ∧ (𝐹𝑔𝐴 ∈ (𝐽 fLim 𝑔)))) → 𝐽 ∈ (TopOn‘𝑋))
79 simpl 486 . . . . 5 ((𝐹 ∈ (Fil‘𝑋) ∧ (𝑔 ∈ (Fil‘𝑋) ∧ (𝐹𝑔𝐴 ∈ (𝐽 fLim 𝑔)))) → 𝐹 ∈ (Fil‘𝑋))
80 simprrl 780 . . . . 5 ((𝐹 ∈ (Fil‘𝑋) ∧ (𝑔 ∈ (Fil‘𝑋) ∧ (𝐹𝑔𝐴 ∈ (𝐽 fLim 𝑔)))) → 𝐹𝑔)
81 fclsss2 22628 . . . . 5 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐹𝑔) → (𝐽 fClus 𝑔) ⊆ (𝐽 fClus 𝐹))
8278, 79, 80, 81syl3anc 1368 . . . 4 ((𝐹 ∈ (Fil‘𝑋) ∧ (𝑔 ∈ (Fil‘𝑋) ∧ (𝐹𝑔𝐴 ∈ (𝐽 fLim 𝑔)))) → (𝐽 fClus 𝑔) ⊆ (𝐽 fClus 𝐹))
83 flimfcls 22631 . . . . 5 (𝐽 fLim 𝑔) ⊆ (𝐽 fClus 𝑔)
8483, 75sseldi 3913 . . . 4 ((𝐹 ∈ (Fil‘𝑋) ∧ (𝑔 ∈ (Fil‘𝑋) ∧ (𝐹𝑔𝐴 ∈ (𝐽 fLim 𝑔)))) → 𝐴 ∈ (𝐽 fClus 𝑔))
8582, 84sseldd 3916 . . 3 ((𝐹 ∈ (Fil‘𝑋) ∧ (𝑔 ∈ (Fil‘𝑋) ∧ (𝐹𝑔𝐴 ∈ (𝐽 fLim 𝑔)))) → 𝐴 ∈ (𝐽 fClus 𝐹))
8685rexlimdvaa 3244 . 2 (𝐹 ∈ (Fil‘𝑋) → (∃𝑔 ∈ (Fil‘𝑋)(𝐹𝑔𝐴 ∈ (𝐽 fLim 𝑔)) → 𝐴 ∈ (𝐽 fClus 𝐹)))
8773, 86impbid 215 1 (𝐹 ∈ (Fil‘𝑋) → (𝐴 ∈ (𝐽 fClus 𝐹) ↔ ∃𝑔 ∈ (Fil‘𝑋)(𝐹𝑔𝐴 ∈ (𝐽 fLim 𝑔))))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 209  wa 399  w3a 1084   = wceq 1538  wcel 2111  wne 2987  wral 3106  wrex 3107  Vcvv 3441  cun 3879  cin 3880  wss 3881  c0 4243  𝒫 cpw 4497  {csn 4525   cuni 4800  cfv 6324  (class class class)co 7135  ficfi 8858  fBascfbas 20079  filGencfg 20080  Topctop 21498  TopOnctopon 21515  neicnei 21702  Filcfil 22450   fLim cflim 22539   fClus cfcls 22541
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-rep 5154  ax-sep 5167  ax-nul 5174  ax-pow 5231  ax-pr 5295  ax-un 7441
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3or 1085  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-nel 3092  df-ral 3111  df-rex 3112  df-reu 3113  df-rab 3115  df-v 3443  df-sbc 3721  df-csb 3829  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-pss 3900  df-nul 4244  df-if 4426  df-pw 4499  df-sn 4526  df-pr 4528  df-tp 4530  df-op 4532  df-uni 4801  df-int 4839  df-iun 4883  df-iin 4884  df-br 5031  df-opab 5093  df-mpt 5111  df-tr 5137  df-id 5425  df-eprel 5430  df-po 5438  df-so 5439  df-fr 5478  df-we 5480  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-rn 5530  df-res 5531  df-ima 5532  df-pred 6116  df-ord 6162  df-on 6163  df-lim 6164  df-suc 6165  df-iota 6283  df-fun 6326  df-fn 6327  df-f 6328  df-f1 6329  df-fo 6330  df-f1o 6331  df-fv 6332  df-ov 7138  df-oprab 7139  df-mpo 7140  df-om 7561  df-wrecs 7930  df-recs 7991  df-rdg 8029  df-1o 8085  df-oadd 8089  df-er 8272  df-en 8493  df-fin 8496  df-fi 8859  df-fbas 20088  df-fg 20089  df-top 21499  df-topon 21516  df-cld 21624  df-ntr 21625  df-cls 21626  df-nei 21703  df-fil 22451  df-flim 22544  df-fcls 22546
This theorem is referenced by:  uffclsflim  22636  cnpfcfi  22645
  Copyright terms: Public domain W3C validator