Theorem isfcf 24408

Description: The property of being a cluster point of a function. (Contributed by Jeff Hankins, 24-Nov-2009.) (Revised by Stefan O'Rear, 9-Aug-2015.)

Assertion

Ref	Expression
isfcf	⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐿 ∈ (Fil‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → (𝐴 ∈ ((𝐽 fClusf 𝐿)‘𝐹) ↔ (𝐴 ∈ 𝑋 ∧ ∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 → ∀𝑠 ∈ 𝐿 (𝑜 ∩ (𝐹 “ 𝑠)) ≠ ∅))))

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

Allowed substitution hint:   𝐴(𝑠)

Proof of Theorem isfcf

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		fcfval 24407	. . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐿 ∈ (Fil‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → ((𝐽 fClusf 𝐿)‘𝐹) = (𝐽 fClus ((𝑋 FilMap 𝐹)‘𝐿)))
2	1	eleq2d 2850	. 2 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐿 ∈ (Fil‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → (𝐴 ∈ ((𝐽 fClusf 𝐿)‘𝐹) ↔ 𝐴 ∈ (𝐽 fClus ((𝑋 FilMap 𝐹)‘𝐿))))
3		simp1 1154	. . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐿 ∈ (Fil‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → 𝐽 ∈ (TopOn‘𝑋))
4		toponmax 23299	. . . 4 ⊢ (𝐽 ∈ (TopOn‘𝑋) → 𝑋 ∈ 𝐽)
5		filfbas 24222	. . . 4 ⊢ (𝐿 ∈ (Fil‘𝑌) → 𝐿 ∈ (fBas‘𝑌))
6		id 23	. . . 4 ⊢ (𝐹:𝑌⟶𝑋 → 𝐹:𝑌⟶𝑋)
7		fmfil 24318	. . . 4 ⊢ ((𝑋 ∈ 𝐽 ∧ 𝐿 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → ((𝑋 FilMap 𝐹)‘𝐿) ∈ (Fil‘𝑋))
8	4, 5, 6, 7	syl3an 1178	. . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐿 ∈ (Fil‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → ((𝑋 FilMap 𝐹)‘𝐿) ∈ (Fil‘𝑋))
9		fclsopn 24388	. . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ ((𝑋 FilMap 𝐹)‘𝐿) ∈ (Fil‘𝑋)) → (𝐴 ∈ (𝐽 fClus ((𝑋 FilMap 𝐹)‘𝐿)) ↔ (𝐴 ∈ 𝑋 ∧ ∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 → ∀𝑥 ∈ ((𝑋 FilMap 𝐹)‘𝐿)(𝑜 ∩ 𝑥) ≠ ∅))))
10	3, 8, 9	syl2anc 596	. 2 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐿 ∈ (Fil‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → (𝐴 ∈ (𝐽 fClus ((𝑋 FilMap 𝐹)‘𝐿)) ↔ (𝐴 ∈ 𝑋 ∧ ∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 → ∀𝑥 ∈ ((𝑋 FilMap 𝐹)‘𝐿)(𝑜 ∩ 𝑥) ≠ ∅))))
11		simpll1 1231	. . . . . . . . . 10 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐿 ∈ (Fil‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝑜 ∈ 𝐽) ∧ 𝑠 ∈ 𝐿) → 𝐽 ∈ (TopOn‘𝑋))
12	11, 4	syl 18	. . . . . . . . 9 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐿 ∈ (Fil‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝑜 ∈ 𝐽) ∧ 𝑠 ∈ 𝐿) → 𝑋 ∈ 𝐽)
13		simpll2 1232	. . . . . . . . . 10 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐿 ∈ (Fil‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝑜 ∈ 𝐽) ∧ 𝑠 ∈ 𝐿) → 𝐿 ∈ (Fil‘𝑌))
14	13, 5	syl 18	. . . . . . . . 9 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐿 ∈ (Fil‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝑜 ∈ 𝐽) ∧ 𝑠 ∈ 𝐿) → 𝐿 ∈ (fBas‘𝑌))
15		simpll3 1233	. . . . . . . . 9 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐿 ∈ (Fil‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝑜 ∈ 𝐽) ∧ 𝑠 ∈ 𝐿) → 𝐹:𝑌⟶𝑋)
16		simpl2 1211	. . . . . . . . . . . 12 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐿 ∈ (Fil‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝑜 ∈ 𝐽) → 𝐿 ∈ (Fil‘𝑌))
17		fgfil 24249	. . . . . . . . . . . 12 ⊢ (𝐿 ∈ (Fil‘𝑌) → (𝑌filGen𝐿) = 𝐿)
18	16, 17	syl 18	. . . . . . . . . . 11 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐿 ∈ (Fil‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝑜 ∈ 𝐽) → (𝑌filGen𝐿) = 𝐿)
19	18	eleq2d 2850	. . . . . . . . . 10 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐿 ∈ (Fil‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝑜 ∈ 𝐽) → (𝑠 ∈ (𝑌filGen𝐿) ↔ 𝑠 ∈ 𝐿))
20	19	biimpar 483	. . . . . . . . 9 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐿 ∈ (Fil‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝑜 ∈ 𝐽) ∧ 𝑠 ∈ 𝐿) → 𝑠 ∈ (𝑌filGen𝐿))
21		eqid 2763	. . . . . . . . . 10 ⊢ (𝑌filGen𝐿) = (𝑌filGen𝐿)
22	21	imaelfm 24325	. . . . . . . . 9 ⊢ (((𝑋 ∈ 𝐽 ∧ 𝐿 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝑠 ∈ (𝑌filGen𝐿)) → (𝐹 “ 𝑠) ∈ ((𝑋 FilMap 𝐹)‘𝐿))
23	12, 14, 15, 20, 22	syl31anc 1401	. . . . . . . 8 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐿 ∈ (Fil‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝑜 ∈ 𝐽) ∧ 𝑠 ∈ 𝐿) → (𝐹 “ 𝑠) ∈ ((𝑋 FilMap 𝐹)‘𝐿))
24		ineq2 4114	. . . . . . . . . 10 ⊢ (𝑥 = (𝐹 “ 𝑠) → (𝑜 ∩ 𝑥) = (𝑜 ∩ (𝐹 “ 𝑠)))
25	24	neeq1d 3018	. . . . . . . . 9 ⊢ (𝑥 = (𝐹 “ 𝑠) → ((𝑜 ∩ 𝑥) ≠ ∅ ↔ (𝑜 ∩ (𝐹 “ 𝑠)) ≠ ∅))
26	25	rspcv 3576	. . . . . . . 8 ⊢ ((𝐹 “ 𝑠) ∈ ((𝑋 FilMap 𝐹)‘𝐿) → (∀𝑥 ∈ ((𝑋 FilMap 𝐹)‘𝐿)(𝑜 ∩ 𝑥) ≠ ∅ → (𝑜 ∩ (𝐹 “ 𝑠)) ≠ ∅))
27	23, 26	syl 18	. . . . . . 7 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐿 ∈ (Fil‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝑜 ∈ 𝐽) ∧ 𝑠 ∈ 𝐿) → (∀𝑥 ∈ ((𝑋 FilMap 𝐹)‘𝐿)(𝑜 ∩ 𝑥) ≠ ∅ → (𝑜 ∩ (𝐹 “ 𝑠)) ≠ ∅))
28	27	ralrimdva 3166	. . . . . 6 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐿 ∈ (Fil‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝑜 ∈ 𝐽) → (∀𝑥 ∈ ((𝑋 FilMap 𝐹)‘𝐿)(𝑜 ∩ 𝑥) ≠ ∅ → ∀𝑠 ∈ 𝐿 (𝑜 ∩ (𝐹 “ 𝑠)) ≠ ∅))
29		elfm 24321	. . . . . . . . . . 11 ⊢ ((𝑋 ∈ 𝐽 ∧ 𝐿 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → (𝑥 ∈ ((𝑋 FilMap 𝐹)‘𝐿) ↔ (𝑥 ⊆ 𝑋 ∧ ∃𝑠 ∈ 𝐿 (𝐹 “ 𝑠) ⊆ 𝑥)))
30	4, 5, 6, 29	syl3an 1178	. . . . . . . . . 10 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐿 ∈ (Fil‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → (𝑥 ∈ ((𝑋 FilMap 𝐹)‘𝐿) ↔ (𝑥 ⊆ 𝑋 ∧ ∃𝑠 ∈ 𝐿 (𝐹 “ 𝑠) ⊆ 𝑥)))
31	30	adantr 486	. . . . . . . . 9 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐿 ∈ (Fil‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝑜 ∈ 𝐽) → (𝑥 ∈ ((𝑋 FilMap 𝐹)‘𝐿) ↔ (𝑥 ⊆ 𝑋 ∧ ∃𝑠 ∈ 𝐿 (𝐹 “ 𝑠) ⊆ 𝑥)))
32	31	simplbda 505	. . . . . . . 8 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐿 ∈ (Fil‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝑜 ∈ 𝐽) ∧ 𝑥 ∈ ((𝑋 FilMap 𝐹)‘𝐿)) → ∃𝑠 ∈ 𝐿 (𝐹 “ 𝑠) ⊆ 𝑥)
33		r19.29r 3130	. . . . . . . . . 10 ⊢ ((∃𝑠 ∈ 𝐿 (𝐹 “ 𝑠) ⊆ 𝑥 ∧ ∀𝑠 ∈ 𝐿 (𝑜 ∩ (𝐹 “ 𝑠)) ≠ ∅) → ∃𝑠 ∈ 𝐿 ((𝐹 “ 𝑠) ⊆ 𝑥 ∧ (𝑜 ∩ (𝐹 “ 𝑠)) ≠ ∅))
34		sslin 4142	. . . . . . . . . . . 12 ⊢ ((𝐹 “ 𝑠) ⊆ 𝑥 → (𝑜 ∩ (𝐹 “ 𝑠)) ⊆ (𝑜 ∩ 𝑥))
35		ssn0 4358	. . . . . . . . . . . 12 ⊢ (((𝑜 ∩ (𝐹 “ 𝑠)) ⊆ (𝑜 ∩ 𝑥) ∧ (𝑜 ∩ (𝐹 “ 𝑠)) ≠ ∅) → (𝑜 ∩ 𝑥) ≠ ∅)
36	34, 35	sylan 592	. . . . . . . . . . 11 ⊢ (((𝐹 “ 𝑠) ⊆ 𝑥 ∧ (𝑜 ∩ (𝐹 “ 𝑠)) ≠ ∅) → (𝑜 ∩ 𝑥) ≠ ∅)
37	36	rexlimivw 3163	. . . . . . . . . 10 ⊢ (∃𝑠 ∈ 𝐿 ((𝐹 “ 𝑠) ⊆ 𝑥 ∧ (𝑜 ∩ (𝐹 “ 𝑠)) ≠ ∅) → (𝑜 ∩ 𝑥) ≠ ∅)
38	33, 37	syl 18	. . . . . . . . 9 ⊢ ((∃𝑠 ∈ 𝐿 (𝐹 “ 𝑠) ⊆ 𝑥 ∧ ∀𝑠 ∈ 𝐿 (𝑜 ∩ (𝐹 “ 𝑠)) ≠ ∅) → (𝑜 ∩ 𝑥) ≠ ∅)
39	38	ex 418	. . . . . . . 8 ⊢ (∃𝑠 ∈ 𝐿 (𝐹 “ 𝑠) ⊆ 𝑥 → (∀𝑠 ∈ 𝐿 (𝑜 ∩ (𝐹 “ 𝑠)) ≠ ∅ → (𝑜 ∩ 𝑥) ≠ ∅))
40	32, 39	syl 18	. . . . . . 7 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐿 ∈ (Fil‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝑜 ∈ 𝐽) ∧ 𝑥 ∈ ((𝑋 FilMap 𝐹)‘𝐿)) → (∀𝑠 ∈ 𝐿 (𝑜 ∩ (𝐹 “ 𝑠)) ≠ ∅ → (𝑜 ∩ 𝑥) ≠ ∅))
41	40	ralrimdva 3166	. . . . . 6 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐿 ∈ (Fil‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝑜 ∈ 𝐽) → (∀𝑠 ∈ 𝐿 (𝑜 ∩ (𝐹 “ 𝑠)) ≠ ∅ → ∀𝑥 ∈ ((𝑋 FilMap 𝐹)‘𝐿)(𝑜 ∩ 𝑥) ≠ ∅))
42	28, 41	impbid 215	. . . . 5 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐿 ∈ (Fil‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝑜 ∈ 𝐽) → (∀𝑥 ∈ ((𝑋 FilMap 𝐹)‘𝐿)(𝑜 ∩ 𝑥) ≠ ∅ ↔ ∀𝑠 ∈ 𝐿 (𝑜 ∩ (𝐹 “ 𝑠)) ≠ ∅))
43	42	imbi2d 343	. . . 4 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐿 ∈ (Fil‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝑜 ∈ 𝐽) → ((𝐴 ∈ 𝑜 → ∀𝑥 ∈ ((𝑋 FilMap 𝐹)‘𝐿)(𝑜 ∩ 𝑥) ≠ ∅) ↔ (𝐴 ∈ 𝑜 → ∀𝑠 ∈ 𝐿 (𝑜 ∩ (𝐹 “ 𝑠)) ≠ ∅)))
44	43	ralbidva 3187	. . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐿 ∈ (Fil‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → (∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 → ∀𝑥 ∈ ((𝑋 FilMap 𝐹)‘𝐿)(𝑜 ∩ 𝑥) ≠ ∅) ↔ ∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 → ∀𝑠 ∈ 𝐿 (𝑜 ∩ (𝐹 “ 𝑠)) ≠ ∅)))
45	44	anbi2d 642	. 2 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐿 ∈ (Fil‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → ((𝐴 ∈ 𝑋 ∧ ∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 → ∀𝑥 ∈ ((𝑋 FilMap 𝐹)‘𝐿)(𝑜 ∩ 𝑥) ≠ ∅)) ↔ (𝐴 ∈ 𝑋 ∧ ∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 → ∀𝑠 ∈ 𝐿 (𝑜 ∩ (𝐹 “ 𝑠)) ≠ ∅))))
46	2, 10, 45	3bitrd 308	1 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐿 ∈ (Fil‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → (𝐴 ∈ ((𝐽 fClusf 𝐿)‘𝐹) ↔ (𝐴 ∈ 𝑋 ∧ ∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 → ∀𝑠 ∈ 𝐿 (𝑜 ∩ (𝐹 “ 𝑠)) ≠ ∅))))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147   ≠ wne 2959  ∀wral 3080  ∃wrex 3090   ⊆ wss 3900   ∩ cin 4092  ∅c0 4281   “ cima 5661  ⟶wf 6562  ‘cfv 6566  (class class class)co 7451  fBascfbas 21717  filGencfg 21718  TopOnctopon 23283  Filcfil 24219   FilMap cfm 24307   fClus cfcls 24310   fClusf cfcf 24311

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5238  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-nel 3066  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-int 4913  df-iun 4958  df-iin 4959  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-ov 7454  df-oprab 7455  df-mpo 7456  df-map 8887  df-fbas 21726  df-fg 21727  df-top 23267  df-topon 23284  df-cld 23392  df-ntr 23393  df-cls 23394  df-fil 24220  df-fm 24312  df-fcls 24315  df-fcf 24316

This theorem is used by:  fcfnei  24409