Theorem flffbas 23943

Description: Limit points of a function can be defined using filter bases. (Contributed by Jeff Hankins, 9-Nov-2009.) (Revised by Mario Carneiro, 26-Aug-2015.)

Hypothesis

Ref	Expression
flffbas.l	⊢ 𝐿 = (𝑌filGen𝐵)

Assertion

Ref	Expression
flffbas	⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → (𝐴 ∈ ((𝐽 fLimf 𝐿)‘𝐹) ↔ (𝐴 ∈ 𝑋 ∧ ∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 → ∃𝑠 ∈ 𝐵 (𝐹 “ 𝑠) ⊆ 𝑜))))

Distinct variable groups:   𝑜,𝑠,𝐴   𝐵,𝑜,𝑠   𝑜,𝐹,𝑠   𝑜,𝐽,𝑠   𝑜,𝐿,𝑠   𝑜,𝑋,𝑠   𝑜,𝑌,𝑠

Proof of Theorem flffbas

Dummy variable 𝑡 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		flffbas.l	. . . 4 ⊢ 𝐿 = (𝑌filGen𝐵)
2		fgcl 23826	. . . 4 ⊢ (𝐵 ∈ (fBas‘𝑌) → (𝑌filGen𝐵) ∈ (Fil‘𝑌))
3	1, 2	eqeltrid 2829	. . 3 ⊢ (𝐵 ∈ (fBas‘𝑌) → 𝐿 ∈ (Fil‘𝑌))
4		isflf 23941	. . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐿 ∈ (Fil‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → (𝐴 ∈ ((𝐽 fLimf 𝐿)‘𝐹) ↔ (𝐴 ∈ 𝑋 ∧ ∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 → ∃𝑡 ∈ 𝐿 (𝐹 “ 𝑡) ⊆ 𝑜))))
5	3, 4	syl3an2 1161	. 2 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → (𝐴 ∈ ((𝐽 fLimf 𝐿)‘𝐹) ↔ (𝐴 ∈ 𝑋 ∧ ∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 → ∃𝑡 ∈ 𝐿 (𝐹 “ 𝑡) ⊆ 𝑜))))
6	1	eleq2i 2817	. . . . . . . 8 ⊢ (𝑡 ∈ 𝐿 ↔ 𝑡 ∈ (𝑌filGen𝐵))
7		elfg 23819	. . . . . . . . . . 11 ⊢ (𝐵 ∈ (fBas‘𝑌) → (𝑡 ∈ (𝑌filGen𝐵) ↔ (𝑡 ⊆ 𝑌 ∧ ∃𝑠 ∈ 𝐵 𝑠 ⊆ 𝑡)))
8	7	3ad2ant2 1131	. . . . . . . . . 10 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → (𝑡 ∈ (𝑌filGen𝐵) ↔ (𝑡 ⊆ 𝑌 ∧ ∃𝑠 ∈ 𝐵 𝑠 ⊆ 𝑡)))
9		sstr2 3983	. . . . . . . . . . . . . . . 16 ⊢ ((𝐹 “ 𝑠) ⊆ (𝐹 “ 𝑡) → ((𝐹 “ 𝑡) ⊆ 𝑜 → (𝐹 “ 𝑠) ⊆ 𝑜))
10		imass2 6107	. . . . . . . . . . . . . . . 16 ⊢ (𝑠 ⊆ 𝑡 → (𝐹 “ 𝑠) ⊆ (𝐹 “ 𝑡))
11	9, 10	syl11 33	. . . . . . . . . . . . . . 15 ⊢ ((𝐹 “ 𝑡) ⊆ 𝑜 → (𝑠 ⊆ 𝑡 → (𝐹 “ 𝑠) ⊆ 𝑜))
12	11	adantl 480	. . . . . . . . . . . . . 14 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ (𝐹 “ 𝑡) ⊆ 𝑜) → (𝑠 ⊆ 𝑡 → (𝐹 “ 𝑠) ⊆ 𝑜))
13	12	reximdv 3159	. . . . . . . . . . . . 13 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ (𝐹 “ 𝑡) ⊆ 𝑜) → (∃𝑠 ∈ 𝐵 𝑠 ⊆ 𝑡 → ∃𝑠 ∈ 𝐵 (𝐹 “ 𝑠) ⊆ 𝑜))
14	13	ex 411	. . . . . . . . . . . 12 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → ((𝐹 “ 𝑡) ⊆ 𝑜 → (∃𝑠 ∈ 𝐵 𝑠 ⊆ 𝑡 → ∃𝑠 ∈ 𝐵 (𝐹 “ 𝑠) ⊆ 𝑜)))
15	14	com23 86	. . . . . . . . . . 11 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → (∃𝑠 ∈ 𝐵 𝑠 ⊆ 𝑡 → ((𝐹 “ 𝑡) ⊆ 𝑜 → ∃𝑠 ∈ 𝐵 (𝐹 “ 𝑠) ⊆ 𝑜)))
16	15	adantld 489	. . . . . . . . . 10 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → ((𝑡 ⊆ 𝑌 ∧ ∃𝑠 ∈ 𝐵 𝑠 ⊆ 𝑡) → ((𝐹 “ 𝑡) ⊆ 𝑜 → ∃𝑠 ∈ 𝐵 (𝐹 “ 𝑠) ⊆ 𝑜)))
17	8, 16	sylbid 239	. . . . . . . . 9 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → (𝑡 ∈ (𝑌filGen𝐵) → ((𝐹 “ 𝑡) ⊆ 𝑜 → ∃𝑠 ∈ 𝐵 (𝐹 “ 𝑠) ⊆ 𝑜)))
18	17	adantr 479	. . . . . . . 8 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝐴 ∈ 𝑋) → (𝑡 ∈ (𝑌filGen𝐵) → ((𝐹 “ 𝑡) ⊆ 𝑜 → ∃𝑠 ∈ 𝐵 (𝐹 “ 𝑠) ⊆ 𝑜)))
19	6, 18	biimtrid 241	. . . . . . 7 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝐴 ∈ 𝑋) → (𝑡 ∈ 𝐿 → ((𝐹 “ 𝑡) ⊆ 𝑜 → ∃𝑠 ∈ 𝐵 (𝐹 “ 𝑠) ⊆ 𝑜)))
20	19	rexlimdv 3142	. . . . . 6 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝐴 ∈ 𝑋) → (∃𝑡 ∈ 𝐿 (𝐹 “ 𝑡) ⊆ 𝑜 → ∃𝑠 ∈ 𝐵 (𝐹 “ 𝑠) ⊆ 𝑜))
21		ssfg 23820	. . . . . . . . . . . 12 ⊢ (𝐵 ∈ (fBas‘𝑌) → 𝐵 ⊆ (𝑌filGen𝐵))
22	21, 1	sseqtrrdi 4028	. . . . . . . . . . 11 ⊢ (𝐵 ∈ (fBas‘𝑌) → 𝐵 ⊆ 𝐿)
23	22	sselda 3976	. . . . . . . . . 10 ⊢ ((𝐵 ∈ (fBas‘𝑌) ∧ 𝑠 ∈ 𝐵) → 𝑠 ∈ 𝐿)
24	23	3ad2antl2 1183	. . . . . . . . 9 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝑠 ∈ 𝐵) → 𝑠 ∈ 𝐿)
25	24	ad2ant2r 745	. . . . . . . 8 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝐴 ∈ 𝑋) ∧ (𝑠 ∈ 𝐵 ∧ (𝐹 “ 𝑠) ⊆ 𝑜)) → 𝑠 ∈ 𝐿)
26		simprr 771	. . . . . . . 8 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝐴 ∈ 𝑋) ∧ (𝑠 ∈ 𝐵 ∧ (𝐹 “ 𝑠) ⊆ 𝑜)) → (𝐹 “ 𝑠) ⊆ 𝑜)
27		imaeq2 6060	. . . . . . . . . 10 ⊢ (𝑡 = 𝑠 → (𝐹 “ 𝑡) = (𝐹 “ 𝑠))
28	27	sseq1d 4008	. . . . . . . . 9 ⊢ (𝑡 = 𝑠 → ((𝐹 “ 𝑡) ⊆ 𝑜 ↔ (𝐹 “ 𝑠) ⊆ 𝑜))
29	28	rspcev 3606	. . . . . . . 8 ⊢ ((𝑠 ∈ 𝐿 ∧ (𝐹 “ 𝑠) ⊆ 𝑜) → ∃𝑡 ∈ 𝐿 (𝐹 “ 𝑡) ⊆ 𝑜)
30	25, 26, 29	syl2anc 582	. . . . . . 7 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝐴 ∈ 𝑋) ∧ (𝑠 ∈ 𝐵 ∧ (𝐹 “ 𝑠) ⊆ 𝑜)) → ∃𝑡 ∈ 𝐿 (𝐹 “ 𝑡) ⊆ 𝑜)
31	30	rexlimdvaa 3145	. . . . . 6 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝐴 ∈ 𝑋) → (∃𝑠 ∈ 𝐵 (𝐹 “ 𝑠) ⊆ 𝑜 → ∃𝑡 ∈ 𝐿 (𝐹 “ 𝑡) ⊆ 𝑜))
32	20, 31	impbid 211	. . . . 5 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝐴 ∈ 𝑋) → (∃𝑡 ∈ 𝐿 (𝐹 “ 𝑡) ⊆ 𝑜 ↔ ∃𝑠 ∈ 𝐵 (𝐹 “ 𝑠) ⊆ 𝑜))
33	32	imbi2d 339	. . . 4 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝐴 ∈ 𝑋) → ((𝐴 ∈ 𝑜 → ∃𝑡 ∈ 𝐿 (𝐹 “ 𝑡) ⊆ 𝑜) ↔ (𝐴 ∈ 𝑜 → ∃𝑠 ∈ 𝐵 (𝐹 “ 𝑠) ⊆ 𝑜)))
34	33	ralbidv 3167	. . 3 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝐴 ∈ 𝑋) → (∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 → ∃𝑡 ∈ 𝐿 (𝐹 “ 𝑡) ⊆ 𝑜) ↔ ∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 → ∃𝑠 ∈ 𝐵 (𝐹 “ 𝑠) ⊆ 𝑜)))
35	34	pm5.32da 577	. 2 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → ((𝐴 ∈ 𝑋 ∧ ∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 → ∃𝑡 ∈ 𝐿 (𝐹 “ 𝑡) ⊆ 𝑜)) ↔ (𝐴 ∈ 𝑋 ∧ ∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 → ∃𝑠 ∈ 𝐵 (𝐹 “ 𝑠) ⊆ 𝑜))))
36	5, 35	bitrd 278	1 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → (𝐴 ∈ ((𝐽 fLimf 𝐿)‘𝐹) ↔ (𝐴 ∈ 𝑋 ∧ ∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 → ∃𝑠 ∈ 𝐵 (𝐹 “ 𝑠) ⊆ 𝑜))))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 394   ∧ w3a 1084   = wceq 1533   ∈ wcel 2098  ∀wral 3050  ∃wrex 3059   ⊆ wss 3944   “ cima 5681  ⟶wf 6545  ‘cfv 6549  (class class class)co 7419  fBascfbas 21284  filGencfg 21285  TopOnctopon 22856  Filcfil 23793   fLimf cflf 23883

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-10 2129  ax-11 2146  ax-12 2166  ax-ext 2696  ax-rep 5286  ax-sep 5300  ax-nul 5307  ax-pow 5365  ax-pr 5429  ax-un 7741

