Theorem flffbas 23911

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 23794	. . . 4 ⊢ (𝐵 ∈ (fBas‘𝑌) → (𝑌filGen𝐵) ∈ (Fil‘𝑌))
3	1, 2	eqeltrid 2837	. . 3 ⊢ (𝐵 ∈ (fBas‘𝑌) → 𝐿 ∈ (Fil‘𝑌))
4		isflf 23909	. . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐿 ∈ (Fil‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → (𝐴 ∈ ((𝐽 fLimf 𝐿)‘𝐹) ↔ (𝐴 ∈ 𝑋 ∧ ∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 → ∃𝑡 ∈ 𝐿 (𝐹 “ 𝑡) ⊆ 𝑜))))
5	3, 4	syl3an2 1164	. 2 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → (𝐴 ∈ ((𝐽 fLimf 𝐿)‘𝐹) ↔ (𝐴 ∈ 𝑋 ∧ ∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 → ∃𝑡 ∈ 𝐿 (𝐹 “ 𝑡) ⊆ 𝑜))))
6	1	eleq2i 2825	. . . . . . . 8 ⊢ (𝑡 ∈ 𝐿 ↔ 𝑡 ∈ (𝑌filGen𝐵))
7		elfg 23787	. . . . . . . . . . 11 ⊢ (𝐵 ∈ (fBas‘𝑌) → (𝑡 ∈ (𝑌filGen𝐵) ↔ (𝑡 ⊆ 𝑌 ∧ ∃𝑠 ∈ 𝐵 𝑠 ⊆ 𝑡)))
8	7	3ad2ant2 1134	. . . . . . . . . 10 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → (𝑡 ∈ (𝑌filGen𝐵) ↔ (𝑡 ⊆ 𝑌 ∧ ∃𝑠 ∈ 𝐵 𝑠 ⊆ 𝑡)))
9		sstr2 3937	. . . . . . . . . . . . . . . 16 ⊢ ((𝐹 “ 𝑠) ⊆ (𝐹 “ 𝑡) → ((𝐹 “ 𝑡) ⊆ 𝑜 → (𝐹 “ 𝑠) ⊆ 𝑜))
10		imass2 6055	. . . . . . . . . . . . . . . 16 ⊢ (𝑠 ⊆ 𝑡 → (𝐹 “ 𝑠) ⊆ (𝐹 “ 𝑡))
11	9, 10	syl11 33	. . . . . . . . . . . . . . 15 ⊢ ((𝐹 “ 𝑡) ⊆ 𝑜 → (𝑠 ⊆ 𝑡 → (𝐹 “ 𝑠) ⊆ 𝑜))
12	11	adantl 481	. . . . . . . . . . . . . 14 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ (𝐹 “ 𝑡) ⊆ 𝑜) → (𝑠 ⊆ 𝑡 → (𝐹 “ 𝑠) ⊆ 𝑜))
13	12	reximdv 3148	. . . . . . . . . . . . 13 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ (𝐹 “ 𝑡) ⊆ 𝑜) → (∃𝑠 ∈ 𝐵 𝑠 ⊆ 𝑡 → ∃𝑠 ∈ 𝐵 (𝐹 “ 𝑠) ⊆ 𝑜))
14	13	ex 412	. . . . . . . . . . . 12 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → ((𝐹 “ 𝑡) ⊆ 𝑜 → (∃𝑠 ∈ 𝐵 𝑠 ⊆ 𝑡 → ∃𝑠 ∈ 𝐵 (𝐹 “ 𝑠) ⊆ 𝑜)))
15	14	com23 86	. . . . . . . . . . 11 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → (∃𝑠 ∈ 𝐵 𝑠 ⊆ 𝑡 → ((𝐹 “ 𝑡) ⊆ 𝑜 → ∃𝑠 ∈ 𝐵 (𝐹 “ 𝑠) ⊆ 𝑜)))
16	15	adantld 490	. . . . . . . . . 10 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → ((𝑡 ⊆ 𝑌 ∧ ∃𝑠 ∈ 𝐵 𝑠 ⊆ 𝑡) → ((𝐹 “ 𝑡) ⊆ 𝑜 → ∃𝑠 ∈ 𝐵 (𝐹 “ 𝑠) ⊆ 𝑜)))
17	8, 16	sylbid 240	. . . . . . . . 9 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → (𝑡 ∈ (𝑌filGen𝐵) → ((𝐹 “ 𝑡) ⊆ 𝑜 → ∃𝑠 ∈ 𝐵 (𝐹 “ 𝑠) ⊆ 𝑜)))
18	17	adantr 480	. . . . . . . 8 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝐴 ∈ 𝑋) → (𝑡 ∈ (𝑌filGen𝐵) → ((𝐹 “ 𝑡) ⊆ 𝑜 → ∃𝑠 ∈ 𝐵 (𝐹 “ 𝑠) ⊆ 𝑜)))
19	6, 18	biimtrid 242	. . . . . . 7 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝐴 ∈ 𝑋) → (𝑡 ∈ 𝐿 → ((𝐹 “ 𝑡) ⊆ 𝑜 → ∃𝑠 ∈ 𝐵 (𝐹 “ 𝑠) ⊆ 𝑜)))
20	19	rexlimdv 3132	. . . . . 6 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝐴 ∈ 𝑋) → (∃𝑡 ∈ 𝐿 (𝐹 “ 𝑡) ⊆ 𝑜 → ∃𝑠 ∈ 𝐵 (𝐹 “ 𝑠) ⊆ 𝑜))
21		ssfg 23788	. . . . . . . . . . . 12 ⊢ (𝐵 ∈ (fBas‘𝑌) → 𝐵 ⊆ (𝑌filGen𝐵))
22	21, 1	sseqtrrdi 3972	. . . . . . . . . . 11 ⊢ (𝐵 ∈ (fBas‘𝑌) → 𝐵 ⊆ 𝐿)
23	22	sselda 3930	. . . . . . . . . 10 ⊢ ((𝐵 ∈ (fBas‘𝑌) ∧ 𝑠 ∈ 𝐵) → 𝑠 ∈ 𝐿)
24	23	3ad2antl2 1187	. . . . . . . . 9 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝑠 ∈ 𝐵) → 𝑠 ∈ 𝐿)
25	24	ad2ant2r 747	. . . . . . . 8 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝐴 ∈ 𝑋) ∧ (𝑠 ∈ 𝐵 ∧ (𝐹 “ 𝑠) ⊆ 𝑜)) → 𝑠 ∈ 𝐿)
26		simprr 772	. . . . . . . 8 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝐴 ∈ 𝑋) ∧ (𝑠 ∈ 𝐵 ∧ (𝐹 “ 𝑠) ⊆ 𝑜)) → (𝐹 “ 𝑠) ⊆ 𝑜)
27		imaeq2 6009	. . . . . . . . . 10 ⊢ (𝑡 = 𝑠 → (𝐹 “ 𝑡) = (𝐹 “ 𝑠))
28	27	sseq1d 3962	. . . . . . . . 9 ⊢ (𝑡 = 𝑠 → ((𝐹 “ 𝑡) ⊆ 𝑜 ↔ (𝐹 “ 𝑠) ⊆ 𝑜))
29	28	rspcev 3573	. . . . . . . 8 ⊢ ((𝑠 ∈ 𝐿 ∧ (𝐹 “ 𝑠) ⊆ 𝑜) → ∃𝑡 ∈ 𝐿 (𝐹 “ 𝑡) ⊆ 𝑜)
30	25, 26, 29	syl2anc 584	. . . . . . 7 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝐴 ∈ 𝑋) ∧ (𝑠 ∈ 𝐵 ∧ (𝐹 “ 𝑠) ⊆ 𝑜)) → ∃𝑡 ∈ 𝐿 (𝐹 “ 𝑡) ⊆ 𝑜)
31	30	rexlimdvaa 3135	. . . . . 6 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝐴 ∈ 𝑋) → (∃𝑠 ∈ 𝐵 (𝐹 “ 𝑠) ⊆ 𝑜 → ∃𝑡 ∈ 𝐿 (𝐹 “ 𝑡) ⊆ 𝑜))
32	20, 31	impbid 212	. . . . 5 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝐴 ∈ 𝑋) → (∃𝑡 ∈ 𝐿 (𝐹 “ 𝑡) ⊆ 𝑜 ↔ ∃𝑠 ∈ 𝐵 (𝐹 “ 𝑠) ⊆ 𝑜))
33	32	imbi2d 340	. . . 4 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝐴 ∈ 𝑋) → ((𝐴 ∈ 𝑜 → ∃𝑡 ∈ 𝐿 (𝐹 “ 𝑡) ⊆ 𝑜) ↔ (𝐴 ∈ 𝑜 → ∃𝑠 ∈ 𝐵 (𝐹 “ 𝑠) ⊆ 𝑜)))
34	33	ralbidv 3156	. . 3 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝐴 ∈ 𝑋) → (∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 → ∃𝑡 ∈ 𝐿 (𝐹 “ 𝑡) ⊆ 𝑜) ↔ ∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 → ∃𝑠 ∈ 𝐵 (𝐹 “ 𝑠) ⊆ 𝑜)))
35	34	pm5.32da 579	. 2 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → ((𝐴 ∈ 𝑋 ∧ ∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 → ∃𝑡 ∈ 𝐿 (𝐹 “ 𝑡) ⊆ 𝑜)) ↔ (𝐴 ∈ 𝑋 ∧ ∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 → ∃𝑠 ∈ 𝐵 (𝐹 “ 𝑠) ⊆ 𝑜))))
36	5, 35	bitrd 279	1 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → (𝐴 ∈ ((𝐽 fLimf 𝐿)‘𝐹) ↔ (𝐴 ∈ 𝑋 ∧ ∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 → ∃𝑠 ∈ 𝐵 (𝐹 “ 𝑠) ⊆ 𝑜))))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1086   = wceq 1541   ∈ wcel 2113  ∀wral 3048  ∃wrex 3057   ⊆ wss 3898   “ cima 5622  ⟶wf 6482  ‘cfv 6486  (class class class)co 7352  fBascfbas 21281  filGencfg 21282  TopOnctopon 22826  Filcfil 23761   fLimf cflf 23851

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2705  ax-rep 5219  ax-sep 5236  ax-nul 5246  ax-pow 5305  ax-pr 5372  ax-un 7674

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2566  df-clab 2712  df-cleq 2725  df-clel 2808  df-nfc 2882  df-ne 2930  df-nel 3034  df-ral 3049  df-rex 3058  df-reu 3348  df-rab 3397  df-v 3439  df-sbc 3738  df-csb 3847  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-nul 4283  df-if 4475  df-pw 4551  df-sn 4576  df-pr 4578  df-op 4582  df-uni 4859  df-iun 4943  df-br 5094  df-opab 5156  df-mpt 5175  df-id 5514  df-xp 5625  df-rel 5626  df-cnv 5627  df-co 5628  df-dm 5629  df-rn 5630  df-res 5631  df-ima 5632  df-iota 6442  df-fun 6488  df-fn 6489  df-f 6490  df-f1 6491  df-fo 6492  df-f1o 6493  df-fv 6494  df-ov 7355  df-oprab 7356  df-mpo 7357  df-map 8758  df-fbas 21290  df-fg 21291  df-top 22810  df-topon 22827  df-ntr 22936  df-nei 23014  df-fil 23762  df-fm 23854  df-flim 23855  df-flf 23856

This theorem is referenced by:  lmflf  23921  eltsms  24049