Theorem flimval 23938

Description: The set of limit points of a filter. (Contributed by Jeff Hankins, 4-Sep-2009.) (Revised by Stefan O'Rear, 6-Aug-2015.)

Hypothesis

Ref	Expression
flimval.1	⊢ 𝑋 = ∪ 𝐽

Assertion

Ref	Expression
flimval	⊢ ((𝐽 ∈ Top ∧ 𝐹 ∈ ∪ ran Fil) → (𝐽 fLim 𝐹) = {𝑥 ∈ 𝑋 ∣ (((nei‘𝐽)‘{𝑥}) ⊆ 𝐹 ∧ 𝐹 ⊆ 𝒫 𝑋)})

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

Proof of Theorem flimval

Dummy variables 𝑓 𝑗 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		flimval.1	. . . . 5 ⊢ 𝑋 = ∪ 𝐽
2	1	topopn 22881	. . . 4 ⊢ (𝐽 ∈ Top → 𝑋 ∈ 𝐽)
3	2	adantr 480	. . 3 ⊢ ((𝐽 ∈ Top ∧ 𝐹 ∈ ∪ ran Fil) → 𝑋 ∈ 𝐽)
4		rabexg 5274	. . 3 ⊢ (𝑋 ∈ 𝐽 → {𝑥 ∈ 𝑋 ∣ (((nei‘𝐽)‘{𝑥}) ⊆ 𝐹 ∧ 𝐹 ⊆ 𝒫 𝑋)} ∈ V)
5	3, 4	syl 17	. 2 ⊢ ((𝐽 ∈ Top ∧ 𝐹 ∈ ∪ ran Fil) → {𝑥 ∈ 𝑋 ∣ (((nei‘𝐽)‘{𝑥}) ⊆ 𝐹 ∧ 𝐹 ⊆ 𝒫 𝑋)} ∈ V)
6		simpl 482	. . . . . 6 ⊢ ((𝑗 = 𝐽 ∧ 𝑓 = 𝐹) → 𝑗 = 𝐽)
7	6	unieqd 4864	. . . . 5 ⊢ ((𝑗 = 𝐽 ∧ 𝑓 = 𝐹) → ∪ 𝑗 = ∪ 𝐽)
8	7, 1	eqtr4di 2790	. . . 4 ⊢ ((𝑗 = 𝐽 ∧ 𝑓 = 𝐹) → ∪ 𝑗 = 𝑋)
9	6	fveq2d 6838	. . . . . . 7 ⊢ ((𝑗 = 𝐽 ∧ 𝑓 = 𝐹) → (nei‘𝑗) = (nei‘𝐽))
10	9	fveq1d 6836	. . . . . 6 ⊢ ((𝑗 = 𝐽 ∧ 𝑓 = 𝐹) → ((nei‘𝑗)‘{𝑥}) = ((nei‘𝐽)‘{𝑥}))
11		simpr 484	. . . . . 6 ⊢ ((𝑗 = 𝐽 ∧ 𝑓 = 𝐹) → 𝑓 = 𝐹)
12	10, 11	sseq12d 3956	. . . . 5 ⊢ ((𝑗 = 𝐽 ∧ 𝑓 = 𝐹) → (((nei‘𝑗)‘{𝑥}) ⊆ 𝑓 ↔ ((nei‘𝐽)‘{𝑥}) ⊆ 𝐹))
13	8	pweqd 4559	. . . . . 6 ⊢ ((𝑗 = 𝐽 ∧ 𝑓 = 𝐹) → 𝒫 ∪ 𝑗 = 𝒫 𝑋)
14	11, 13	sseq12d 3956	. . . . 5 ⊢ ((𝑗 = 𝐽 ∧ 𝑓 = 𝐹) → (𝑓 ⊆ 𝒫 ∪ 𝑗 ↔ 𝐹 ⊆ 𝒫 𝑋))
15	12, 14	anbi12d 633	. . . 4 ⊢ ((𝑗 = 𝐽 ∧ 𝑓 = 𝐹) → ((((nei‘𝑗)‘{𝑥}) ⊆ 𝑓 ∧ 𝑓 ⊆ 𝒫 ∪ 𝑗) ↔ (((nei‘𝐽)‘{𝑥}) ⊆ 𝐹 ∧ 𝐹 ⊆ 𝒫 𝑋)))
16	8, 15	rabeqbidv 3408	. . 3 ⊢ ((𝑗 = 𝐽 ∧ 𝑓 = 𝐹) → {𝑥 ∈ ∪ 𝑗 ∣ (((nei‘𝑗)‘{𝑥}) ⊆ 𝑓 ∧ 𝑓 ⊆ 𝒫 ∪ 𝑗)} = {𝑥 ∈ 𝑋 ∣ (((nei‘𝐽)‘{𝑥}) ⊆ 𝐹 ∧ 𝐹 ⊆ 𝒫 𝑋)})
17		df-flim 23914	. . 3 ⊢ fLim = (𝑗 ∈ Top, 𝑓 ∈ ∪ ran Fil ↦ {𝑥 ∈ ∪ 𝑗 ∣ (((nei‘𝑗)‘{𝑥}) ⊆ 𝑓 ∧ 𝑓 ⊆ 𝒫 ∪ 𝑗)})
18	16, 17	ovmpoga 7514	. 2 ⊢ ((𝐽 ∈ Top ∧ 𝐹 ∈ ∪ ran Fil ∧ {𝑥 ∈ 𝑋 ∣ (((nei‘𝐽)‘{𝑥}) ⊆ 𝐹 ∧ 𝐹 ⊆ 𝒫 𝑋)} ∈ V) → (𝐽 fLim 𝐹) = {𝑥 ∈ 𝑋 ∣ (((nei‘𝐽)‘{𝑥}) ⊆ 𝐹 ∧ 𝐹 ⊆ 𝒫 𝑋)})
19	5, 18	mpd3an3 1465	1 ⊢ ((𝐽 ∈ Top ∧ 𝐹 ∈ ∪ ran Fil) → (𝐽 fLim 𝐹) = {𝑥 ∈ 𝑋 ∣ (((nei‘𝐽)‘{𝑥}) ⊆ 𝐹 ∧ 𝐹 ⊆ 𝒫 𝑋)})

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1542   ∈ wcel 2114  {crab 3390  Vcvv 3430   ⊆ wss 3890  𝒫 cpw 4542  {csn 4568  ∪ cuni 4851  ran crn 5625  ‘cfv 6492  (class class class)co 7360  Topctop 22868  neicnei 23072  Filcfil 23820   fLim cflim 23909

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5231  ax-pr 5370

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ral 3053  df-rex 3063  df-rab 3391  df-v 3432  df-sbc 3730  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-br 5087  df-opab 5149  df-id 5519  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-iota 6448  df-fun 6494  df-fv 6500  df-ov 7363  df-oprab 7364  df-mpo 7365  df-top 22869  df-flim 23914

This theorem is referenced by:  elflim2  23939