Theorem fclsval 23951

Description: The set of all cluster points of a filter. (Contributed by Jeff Hankins, 10-Nov-2009.) (Revised by Stefan O'Rear, 8-Aug-2015.)

Hypothesis

Ref	Expression
fclsval.x	⊢ 𝑋 = ∪ 𝐽

Assertion

Ref	Expression
fclsval	⊢ ((𝐽 ∈ Top ∧ 𝐹 ∈ (Fil‘𝑌)) → (𝐽 fClus 𝐹) = if(𝑋 = 𝑌, ∩ 𝑡 ∈ 𝐹 ((cls‘𝐽)‘𝑡), ∅))

Distinct variable groups:   𝑡,𝐹   𝑡,𝐽

Allowed substitution hints:   𝑋(𝑡)   𝑌(𝑡)

Proof of Theorem fclsval

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

Step	Hyp	Ref	Expression
1		simpl 482	. . 3 ⊢ ((𝐽 ∈ Top ∧ 𝐹 ∈ (Fil‘𝑌)) → 𝐽 ∈ Top)
2		fvssunirn 6914	. . . . 5 ⊢ (Fil‘𝑌) ⊆ ∪ ran Fil
3	2	sseli 3959	. . . 4 ⊢ (𝐹 ∈ (Fil‘𝑌) → 𝐹 ∈ ∪ ran Fil)
4	3	adantl 481	. . 3 ⊢ ((𝐽 ∈ Top ∧ 𝐹 ∈ (Fil‘𝑌)) → 𝐹 ∈ ∪ ran Fil)
5		filn0 23805	. . . . . 6 ⊢ (𝐹 ∈ (Fil‘𝑌) → 𝐹 ≠ ∅)
6	5	adantl 481	. . . . 5 ⊢ ((𝐽 ∈ Top ∧ 𝐹 ∈ (Fil‘𝑌)) → 𝐹 ≠ ∅)
7		fvex 6894	. . . . . 6 ⊢ ((cls‘𝐽)‘𝑡) ∈ V
8	7	rgenw 3056	. . . . 5 ⊢ ∀𝑡 ∈ 𝐹 ((cls‘𝐽)‘𝑡) ∈ V
9		iinexg 5323	. . . . 5 ⊢ ((𝐹 ≠ ∅ ∧ ∀𝑡 ∈ 𝐹 ((cls‘𝐽)‘𝑡) ∈ V) → ∩ 𝑡 ∈ 𝐹 ((cls‘𝐽)‘𝑡) ∈ V)
10	6, 8, 9	sylancl 586	. . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝐹 ∈ (Fil‘𝑌)) → ∩ 𝑡 ∈ 𝐹 ((cls‘𝐽)‘𝑡) ∈ V)
11		0ex 5282	. . . 4 ⊢ ∅ ∈ V
12		ifcl 4551	. . . 4 ⊢ ((∩ 𝑡 ∈ 𝐹 ((cls‘𝐽)‘𝑡) ∈ V ∧ ∅ ∈ V) → if(𝑋 = ∪ 𝐹, ∩ 𝑡 ∈ 𝐹 ((cls‘𝐽)‘𝑡), ∅) ∈ V)
13	10, 11, 12	sylancl 586	. . 3 ⊢ ((𝐽 ∈ Top ∧ 𝐹 ∈ (Fil‘𝑌)) → if(𝑋 = ∪ 𝐹, ∩ 𝑡 ∈ 𝐹 ((cls‘𝐽)‘𝑡), ∅) ∈ V)
14		unieq 4899	. . . . . . 7 ⊢ (𝑗 = 𝐽 → ∪ 𝑗 = ∪ 𝐽)
15		fclsval.x	. . . . . . 7 ⊢ 𝑋 = ∪ 𝐽
16	14, 15	eqtr4di 2789	. . . . . 6 ⊢ (𝑗 = 𝐽 → ∪ 𝑗 = 𝑋)
17		unieq 4899	. . . . . 6 ⊢ (𝑓 = 𝐹 → ∪ 𝑓 = ∪ 𝐹)
18	16, 17	eqeqan12d 2750	. . . . 5 ⊢ ((𝑗 = 𝐽 ∧ 𝑓 = 𝐹) → (∪ 𝑗 = ∪ 𝑓 ↔ 𝑋 = ∪ 𝐹))
19		iineq1 4990	. . . . . . 7 ⊢ (𝑓 = 𝐹 → ∩ 𝑡 ∈ 𝑓 ((cls‘𝑗)‘𝑡) = ∩ 𝑡 ∈ 𝐹 ((cls‘𝑗)‘𝑡))
20	19	adantl 481	. . . . . 6 ⊢ ((𝑗 = 𝐽 ∧ 𝑓 = 𝐹) → ∩ 𝑡 ∈ 𝑓 ((cls‘𝑗)‘𝑡) = ∩ 𝑡 ∈ 𝐹 ((cls‘𝑗)‘𝑡))
21		simpll 766	. . . . . . . . 9 ⊢ (((𝑗 = 𝐽 ∧ 𝑓 = 𝐹) ∧ 𝑡 ∈ 𝐹) → 𝑗 = 𝐽)
22	21	fveq2d 6885	. . . . . . . 8 ⊢ (((𝑗 = 𝐽 ∧ 𝑓 = 𝐹) ∧ 𝑡 ∈ 𝐹) → (cls‘𝑗) = (cls‘𝐽))
23	22	fveq1d 6883	. . . . . . 7 ⊢ (((𝑗 = 𝐽 ∧ 𝑓 = 𝐹) ∧ 𝑡 ∈ 𝐹) → ((cls‘𝑗)‘𝑡) = ((cls‘𝐽)‘𝑡))
24	23	iineq2dv 4998	. . . . . 6 ⊢ ((𝑗 = 𝐽 ∧ 𝑓 = 𝐹) → ∩ 𝑡 ∈ 𝐹 ((cls‘𝑗)‘𝑡) = ∩ 𝑡 ∈ 𝐹 ((cls‘𝐽)‘𝑡))
25	20, 24	eqtrd 2771	. . . . 5 ⊢ ((𝑗 = 𝐽 ∧ 𝑓 = 𝐹) → ∩ 𝑡 ∈ 𝑓 ((cls‘𝑗)‘𝑡) = ∩ 𝑡 ∈ 𝐹 ((cls‘𝐽)‘𝑡))
26	18, 25	ifbieq1d 4530	. . . 4 ⊢ ((𝑗 = 𝐽 ∧ 𝑓 = 𝐹) → if(∪ 𝑗 = ∪ 𝑓, ∩ 𝑡 ∈ 𝑓 ((cls‘𝑗)‘𝑡), ∅) = if(𝑋 = ∪ 𝐹, ∩ 𝑡 ∈ 𝐹 ((cls‘𝐽)‘𝑡), ∅))
27		df-fcls 23884	. . . 4 ⊢ fClus = (𝑗 ∈ Top, 𝑓 ∈ ∪ ran Fil ↦ if(∪ 𝑗 = ∪ 𝑓, ∩ 𝑡 ∈ 𝑓 ((cls‘𝑗)‘𝑡), ∅))
28	26, 27	ovmpoga 7566	. . 3 ⊢ ((𝐽 ∈ Top ∧ 𝐹 ∈ ∪ ran Fil ∧ if(𝑋 = ∪ 𝐹, ∩ 𝑡 ∈ 𝐹 ((cls‘𝐽)‘𝑡), ∅) ∈ V) → (𝐽 fClus 𝐹) = if(𝑋 = ∪ 𝐹, ∩ 𝑡 ∈ 𝐹 ((cls‘𝐽)‘𝑡), ∅))
29	1, 4, 13, 28	syl3anc 1373	. 2 ⊢ ((𝐽 ∈ Top ∧ 𝐹 ∈ (Fil‘𝑌)) → (𝐽 fClus 𝐹) = if(𝑋 = ∪ 𝐹, ∩ 𝑡 ∈ 𝐹 ((cls‘𝐽)‘𝑡), ∅))
30		filunibas 23824	. . . . 5 ⊢ (𝐹 ∈ (Fil‘𝑌) → ∪ 𝐹 = 𝑌)
31	30	eqeq2d 2747	. . . 4 ⊢ (𝐹 ∈ (Fil‘𝑌) → (𝑋 = ∪ 𝐹 ↔ 𝑋 = 𝑌))
32	31	adantl 481	. . 3 ⊢ ((𝐽 ∈ Top ∧ 𝐹 ∈ (Fil‘𝑌)) → (𝑋 = ∪ 𝐹 ↔ 𝑋 = 𝑌))
33	32	ifbid 4529	. 2 ⊢ ((𝐽 ∈ Top ∧ 𝐹 ∈ (Fil‘𝑌)) → if(𝑋 = ∪ 𝐹, ∩ 𝑡 ∈ 𝐹 ((cls‘𝐽)‘𝑡), ∅) = if(𝑋 = 𝑌, ∩ 𝑡 ∈ 𝐹 ((cls‘𝐽)‘𝑡), ∅))
34	29, 33	eqtrd 2771	1 ⊢ ((𝐽 ∈ Top ∧ 𝐹 ∈ (Fil‘𝑌)) → (𝐽 fClus 𝐹) = if(𝑋 = 𝑌, ∩ 𝑡 ∈ 𝐹 ((cls‘𝐽)‘𝑡), ∅))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1540   ∈ wcel 2109   ≠ wne 2933  ∀wral 3052  Vcvv 3464  ∅c0 4313  ifcif 4505  ∪ cuni 4888  ∩ ciin 4973  ran crn 5660  ‘cfv 6536  (class class class)co 7410  Topctop 22836  clsccl 22961  Filcfil 23788   fClus cfcls 23879

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2708  ax-sep 5271  ax-nul 5281  ax-pow 5340  ax-pr 5407

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2540  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2810  df-nfc 2886  df-ne 2934  df-nel 3038  df-ral 3053  df-rex 3062  df-rab 3421  df-v 3466  df-sbc 3771  df-csb 3880  df-dif 3934  df-un 3936  df-in 3938  df-ss 3948  df-nul 4314  df-if 4506  df-pw 4582  df-sn 4607  df-pr 4609  df-op 4613  df-uni 4889  df-int 4928  df-iin 4975  df-br 5125  df-opab 5187  df-mpt 5207  df-id 5553  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-iota 6489  df-fun 6538  df-fv 6544  df-ov 7413  df-oprab 7414  df-mpo 7415  df-fbas 21317  df-fil 23789  df-fcls 23884

This theorem is referenced by:  isfcls  23952  fclscmpi  23972