Theorem flffbas 24319

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 24202	. . . 4 ⊢ (𝐵 ∈ (fBas‘𝑌) → (𝑌filGen𝐵) ∈ (Fil‘𝑌))
3	1, 2	eqeltrid 2864	. . 3 ⊢ (𝐵 ∈ (fBas‘𝑌) → 𝐿 ∈ (Fil‘𝑌))
4		isflf 24317	. . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐿 ∈ (Fil‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → (𝐴 ∈ ((𝐽 fLimf 𝐿)‘𝐹) ↔ (𝐴 ∈ 𝑋 ∧ ∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 → ∃𝑡 ∈ 𝐿 (𝐹 “ 𝑡) ⊆ 𝑜))))
5	3, 4	syl3an2 1182	. 2 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → (𝐴 ∈ ((𝐽 fLimf 𝐿)‘𝐹) ↔ (𝐴 ∈ 𝑋 ∧ ∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 → ∃𝑡 ∈ 𝐿 (𝐹 “ 𝑡) ⊆ 𝑜))))
6	1	eleq2i 2852	. . . . . . . 8 ⊢ (𝑡 ∈ 𝐿 ↔ 𝑡 ∈ (𝑌filGen𝐵))
7		elfg 24195	. . . . . . . . . . 11 ⊢ (𝐵 ∈ (fBas‘𝑌) → (𝑡 ∈ (𝑌filGen𝐵) ↔ (𝑡 ⊆ 𝑌 ∧ ∃𝑠 ∈ 𝐵 𝑠 ⊆ 𝑡)))
8	7	3ad2ant2 1152	. . . . . . . . . 10 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → (𝑡 ∈ (𝑌filGen𝐵) ↔ (𝑡 ⊆ 𝑌 ∧ ∃𝑠 ∈ 𝐵 𝑠 ⊆ 𝑡)))
9		sstr2 3915	. . . . . . . . . . . . . . . 16 ⊢ ((𝐹 “ 𝑠) ⊆ (𝐹 “ 𝑡) → ((𝐹 “ 𝑡) ⊆ 𝑜 → (𝐹 “ 𝑠) ⊆ 𝑜))
10		imass2 6054	. . . . . . . . . . . . . . . 16 ⊢ (𝑠 ⊆ 𝑡 → (𝐹 “ 𝑠) ⊆ (𝐹 “ 𝑡))
11	9, 10	syl11 34	. . . . . . . . . . . . . . 15 ⊢ ((𝐹 “ 𝑡) ⊆ 𝑜 → (𝑠 ⊆ 𝑡 → (𝐹 “ 𝑠) ⊆ 𝑜))
12	11	adantl 487	. . . . . . . . . . . . . 14 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ (𝐹 “ 𝑡) ⊆ 𝑜) → (𝑠 ⊆ 𝑡 → (𝐹 “ 𝑠) ⊆ 𝑜))
13	12	reximdv 3177	. . . . . . . . . . . . 13 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ (𝐹 “ 𝑡) ⊆ 𝑜) → (∃𝑠 ∈ 𝐵 𝑠 ⊆ 𝑡 → ∃𝑠 ∈ 𝐵 (𝐹 “ 𝑠) ⊆ 𝑜))
14	13	ex 418	. . . . . . . . . . . 12 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → ((𝐹 “ 𝑡) ⊆ 𝑜 → (∃𝑠 ∈ 𝐵 𝑠 ⊆ 𝑡 → ∃𝑠 ∈ 𝐵 (𝐹 “ 𝑠) ⊆ 𝑜)))
15	14	com23 87	. . . . . . . . . . 11 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → (∃𝑠 ∈ 𝐵 𝑠 ⊆ 𝑡 → ((𝐹 “ 𝑡) ⊆ 𝑜 → ∃𝑠 ∈ 𝐵 (𝐹 “ 𝑠) ⊆ 𝑜)))
16	15	adantld 496	. . . . . . . . . 10 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → ((𝑡 ⊆ 𝑌 ∧ ∃𝑠 ∈ 𝐵 𝑠 ⊆ 𝑡) → ((𝐹 “ 𝑡) ⊆ 𝑜 → ∃𝑠 ∈ 𝐵 (𝐹 “ 𝑠) ⊆ 𝑜)))
17	8, 16	sylbid 243	. . . . . . . . 9 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → (𝑡 ∈ (𝑌filGen𝐵) → ((𝐹 “ 𝑡) ⊆ 𝑜 → ∃𝑠 ∈ 𝐵 (𝐹 “ 𝑠) ⊆ 𝑜)))
18	17	adantr 486	. . . . . . . 8 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝐴 ∈ 𝑋) → (𝑡 ∈ (𝑌filGen𝐵) → ((𝐹 “ 𝑡) ⊆ 𝑜 → ∃𝑠 ∈ 𝐵 (𝐹 “ 𝑠) ⊆ 𝑜)))
19	6, 18	biimtrid 245	. . . . . . 7 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝐴 ∈ 𝑋) → (𝑡 ∈ 𝐿 → ((𝐹 “ 𝑡) ⊆ 𝑜 → ∃𝑠 ∈ 𝐵 (𝐹 “ 𝑠) ⊆ 𝑜)))
20	19	rexlimdv 3161	. . . . . 6 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝐴 ∈ 𝑋) → (∃𝑡 ∈ 𝐿 (𝐹 “ 𝑡) ⊆ 𝑜 → ∃𝑠 ∈ 𝐵 (𝐹 “ 𝑠) ⊆ 𝑜))
21		ssfg 24196	. . . . . . . . . . . 12 ⊢ (𝐵 ∈ (fBas‘𝑌) → 𝐵 ⊆ (𝑌filGen𝐵))
22	21, 1	sseqtrrdi 3949	. . . . . . . . . . 11 ⊢ (𝐵 ∈ (fBas‘𝑌) → 𝐵 ⊆ 𝐿)
23	22	sselda 3908	. . . . . . . . . 10 ⊢ ((𝐵 ∈ (fBas‘𝑌) ∧ 𝑠 ∈ 𝐵) → 𝑠 ∈ 𝐿)
24	23	3ad2antl2 1205	. . . . . . . . 9 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝑠 ∈ 𝐵) → 𝑠 ∈ 𝐿)
25	24	ad2ant2r 760	. . . . . . . 8 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝐴 ∈ 𝑋) ∧ (𝑠 ∈ 𝐵 ∧ (𝐹 “ 𝑠) ⊆ 𝑜)) → 𝑠 ∈ 𝐿)
26		simprr 785	. . . . . . . 8 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝐴 ∈ 𝑋) ∧ (𝑠 ∈ 𝐵 ∧ (𝐹 “ 𝑠) ⊆ 𝑜)) → (𝐹 “ 𝑠) ⊆ 𝑜)
27		imaeq2 6047	. . . . . . . . . 10 ⊢ (𝑡 = 𝑠 → (𝐹 “ 𝑡) = (𝐹 “ 𝑠))
28	27	sseq1d 3939	. . . . . . . . 9 ⊢ (𝑡 = 𝑠 → ((𝐹 “ 𝑡) ⊆ 𝑜 ↔ (𝐹 “ 𝑠) ⊆ 𝑜))
29	28	rspcev 3576	. . . . . . . 8 ⊢ ((𝑠 ∈ 𝐿 ∧ (𝐹 “ 𝑠) ⊆ 𝑜) → ∃𝑡 ∈ 𝐿 (𝐹 “ 𝑡) ⊆ 𝑜)
30	25, 26, 29	syl2anc 596	. . . . . . 7 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝐴 ∈ 𝑋) ∧ (𝑠 ∈ 𝐵 ∧ (𝐹 “ 𝑠) ⊆ 𝑜)) → ∃𝑡 ∈ 𝐿 (𝐹 “ 𝑡) ⊆ 𝑜)
31	30	rexlimdvaa 3164	. . . . . 6 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝐴 ∈ 𝑋) → (∃𝑠 ∈ 𝐵 (𝐹 “ 𝑠) ⊆ 𝑜 → ∃𝑡 ∈ 𝐿 (𝐹 “ 𝑡) ⊆ 𝑜))
32	20, 31	impbid 215	. . . . 5 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝐴 ∈ 𝑋) → (∃𝑡 ∈ 𝐿 (𝐹 “ 𝑡) ⊆ 𝑜 ↔ ∃𝑠 ∈ 𝐵 (𝐹 “ 𝑠) ⊆ 𝑜))
33	32	imbi2d 343	. . . 4 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝐴 ∈ 𝑋) → ((𝐴 ∈ 𝑜 → ∃𝑡 ∈ 𝐿 (𝐹 “ 𝑡) ⊆ 𝑜) ↔ (𝐴 ∈ 𝑜 → ∃𝑠 ∈ 𝐵 (𝐹 “ 𝑠) ⊆ 𝑜)))
34	33	ralbidv 3185	. . 3 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝐴 ∈ 𝑋) → (∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 → ∃𝑡 ∈ 𝐿 (𝐹 “ 𝑡) ⊆ 𝑜) ↔ ∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 → ∃𝑠 ∈ 𝐵 (𝐹 “ 𝑠) ⊆ 𝑜)))
35	34	pm5.32da 590	. 2 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → ((𝐴 ∈ 𝑋 ∧ ∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 → ∃𝑡 ∈ 𝐿 (𝐹 “ 𝑡) ⊆ 𝑜)) ↔ (𝐴 ∈ 𝑋 ∧ ∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 → ∃𝑠 ∈ 𝐵 (𝐹 “ 𝑠) ⊆ 𝑜))))
36	5, 35	bitrd 282	1 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → (𝐴 ∈ ((𝐽 fLimf 𝐿)‘𝐹) ↔ (𝐴 ∈ 𝑋 ∧ ∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 → ∃𝑠 ∈ 𝐵 (𝐹 “ 𝑠) ⊆ 𝑜))))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1569   ∈ wcel 2144  ∀wral 3076  ∃wrex 3086   ⊆ wss 3895   “ cima 5653  ⟶wf 6534  ‘cfv 6538  (class class class)co 7420  fBascfbas 21671  filGencfg 21672  TopOnctopon 23233  Filcfil 24169   fLimf cflf 24259

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7751

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-nel 3062  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-ov 7423  df-oprab 7424  df-mpo 7425  df-map 8852  df-fbas 21680  df-fg 21681  df-top 23217  df-topon 23234  df-ntr 23343  df-nei 23421  df-fil 24170  df-fm 24262  df-flim 24263  df-flf 24264

This theorem is used by:  lmflf  24329  eltsms  24457