Theorem flimclsi 24290

Description: The convergent points of a filter are a subset of the closure of any of the filter sets. (Contributed by Mario Carneiro, 9-Apr-2015.) (Revised by Stefan O'Rear, 9-Aug-2015.)

Assertion

Ref	Expression
flimclsi	⊢ (𝑆 ∈ 𝐹 → (𝐽 fLim 𝐹) ⊆ ((cls‘𝐽)‘𝑆))

Proof of Theorem flimclsi

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqid 2761	. . . . . . . 8 ⊢ ∪ 𝐽 = ∪ 𝐽
2	1	flimfil 24281	. . . . . . 7 ⊢ (𝑥 ∈ (𝐽 fLim 𝐹) → 𝐹 ∈ (Fil‘∪ 𝐽))
3	2	ad2antlr 740	. . . . . 6 ⊢ (((𝑆 ∈ 𝐹 ∧ 𝑥 ∈ (𝐽 fLim 𝐹)) ∧ 𝑦 ∈ ((nei‘𝐽)‘{𝑥})) → 𝐹 ∈ (Fil‘∪ 𝐽))
4		flimnei 24279	. . . . . . 7 ⊢ ((𝑥 ∈ (𝐽 fLim 𝐹) ∧ 𝑦 ∈ ((nei‘𝐽)‘{𝑥})) → 𝑦 ∈ 𝐹)
5	4	adantll 727	. . . . . 6 ⊢ (((𝑆 ∈ 𝐹 ∧ 𝑥 ∈ (𝐽 fLim 𝐹)) ∧ 𝑦 ∈ ((nei‘𝐽)‘{𝑥})) → 𝑦 ∈ 𝐹)
6		simpll 779	. . . . . 6 ⊢ (((𝑆 ∈ 𝐹 ∧ 𝑥 ∈ (𝐽 fLim 𝐹)) ∧ 𝑦 ∈ ((nei‘𝐽)‘{𝑥})) → 𝑆 ∈ 𝐹)
7		filinn0 24172	. . . . . 6 ⊢ ((𝐹 ∈ (Fil‘∪ 𝐽) ∧ 𝑦 ∈ 𝐹 ∧ 𝑆 ∈ 𝐹) → (𝑦 ∩ 𝑆) ≠ ∅)
8	3, 5, 6, 7	syl3anc 1398	. . . . 5 ⊢ (((𝑆 ∈ 𝐹 ∧ 𝑥 ∈ (𝐽 fLim 𝐹)) ∧ 𝑦 ∈ ((nei‘𝐽)‘{𝑥})) → (𝑦 ∩ 𝑆) ≠ ∅)
9	8	ralrimiva 3155	. . . 4 ⊢ ((𝑆 ∈ 𝐹 ∧ 𝑥 ∈ (𝐽 fLim 𝐹)) → ∀𝑦 ∈ ((nei‘𝐽)‘{𝑥})(𝑦 ∩ 𝑆) ≠ ∅)
10		flimtop 24277	. . . . . 6 ⊢ (𝑥 ∈ (𝐽 fLim 𝐹) → 𝐽 ∈ Top)
11	10	adantl 487	. . . . 5 ⊢ ((𝑆 ∈ 𝐹 ∧ 𝑥 ∈ (𝐽 fLim 𝐹)) → 𝐽 ∈ Top)
12		filelss 24164	. . . . . . 7 ⊢ ((𝐹 ∈ (Fil‘∪ 𝐽) ∧ 𝑆 ∈ 𝐹) → 𝑆 ⊆ ∪ 𝐽)
13	12	ancoms 464	. . . . . 6 ⊢ ((𝑆 ∈ 𝐹 ∧ 𝐹 ∈ (Fil‘∪ 𝐽)) → 𝑆 ⊆ ∪ 𝐽)
14	2, 13	sylan2 605	. . . . 5 ⊢ ((𝑆 ∈ 𝐹 ∧ 𝑥 ∈ (𝐽 fLim 𝐹)) → 𝑆 ⊆ ∪ 𝐽)
15	1	flimelbas 24280	. . . . . 6 ⊢ (𝑥 ∈ (𝐽 fLim 𝐹) → 𝑥 ∈ ∪ 𝐽)
16	15	adantl 487	. . . . 5 ⊢ ((𝑆 ∈ 𝐹 ∧ 𝑥 ∈ (𝐽 fLim 𝐹)) → 𝑥 ∈ ∪ 𝐽)
17	1	neindisj2 23434	. . . . 5 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ ∪ 𝐽 ∧ 𝑥 ∈ ∪ 𝐽) → (𝑥 ∈ ((cls‘𝐽)‘𝑆) ↔ ∀𝑦 ∈ ((nei‘𝐽)‘{𝑥})(𝑦 ∩ 𝑆) ≠ ∅))
18	11, 14, 16, 17	syl3anc 1398	. . . 4 ⊢ ((𝑆 ∈ 𝐹 ∧ 𝑥 ∈ (𝐽 fLim 𝐹)) → (𝑥 ∈ ((cls‘𝐽)‘𝑆) ↔ ∀𝑦 ∈ ((nei‘𝐽)‘{𝑥})(𝑦 ∩ 𝑆) ≠ ∅))
19	9, 18	mpbird 260	. . 3 ⊢ ((𝑆 ∈ 𝐹 ∧ 𝑥 ∈ (𝐽 fLim 𝐹)) → 𝑥 ∈ ((cls‘𝐽)‘𝑆))
20	19	ex 418	. 2 ⊢ (𝑆 ∈ 𝐹 → (𝑥 ∈ (𝐽 fLim 𝐹) → 𝑥 ∈ ((cls‘𝐽)‘𝑆)))
21	20	ssrdv 3937	1 ⊢ (𝑆 ∈ 𝐹 → (𝐽 fLim 𝐹) ⊆ ((cls‘𝐽)‘𝑆))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∈ wcel 2145   ≠ wne 2956  ∀wral 3077   ∩ cin 3898   ⊆ wss 3899  ∅c0 4279  {csn 4584  ∪ cuni 4867  ‘cfv 6537  (class class class)co 7418  Topctop 23204  clsccl 23329  neicnei 23408  Filcfil 24157   fLim cflim 24246

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-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7749

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-reu 3367  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-iun 4953  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 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-ov 7421  df-oprab 7422  df-mpo 7423  df-fbas 21668  df-top 23205  df-cld 23330  df-ntr 23331  df-cls 23332  df-nei 23409  df-fil 24158  df-flim 24251

This theorem is used by:  flimcls  24297  flimfcls  24338  cnextcn  24379  cmetss  25630  minveclem4  25746