Theorem fbflim2 24289

Description: A condition for a filter base 𝐵 to converge to a point 𝐴. Use neighborhoods instead of open neighborhoods. Compare fbflim 24288. (Contributed by FL, 4-Jul-2011.) (Revised by Stefan O'Rear, 6-Aug-2015.)

Hypothesis

Ref	Expression
fbflim.3	⊢ 𝐹 = (𝑋filGen𝐵)

Assertion

Ref	Expression
fbflim2	⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑋)) → (𝐴 ∈ (𝐽 fLim 𝐹) ↔ (𝐴 ∈ 𝑋 ∧ ∀𝑛 ∈ ((nei‘𝐽)‘{𝐴})∃𝑥 ∈ 𝐵 𝑥 ⊆ 𝑛)))

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

Allowed substitution hint:   𝐹(𝑛)

Proof of Theorem fbflim2

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		fbflim.3	. . 3 ⊢ 𝐹 = (𝑋filGen𝐵)
2	1	fbflim 24288	. 2 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑋)) → (𝐴 ∈ (𝐽 fLim 𝐹) ↔ (𝐴 ∈ 𝑋 ∧ ∀𝑦 ∈ 𝐽 (𝐴 ∈ 𝑦 → ∃𝑥 ∈ 𝐵 𝑥 ⊆ 𝑦))))
3		topontop 23224	. . . . . . . . 9 ⊢ (𝐽 ∈ (TopOn‘𝑋) → 𝐽 ∈ Top)
4	3	ad2antrr 739	. . . . . . . 8 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑋)) ∧ 𝐴 ∈ 𝑋) → 𝐽 ∈ Top)
5		simpr 490	. . . . . . . . 9 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑋)) ∧ 𝐴 ∈ 𝑋) → 𝐴 ∈ 𝑋)
6		toponuni 23225	. . . . . . . . . 10 ⊢ (𝐽 ∈ (TopOn‘𝑋) → 𝑋 = ∪ 𝐽)
7	6	ad2antrr 739	. . . . . . . . 9 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑋)) ∧ 𝐴 ∈ 𝑋) → 𝑋 = ∪ 𝐽)
8	5, 7	eleqtrd 2863	. . . . . . . 8 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑋)) ∧ 𝐴 ∈ 𝑋) → 𝐴 ∈ ∪ 𝐽)
9		eqid 2761	. . . . . . . . 9 ⊢ ∪ 𝐽 = ∪ 𝐽
10	9	isneip 23416	. . . . . . . 8 ⊢ ((𝐽 ∈ Top ∧ 𝐴 ∈ ∪ 𝐽) → (𝑛 ∈ ((nei‘𝐽)‘{𝐴}) ↔ (𝑛 ⊆ ∪ 𝐽 ∧ ∃𝑦 ∈ 𝐽 (𝐴 ∈ 𝑦 ∧ 𝑦 ⊆ 𝑛))))
11	4, 8, 10	syl2anc 596	. . . . . . 7 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑋)) ∧ 𝐴 ∈ 𝑋) → (𝑛 ∈ ((nei‘𝐽)‘{𝐴}) ↔ (𝑛 ⊆ ∪ 𝐽 ∧ ∃𝑦 ∈ 𝐽 (𝐴 ∈ 𝑦 ∧ 𝑦 ⊆ 𝑛))))
12		simpr 490	. . . . . . 7 ⊢ ((𝑛 ⊆ ∪ 𝐽 ∧ ∃𝑦 ∈ 𝐽 (𝐴 ∈ 𝑦 ∧ 𝑦 ⊆ 𝑛)) → ∃𝑦 ∈ 𝐽 (𝐴 ∈ 𝑦 ∧ 𝑦 ⊆ 𝑛))
13	11, 12	biimtrdi 256	. . . . . 6 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑋)) ∧ 𝐴 ∈ 𝑋) → (𝑛 ∈ ((nei‘𝐽)‘{𝐴}) → ∃𝑦 ∈ 𝐽 (𝐴 ∈ 𝑦 ∧ 𝑦 ⊆ 𝑛)))
14		r19.29 3126	. . . . . . . 8 ⊢ ((∀𝑦 ∈ 𝐽 (𝐴 ∈ 𝑦 → ∃𝑥 ∈ 𝐵 𝑥 ⊆ 𝑦) ∧ ∃𝑦 ∈ 𝐽 (𝐴 ∈ 𝑦 ∧ 𝑦 ⊆ 𝑛)) → ∃𝑦 ∈ 𝐽 ((𝐴 ∈ 𝑦 → ∃𝑥 ∈ 𝐵 𝑥 ⊆ 𝑦) ∧ (𝐴 ∈ 𝑦 ∧ 𝑦 ⊆ 𝑛)))
15		pm3.45 634	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ 𝑦 → ∃𝑥 ∈ 𝐵 𝑥 ⊆ 𝑦) → ((𝐴 ∈ 𝑦 ∧ 𝑦 ⊆ 𝑛) → (∃𝑥 ∈ 𝐵 𝑥 ⊆ 𝑦 ∧ 𝑦 ⊆ 𝑛)))
16	15	imp 412	. . . . . . . . . 10 ⊢ (((𝐴 ∈ 𝑦 → ∃𝑥 ∈ 𝐵 𝑥 ⊆ 𝑦) ∧ (𝐴 ∈ 𝑦 ∧ 𝑦 ⊆ 𝑛)) → (∃𝑥 ∈ 𝐵 𝑥 ⊆ 𝑦 ∧ 𝑦 ⊆ 𝑛))
17		sstr2 3938	. . . . . . . . . . . . 13 ⊢ (𝑥 ⊆ 𝑦 → (𝑦 ⊆ 𝑛 → 𝑥 ⊆ 𝑛))
18	17	com12 33	. . . . . . . . . . . 12 ⊢ (𝑦 ⊆ 𝑛 → (𝑥 ⊆ 𝑦 → 𝑥 ⊆ 𝑛))
19	18	reximdv 3178	. . . . . . . . . . 11 ⊢ (𝑦 ⊆ 𝑛 → (∃𝑥 ∈ 𝐵 𝑥 ⊆ 𝑦 → ∃𝑥 ∈ 𝐵 𝑥 ⊆ 𝑛))
20	19	impcom 413	. . . . . . . . . 10 ⊢ ((∃𝑥 ∈ 𝐵 𝑥 ⊆ 𝑦 ∧ 𝑦 ⊆ 𝑛) → ∃𝑥 ∈ 𝐵 𝑥 ⊆ 𝑛)
21	16, 20	syl 18	. . . . . . . . 9 ⊢ (((𝐴 ∈ 𝑦 → ∃𝑥 ∈ 𝐵 𝑥 ⊆ 𝑦) ∧ (𝐴 ∈ 𝑦 ∧ 𝑦 ⊆ 𝑛)) → ∃𝑥 ∈ 𝐵 𝑥 ⊆ 𝑛)
22	21	rexlimivw 3160	. . . . . . . 8 ⊢ (∃𝑦 ∈ 𝐽 ((𝐴 ∈ 𝑦 → ∃𝑥 ∈ 𝐵 𝑥 ⊆ 𝑦) ∧ (𝐴 ∈ 𝑦 ∧ 𝑦 ⊆ 𝑛)) → ∃𝑥 ∈ 𝐵 𝑥 ⊆ 𝑛)
23	14, 22	syl 18	. . . . . . 7 ⊢ ((∀𝑦 ∈ 𝐽 (𝐴 ∈ 𝑦 → ∃𝑥 ∈ 𝐵 𝑥 ⊆ 𝑦) ∧ ∃𝑦 ∈ 𝐽 (𝐴 ∈ 𝑦 ∧ 𝑦 ⊆ 𝑛)) → ∃𝑥 ∈ 𝐵 𝑥 ⊆ 𝑛)
24	23	ex 418	. . . . . 6 ⊢ (∀𝑦 ∈ 𝐽 (𝐴 ∈ 𝑦 → ∃𝑥 ∈ 𝐵 𝑥 ⊆ 𝑦) → (∃𝑦 ∈ 𝐽 (𝐴 ∈ 𝑦 ∧ 𝑦 ⊆ 𝑛) → ∃𝑥 ∈ 𝐵 𝑥 ⊆ 𝑛))
25	13, 24	syl9 78	. . . . 5 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑋)) ∧ 𝐴 ∈ 𝑋) → (∀𝑦 ∈ 𝐽 (𝐴 ∈ 𝑦 → ∃𝑥 ∈ 𝐵 𝑥 ⊆ 𝑦) → (𝑛 ∈ ((nei‘𝐽)‘{𝐴}) → ∃𝑥 ∈ 𝐵 𝑥 ⊆ 𝑛)))
26	25	ralrimdv 3161	. . . 4 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑋)) ∧ 𝐴 ∈ 𝑋) → (∀𝑦 ∈ 𝐽 (𝐴 ∈ 𝑦 → ∃𝑥 ∈ 𝐵 𝑥 ⊆ 𝑦) → ∀𝑛 ∈ ((nei‘𝐽)‘{𝐴})∃𝑥 ∈ 𝐵 𝑥 ⊆ 𝑛))
27	4	adantr 486	. . . . . . . . 9 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑋)) ∧ 𝐴 ∈ 𝑋) ∧ (𝑦 ∈ 𝐽 ∧ 𝐴 ∈ 𝑦)) → 𝐽 ∈ Top)
28		simprl 783	. . . . . . . . 9 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑋)) ∧ 𝐴 ∈ 𝑋) ∧ (𝑦 ∈ 𝐽 ∧ 𝐴 ∈ 𝑦)) → 𝑦 ∈ 𝐽)
29		simprr 785	. . . . . . . . 9 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑋)) ∧ 𝐴 ∈ 𝑋) ∧ (𝑦 ∈ 𝐽 ∧ 𝐴 ∈ 𝑦)) → 𝐴 ∈ 𝑦)
30		opnneip 23430	. . . . . . . . 9 ⊢ ((𝐽 ∈ Top ∧ 𝑦 ∈ 𝐽 ∧ 𝐴 ∈ 𝑦) → 𝑦 ∈ ((nei‘𝐽)‘{𝐴}))
31	27, 28, 29, 30	syl3anc 1398	. . . . . . . 8 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑋)) ∧ 𝐴 ∈ 𝑋) ∧ (𝑦 ∈ 𝐽 ∧ 𝐴 ∈ 𝑦)) → 𝑦 ∈ ((nei‘𝐽)‘{𝐴}))
32		sseq2 3957	. . . . . . . . . 10 ⊢ (𝑛 = 𝑦 → (𝑥 ⊆ 𝑛 ↔ 𝑥 ⊆ 𝑦))
33	32	rexbidv 3187	. . . . . . . . 9 ⊢ (𝑛 = 𝑦 → (∃𝑥 ∈ 𝐵 𝑥 ⊆ 𝑛 ↔ ∃𝑥 ∈ 𝐵 𝑥 ⊆ 𝑦))
34	33	rspcv 3573	. . . . . . . 8 ⊢ (𝑦 ∈ ((nei‘𝐽)‘{𝐴}) → (∀𝑛 ∈ ((nei‘𝐽)‘{𝐴})∃𝑥 ∈ 𝐵 𝑥 ⊆ 𝑛 → ∃𝑥 ∈ 𝐵 𝑥 ⊆ 𝑦))
35	31, 34	syl 18	. . . . . . 7 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑋)) ∧ 𝐴 ∈ 𝑋) ∧ (𝑦 ∈ 𝐽 ∧ 𝐴 ∈ 𝑦)) → (∀𝑛 ∈ ((nei‘𝐽)‘{𝐴})∃𝑥 ∈ 𝐵 𝑥 ⊆ 𝑛 → ∃𝑥 ∈ 𝐵 𝑥 ⊆ 𝑦))
36	35	expr 462	. . . . . 6 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑋)) ∧ 𝐴 ∈ 𝑋) ∧ 𝑦 ∈ 𝐽) → (𝐴 ∈ 𝑦 → (∀𝑛 ∈ ((nei‘𝐽)‘{𝐴})∃𝑥 ∈ 𝐵 𝑥 ⊆ 𝑛 → ∃𝑥 ∈ 𝐵 𝑥 ⊆ 𝑦)))
37	36	com23 87	. . . . 5 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑋)) ∧ 𝐴 ∈ 𝑋) ∧ 𝑦 ∈ 𝐽) → (∀𝑛 ∈ ((nei‘𝐽)‘{𝐴})∃𝑥 ∈ 𝐵 𝑥 ⊆ 𝑛 → (𝐴 ∈ 𝑦 → ∃𝑥 ∈ 𝐵 𝑥 ⊆ 𝑦)))
38	37	ralrimdva 3163	. . . 4 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑋)) ∧ 𝐴 ∈ 𝑋) → (∀𝑛 ∈ ((nei‘𝐽)‘{𝐴})∃𝑥 ∈ 𝐵 𝑥 ⊆ 𝑛 → ∀𝑦 ∈ 𝐽 (𝐴 ∈ 𝑦 → ∃𝑥 ∈ 𝐵 𝑥 ⊆ 𝑦)))
39	26, 38	impbid 215	. . 3 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑋)) ∧ 𝐴 ∈ 𝑋) → (∀𝑦 ∈ 𝐽 (𝐴 ∈ 𝑦 → ∃𝑥 ∈ 𝐵 𝑥 ⊆ 𝑦) ↔ ∀𝑛 ∈ ((nei‘𝐽)‘{𝐴})∃𝑥 ∈ 𝐵 𝑥 ⊆ 𝑛))
40	39	pm5.32da 590	. 2 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑋)) → ((𝐴 ∈ 𝑋 ∧ ∀𝑦 ∈ 𝐽 (𝐴 ∈ 𝑦 → ∃𝑥 ∈ 𝐵 𝑥 ⊆ 𝑦)) ↔ (𝐴 ∈ 𝑋 ∧ ∀𝑛 ∈ ((nei‘𝐽)‘{𝐴})∃𝑥 ∈ 𝐵 𝑥 ⊆ 𝑛)))
41	2, 40	bitrd 282	1 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑋)) → (𝐴 ∈ (𝐽 fLim 𝐹) ↔ (𝐴 ∈ 𝑋 ∧ ∀𝑛 ∈ ((nei‘𝐽)‘{𝐴})∃𝑥 ∈ 𝐵 𝑥 ⊆ 𝑛)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∀wral 3077  ∃wrex 3087   ⊆ wss 3899  {csn 4584  ∪ cuni 4867  ‘cfv 6537  (class class class)co 7418  fBascfbas 21659  filGencfg 21660  Topctop 23204  TopOnctopon 23221  neicnei 23408   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-fg 21669  df-top 23205  df-topon 23222  df-ntr 23331  df-nei 23409  df-fil 24158  df-flim 24251

This theorem is used by: (None)