Theorem flimopn 24287

Description: The condition for being a limit point of a filter still holds if one only considers open neighborhoods. (Contributed by Jeff Hankins, 4-Sep-2009.) (Proof shortened by Mario Carneiro, 9-Apr-2015.)

Assertion

Ref	Expression
flimopn	⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → (𝐴 ∈ (𝐽 fLim 𝐹) ↔ (𝐴 ∈ 𝑋 ∧ ∀𝑥 ∈ 𝐽 (𝐴 ∈ 𝑥 → 𝑥 ∈ 𝐹))))

Distinct variable groups:   𝑥,𝐴   𝑥,𝐹   𝑥,𝐽   𝑥,𝑋

Proof of Theorem flimopn

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		elflim 24283	. 2 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → (𝐴 ∈ (𝐽 fLim 𝐹) ↔ (𝐴 ∈ 𝑋 ∧ ((nei‘𝐽)‘{𝐴}) ⊆ 𝐹)))
2		dfss3 3920	. . . 4 ⊢ (((nei‘𝐽)‘{𝐴}) ⊆ 𝐹 ↔ ∀𝑦 ∈ ((nei‘𝐽)‘{𝐴})𝑦 ∈ 𝐹)
3		topontop 23224	. . . . . . . . . . 11 ⊢ (𝐽 ∈ (TopOn‘𝑋) → 𝐽 ∈ Top)
4	3	ad2antrr 739	. . . . . . . . . 10 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝐴 ∈ 𝑋) → 𝐽 ∈ Top)
5		opnneip 23430	. . . . . . . . . . 11 ⊢ ((𝐽 ∈ Top ∧ 𝑥 ∈ 𝐽 ∧ 𝐴 ∈ 𝑥) → 𝑥 ∈ ((nei‘𝐽)‘{𝐴}))
6	5	3expb 1138	. . . . . . . . . 10 ⊢ ((𝐽 ∈ Top ∧ (𝑥 ∈ 𝐽 ∧ 𝐴 ∈ 𝑥)) → 𝑥 ∈ ((nei‘𝐽)‘{𝐴}))
7	4, 6	sylan 592	. . . . . . . . 9 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝐴 ∈ 𝑋) ∧ (𝑥 ∈ 𝐽 ∧ 𝐴 ∈ 𝑥)) → 𝑥 ∈ ((nei‘𝐽)‘{𝐴}))
8		eleq1 2849	. . . . . . . . . 10 ⊢ (𝑦 = 𝑥 → (𝑦 ∈ 𝐹 ↔ 𝑥 ∈ 𝐹))
9	8	rspcv 3573	. . . . . . . . 9 ⊢ (𝑥 ∈ ((nei‘𝐽)‘{𝐴}) → (∀𝑦 ∈ ((nei‘𝐽)‘{𝐴})𝑦 ∈ 𝐹 → 𝑥 ∈ 𝐹))
10	7, 9	syl 18	. . . . . . . 8 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝐴 ∈ 𝑋) ∧ (𝑥 ∈ 𝐽 ∧ 𝐴 ∈ 𝑥)) → (∀𝑦 ∈ ((nei‘𝐽)‘{𝐴})𝑦 ∈ 𝐹 → 𝑥 ∈ 𝐹))
11	10	expr 462	. . . . . . 7 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝐴 ∈ 𝑋) ∧ 𝑥 ∈ 𝐽) → (𝐴 ∈ 𝑥 → (∀𝑦 ∈ ((nei‘𝐽)‘{𝐴})𝑦 ∈ 𝐹 → 𝑥 ∈ 𝐹)))
12	11	com23 87	. . . . . 6 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝐴 ∈ 𝑋) ∧ 𝑥 ∈ 𝐽) → (∀𝑦 ∈ ((nei‘𝐽)‘{𝐴})𝑦 ∈ 𝐹 → (𝐴 ∈ 𝑥 → 𝑥 ∈ 𝐹)))
13	12	ralrimdva 3163	. . . . 5 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝐴 ∈ 𝑋) → (∀𝑦 ∈ ((nei‘𝐽)‘{𝐴})𝑦 ∈ 𝐹 → ∀𝑥 ∈ 𝐽 (𝐴 ∈ 𝑥 → 𝑥 ∈ 𝐹)))
14		simpr 490	. . . . . . . . . 10 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝐴 ∈ 𝑋) ∧ 𝑦 ∈ ((nei‘𝐽)‘{𝐴})) → 𝑦 ∈ ((nei‘𝐽)‘{𝐴}))
15	3	ad3antrrr 743	. . . . . . . . . . 11 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝐴 ∈ 𝑋) ∧ 𝑦 ∈ ((nei‘𝐽)‘{𝐴})) → 𝐽 ∈ Top)
16		simplr 781	. . . . . . . . . . . . 13 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝐴 ∈ 𝑋) ∧ 𝑦 ∈ ((nei‘𝐽)‘{𝐴})) → 𝐴 ∈ 𝑋)
17		toponuni 23225	. . . . . . . . . . . . . 14 ⊢ (𝐽 ∈ (TopOn‘𝑋) → 𝑋 = ∪ 𝐽)
18	17	ad3antrrr 743	. . . . . . . . . . . . 13 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝐴 ∈ 𝑋) ∧ 𝑦 ∈ ((nei‘𝐽)‘{𝐴})) → 𝑋 = ∪ 𝐽)
19	16, 18	eleqtrd 2863	. . . . . . . . . . . 12 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝐴 ∈ 𝑋) ∧ 𝑦 ∈ ((nei‘𝐽)‘{𝐴})) → 𝐴 ∈ ∪ 𝐽)
20	19	snssd 4747	. . . . . . . . . . 11 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝐴 ∈ 𝑋) ∧ 𝑦 ∈ ((nei‘𝐽)‘{𝐴})) → {𝐴} ⊆ ∪ 𝐽)
21		eqid 2761	. . . . . . . . . . . . 13 ⊢ ∪ 𝐽 = ∪ 𝐽
22	21	neii1 23417	. . . . . . . . . . . 12 ⊢ ((𝐽 ∈ Top ∧ 𝑦 ∈ ((nei‘𝐽)‘{𝐴})) → 𝑦 ⊆ ∪ 𝐽)
23	4, 22	sylan 592	. . . . . . . . . . 11 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝐴 ∈ 𝑋) ∧ 𝑦 ∈ ((nei‘𝐽)‘{𝐴})) → 𝑦 ⊆ ∪ 𝐽)
24	21	neiint 23415	. . . . . . . . . . 11 ⊢ ((𝐽 ∈ Top ∧ {𝐴} ⊆ ∪ 𝐽 ∧ 𝑦 ⊆ ∪ 𝐽) → (𝑦 ∈ ((nei‘𝐽)‘{𝐴}) ↔ {𝐴} ⊆ ((int‘𝐽)‘𝑦)))
25	15, 20, 23, 24	syl3anc 1398	. . . . . . . . . 10 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝐴 ∈ 𝑋) ∧ 𝑦 ∈ ((nei‘𝐽)‘{𝐴})) → (𝑦 ∈ ((nei‘𝐽)‘{𝐴}) ↔ {𝐴} ⊆ ((int‘𝐽)‘𝑦)))
26	14, 25	mpbid 235	. . . . . . . . 9 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝐴 ∈ 𝑋) ∧ 𝑦 ∈ ((nei‘𝐽)‘{𝐴})) → {𝐴} ⊆ ((int‘𝐽)‘𝑦))
27		snssg 4744	. . . . . . . . . 10 ⊢ (𝐴 ∈ 𝑋 → (𝐴 ∈ ((int‘𝐽)‘𝑦) ↔ {𝐴} ⊆ ((int‘𝐽)‘𝑦)))
28	27	ad2antlr 740	. . . . . . . . 9 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝐴 ∈ 𝑋) ∧ 𝑦 ∈ ((nei‘𝐽)‘{𝐴})) → (𝐴 ∈ ((int‘𝐽)‘𝑦) ↔ {𝐴} ⊆ ((int‘𝐽)‘𝑦)))
29	26, 28	mpbird 260	. . . . . . . 8 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝐴 ∈ 𝑋) ∧ 𝑦 ∈ ((nei‘𝐽)‘{𝐴})) → 𝐴 ∈ ((int‘𝐽)‘𝑦))
30	21	ntropn 23360	. . . . . . . . . 10 ⊢ ((𝐽 ∈ Top ∧ 𝑦 ⊆ ∪ 𝐽) → ((int‘𝐽)‘𝑦) ∈ 𝐽)
31	15, 23, 30	syl2anc 596	. . . . . . . . 9 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝐴 ∈ 𝑋) ∧ 𝑦 ∈ ((nei‘𝐽)‘{𝐴})) → ((int‘𝐽)‘𝑦) ∈ 𝐽)
32		eleq2 2850	. . . . . . . . . . 11 ⊢ (𝑥 = ((int‘𝐽)‘𝑦) → (𝐴 ∈ 𝑥 ↔ 𝐴 ∈ ((int‘𝐽)‘𝑦)))
33		eleq1 2849	. . . . . . . . . . 11 ⊢ (𝑥 = ((int‘𝐽)‘𝑦) → (𝑥 ∈ 𝐹 ↔ ((int‘𝐽)‘𝑦) ∈ 𝐹))
34	32, 33	imbi12d 347	. . . . . . . . . 10 ⊢ (𝑥 = ((int‘𝐽)‘𝑦) → ((𝐴 ∈ 𝑥 → 𝑥 ∈ 𝐹) ↔ (𝐴 ∈ ((int‘𝐽)‘𝑦) → ((int‘𝐽)‘𝑦) ∈ 𝐹)))
35	34	rspcv 3573	. . . . . . . . 9 ⊢ (((int‘𝐽)‘𝑦) ∈ 𝐽 → (∀𝑥 ∈ 𝐽 (𝐴 ∈ 𝑥 → 𝑥 ∈ 𝐹) → (𝐴 ∈ ((int‘𝐽)‘𝑦) → ((int‘𝐽)‘𝑦) ∈ 𝐹)))
36	31, 35	syl 18	. . . . . . . 8 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝐴 ∈ 𝑋) ∧ 𝑦 ∈ ((nei‘𝐽)‘{𝐴})) → (∀𝑥 ∈ 𝐽 (𝐴 ∈ 𝑥 → 𝑥 ∈ 𝐹) → (𝐴 ∈ ((int‘𝐽)‘𝑦) → ((int‘𝐽)‘𝑦) ∈ 𝐹)))
37	29, 36	mpid 45	. . . . . . 7 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝐴 ∈ 𝑋) ∧ 𝑦 ∈ ((nei‘𝐽)‘{𝐴})) → (∀𝑥 ∈ 𝐽 (𝐴 ∈ 𝑥 → 𝑥 ∈ 𝐹) → ((int‘𝐽)‘𝑦) ∈ 𝐹))
38		simpllr 788	. . . . . . . 8 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝐴 ∈ 𝑋) ∧ 𝑦 ∈ ((nei‘𝐽)‘{𝐴})) → 𝐹 ∈ (Fil‘𝑋))
39	21	ntrss2 23368	. . . . . . . . 9 ⊢ ((𝐽 ∈ Top ∧ 𝑦 ⊆ ∪ 𝐽) → ((int‘𝐽)‘𝑦) ⊆ 𝑦)
40	15, 23, 39	syl2anc 596	. . . . . . . 8 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝐴 ∈ 𝑋) ∧ 𝑦 ∈ ((nei‘𝐽)‘{𝐴})) → ((int‘𝐽)‘𝑦) ⊆ 𝑦)
41	23, 18	sseqtrrd 3968	. . . . . . . 8 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝐴 ∈ 𝑋) ∧ 𝑦 ∈ ((nei‘𝐽)‘{𝐴})) → 𝑦 ⊆ 𝑋)
42		filss 24165	. . . . . . . . . 10 ⊢ ((𝐹 ∈ (Fil‘𝑋) ∧ (((int‘𝐽)‘𝑦) ∈ 𝐹 ∧ 𝑦 ⊆ 𝑋 ∧ ((int‘𝐽)‘𝑦) ⊆ 𝑦)) → 𝑦 ∈ 𝐹)
43	42	3exp2 1373	. . . . . . . . 9 ⊢ (𝐹 ∈ (Fil‘𝑋) → (((int‘𝐽)‘𝑦) ∈ 𝐹 → (𝑦 ⊆ 𝑋 → (((int‘𝐽)‘𝑦) ⊆ 𝑦 → 𝑦 ∈ 𝐹))))
44	43	com24 96	. . . . . . . 8 ⊢ (𝐹 ∈ (Fil‘𝑋) → (((int‘𝐽)‘𝑦) ⊆ 𝑦 → (𝑦 ⊆ 𝑋 → (((int‘𝐽)‘𝑦) ∈ 𝐹 → 𝑦 ∈ 𝐹))))
45	38, 40, 41, 44	syl3c 67	. . . . . . 7 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝐴 ∈ 𝑋) ∧ 𝑦 ∈ ((nei‘𝐽)‘{𝐴})) → (((int‘𝐽)‘𝑦) ∈ 𝐹 → 𝑦 ∈ 𝐹))
46	37, 45	syld 48	. . . . . 6 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝐴 ∈ 𝑋) ∧ 𝑦 ∈ ((nei‘𝐽)‘{𝐴})) → (∀𝑥 ∈ 𝐽 (𝐴 ∈ 𝑥 → 𝑥 ∈ 𝐹) → 𝑦 ∈ 𝐹))
47	46	ralrimdva 3163	. . . . 5 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝐴 ∈ 𝑋) → (∀𝑥 ∈ 𝐽 (𝐴 ∈ 𝑥 → 𝑥 ∈ 𝐹) → ∀𝑦 ∈ ((nei‘𝐽)‘{𝐴})𝑦 ∈ 𝐹))
48	13, 47	impbid 215	. . . 4 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝐴 ∈ 𝑋) → (∀𝑦 ∈ ((nei‘𝐽)‘{𝐴})𝑦 ∈ 𝐹 ↔ ∀𝑥 ∈ 𝐽 (𝐴 ∈ 𝑥 → 𝑥 ∈ 𝐹)))
49	2, 48	bitrid 286	. . 3 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝐴 ∈ 𝑋) → (((nei‘𝐽)‘{𝐴}) ⊆ 𝐹 ↔ ∀𝑥 ∈ 𝐽 (𝐴 ∈ 𝑥 → 𝑥 ∈ 𝐹)))
50	49	pm5.32da 590	. 2 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → ((𝐴 ∈ 𝑋 ∧ ((nei‘𝐽)‘{𝐴}) ⊆ 𝐹) ↔ (𝐴 ∈ 𝑋 ∧ ∀𝑥 ∈ 𝐽 (𝐴 ∈ 𝑥 → 𝑥 ∈ 𝐹))))
51	1, 50	bitrd 282	1 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → (𝐴 ∈ (𝐽 fLim 𝐹) ↔ (𝐴 ∈ 𝑋 ∧ ∀𝑥 ∈ 𝐽 (𝐴 ∈ 𝑥 → 𝑥 ∈ 𝐹))))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∀wral 3077   ⊆ wss 3899  {csn 4584  ∪ cuni 4867  ‘cfv 6537  (class class class)co 7418  Topctop 23204  TopOnctopon 23221  intcnt 23328  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-iun 4953  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-topon 23222  df-ntr 23331  df-nei 23409  df-fil 24158  df-flim 24251

This theorem is used by:  fbflim  24288  flimrest  24295  flimsncls  24298  isflf  24305  cnpflfi  24311  flimfnfcls  24340  alexsublem  24356  cfilfcls  25588  iscmet3lem2  25606