This theorem depends on definitions:  df-bi 206  df-an 395  df-or 846  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-nf 1778  df-sb 2060  df-mo 2528  df-eu 2557  df-clab 2703  df-cleq 2717  df-clel 2802  df-nfc 2877  df-ne 2930  df-nel 3036  df-ral 3051  df-rex 3060  df-reu 3364  df-rab 3419  df-v 3463  df-sbc 3774  df-csb 3890  df-dif 3947  df-un 3949  df-in 3951  df-ss 3961  df-nul 4323  df-if 4531  df-pw 4606  df-sn 4631  df-pr 4633  df-op 4637  df-uni 4910  df-iun 4999  df-br 5150  df-opab 5212  df-mpt 5233  df-id 5576  df-xp 5684  df-rel 5685  df-cnv 5686  df-co 5687  df-dm 5688  df-rn 5689  df-res 5690  df-ima 5691  df-iota 6501  df-fun 6551  df-fn 6552  df-f 6553  df-f1 6554  df-fo 6555  df-f1o 6556  df-fv 6557  df-ov 7422  df-oprab 7423  df-mpo 7424  df-map 8847  df-fbas 21293  df-fg 21294  df-top 22840  df-topon 22857  df-ntr 22968  df-nei 23046  df-fil 23794  df-fm 23886  df-flim 23887  df-flf 23888

This theorem is referenced by:  lmflf  23953  eltsms  24081