Theorem cnpfcfi 24359

Description: Lemma for cnpfcf 24360. If a function is continuous at a point, it respects clustering there. (Contributed by Jeff Hankins, 20-Nov-2009.) (Revised by Stefan O'Rear, 9-Aug-2015.)

Assertion

Ref	Expression
cnpfcfi	⊢ ((𝐾 ∈ Top ∧ 𝐴 ∈ (𝐽 fClus 𝐿) ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐴)) → (𝐹‘𝐴) ∈ ((𝐾 fClusf 𝐿)‘𝐹))

Proof of Theorem cnpfcfi

Dummy variable 𝑓 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		simp2 1155	. . 3 ⊢ ((𝐾 ∈ Top ∧ 𝐴 ∈ (𝐽 fClus 𝐿) ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐴)) → 𝐴 ∈ (𝐽 fClus 𝐿))
2		eqid 2760	. . . . . 6 ⊢ ∪ 𝐽 = ∪ 𝐽
3	2	fclsfil 24329	. . . . 5 ⊢ (𝐴 ∈ (𝐽 fClus 𝐿) → 𝐿 ∈ (Fil‘∪ 𝐽))
4	3	3ad2ant2 1152	. . . 4 ⊢ ((𝐾 ∈ Top ∧ 𝐴 ∈ (𝐽 fClus 𝐿) ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐴)) → 𝐿 ∈ (Fil‘∪ 𝐽))
5		fclsfnflim 24346	. . . 4 ⊢ (𝐿 ∈ (Fil‘∪ 𝐽) → (𝐴 ∈ (𝐽 fClus 𝐿) ↔ ∃𝑓 ∈ (Fil‘∪ 𝐽)(𝐿 ⊆ 𝑓 ∧ 𝐴 ∈ (𝐽 fLim 𝑓))))
6	4, 5	syl 18	. . 3 ⊢ ((𝐾 ∈ Top ∧ 𝐴 ∈ (𝐽 fClus 𝐿) ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐴)) → (𝐴 ∈ (𝐽 fClus 𝐿) ↔ ∃𝑓 ∈ (Fil‘∪ 𝐽)(𝐿 ⊆ 𝑓 ∧ 𝐴 ∈ (𝐽 fLim 𝑓))))
7	1, 6	mpbid 235	. 2 ⊢ ((𝐾 ∈ Top ∧ 𝐴 ∈ (𝐽 fClus 𝐿) ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐴)) → ∃𝑓 ∈ (Fil‘∪ 𝐽)(𝐿 ⊆ 𝑓 ∧ 𝐴 ∈ (𝐽 fLim 𝑓)))
8		simpl1 1210	. . . . . 6 ⊢ (((𝐾 ∈ Top ∧ 𝐴 ∈ (𝐽 fClus 𝐿) ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐴)) ∧ (𝑓 ∈ (Fil‘∪ 𝐽) ∧ (𝐿 ⊆ 𝑓 ∧ 𝐴 ∈ (𝐽 fLim 𝑓)))) → 𝐾 ∈ Top)
9		toptopon2 23236	. . . . . 6 ⊢ (𝐾 ∈ Top ↔ 𝐾 ∈ (TopOn‘∪ 𝐾))
10	8, 9	sylib 221	. . . . 5 ⊢ (((𝐾 ∈ Top ∧ 𝐴 ∈ (𝐽 fClus 𝐿) ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐴)) ∧ (𝑓 ∈ (Fil‘∪ 𝐽) ∧ (𝐿 ⊆ 𝑓 ∧ 𝐴 ∈ (𝐽 fLim 𝑓)))) → 𝐾 ∈ (TopOn‘∪ 𝐾))
11		simprl 783	. . . . 5 ⊢ (((𝐾 ∈ Top ∧ 𝐴 ∈ (𝐽 fClus 𝐿) ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐴)) ∧ (𝑓 ∈ (Fil‘∪ 𝐽) ∧ (𝐿 ⊆ 𝑓 ∧ 𝐴 ∈ (𝐽 fLim 𝑓)))) → 𝑓 ∈ (Fil‘∪ 𝐽))
12		eqid 2760	. . . . . . . 8 ⊢ ∪ 𝐾 = ∪ 𝐾
13	2, 12	cnpf 23565	. . . . . . 7 ⊢ (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐴) → 𝐹:∪ 𝐽⟶∪ 𝐾)
14	13	3ad2ant3 1153	. . . . . 6 ⊢ ((𝐾 ∈ Top ∧ 𝐴 ∈ (𝐽 fClus 𝐿) ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐴)) → 𝐹:∪ 𝐽⟶∪ 𝐾)
15	14	adantr 486	. . . . 5 ⊢ (((𝐾 ∈ Top ∧ 𝐴 ∈ (𝐽 fClus 𝐿) ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐴)) ∧ (𝑓 ∈ (Fil‘∪ 𝐽) ∧ (𝐿 ⊆ 𝑓 ∧ 𝐴 ∈ (𝐽 fLim 𝑓)))) → 𝐹:∪ 𝐽⟶∪ 𝐾)
16		flfssfcf 24357	. . . . 5 ⊢ ((𝐾 ∈ (TopOn‘∪ 𝐾) ∧ 𝑓 ∈ (Fil‘∪ 𝐽) ∧ 𝐹:∪ 𝐽⟶∪ 𝐾) → ((𝐾 fLimf 𝑓)‘𝐹) ⊆ ((𝐾 fClusf 𝑓)‘𝐹))
17	10, 11, 15, 16	syl3anc 1398	. . . 4 ⊢ (((𝐾 ∈ Top ∧ 𝐴 ∈ (𝐽 fClus 𝐿) ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐴)) ∧ (𝑓 ∈ (Fil‘∪ 𝐽) ∧ (𝐿 ⊆ 𝑓 ∧ 𝐴 ∈ (𝐽 fLim 𝑓)))) → ((𝐾 fLimf 𝑓)‘𝐹) ⊆ ((𝐾 fClusf 𝑓)‘𝐹))
18	12	topopn 23224	. . . . . . . 8 ⊢ (𝐾 ∈ Top → ∪ 𝐾 ∈ 𝐾)
19	8, 18	syl 18	. . . . . . 7 ⊢ (((𝐾 ∈ Top ∧ 𝐴 ∈ (𝐽 fClus 𝐿) ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐴)) ∧ (𝑓 ∈ (Fil‘∪ 𝐽) ∧ (𝐿 ⊆ 𝑓 ∧ 𝐴 ∈ (𝐽 fLim 𝑓)))) → ∪ 𝐾 ∈ 𝐾)
20	4	adantr 486	. . . . . . . 8 ⊢ (((𝐾 ∈ Top ∧ 𝐴 ∈ (𝐽 fClus 𝐿) ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐴)) ∧ (𝑓 ∈ (Fil‘∪ 𝐽) ∧ (𝐿 ⊆ 𝑓 ∧ 𝐴 ∈ (𝐽 fLim 𝑓)))) → 𝐿 ∈ (Fil‘∪ 𝐽))
21		filfbas 24167	. . . . . . . 8 ⊢ (𝐿 ∈ (Fil‘∪ 𝐽) → 𝐿 ∈ (fBas‘∪ 𝐽))
22	20, 21	syl 18	. . . . . . 7 ⊢ (((𝐾 ∈ Top ∧ 𝐴 ∈ (𝐽 fClus 𝐿) ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐴)) ∧ (𝑓 ∈ (Fil‘∪ 𝐽) ∧ (𝐿 ⊆ 𝑓 ∧ 𝐴 ∈ (𝐽 fLim 𝑓)))) → 𝐿 ∈ (fBas‘∪ 𝐽))
23		fmfil 24263	. . . . . . 7 ⊢ ((∪ 𝐾 ∈ 𝐾 ∧ 𝐿 ∈ (fBas‘∪ 𝐽) ∧ 𝐹:∪ 𝐽⟶∪ 𝐾) → ((∪ 𝐾 FilMap 𝐹)‘𝐿) ∈ (Fil‘∪ 𝐾))
24	19, 22, 15, 23	syl3anc 1398	. . . . . 6 ⊢ (((𝐾 ∈ Top ∧ 𝐴 ∈ (𝐽 fClus 𝐿) ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐴)) ∧ (𝑓 ∈ (Fil‘∪ 𝐽) ∧ (𝐿 ⊆ 𝑓 ∧ 𝐴 ∈ (𝐽 fLim 𝑓)))) → ((∪ 𝐾 FilMap 𝐹)‘𝐿) ∈ (Fil‘∪ 𝐾))
25		filfbas 24167	. . . . . . . 8 ⊢ (𝑓 ∈ (Fil‘∪ 𝐽) → 𝑓 ∈ (fBas‘∪ 𝐽))
26	25	ad2antrl 741	. . . . . . 7 ⊢ (((𝐾 ∈ Top ∧ 𝐴 ∈ (𝐽 fClus 𝐿) ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐴)) ∧ (𝑓 ∈ (Fil‘∪ 𝐽) ∧ (𝐿 ⊆ 𝑓 ∧ 𝐴 ∈ (𝐽 fLim 𝑓)))) → 𝑓 ∈ (fBas‘∪ 𝐽))
27		simprrl 793	. . . . . . 7 ⊢ (((𝐾 ∈ Top ∧ 𝐴 ∈ (𝐽 fClus 𝐿) ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐴)) ∧ (𝑓 ∈ (Fil‘∪ 𝐽) ∧ (𝐿 ⊆ 𝑓 ∧ 𝐴 ∈ (𝐽 fLim 𝑓)))) → 𝐿 ⊆ 𝑓)
28		fmss 24265	. . . . . . 7 ⊢ (((∪ 𝐾 ∈ 𝐾 ∧ 𝐿 ∈ (fBas‘∪ 𝐽) ∧ 𝑓 ∈ (fBas‘∪ 𝐽)) ∧ (𝐹:∪ 𝐽⟶∪ 𝐾 ∧ 𝐿 ⊆ 𝑓)) → ((∪ 𝐾 FilMap 𝐹)‘𝐿) ⊆ ((∪ 𝐾 FilMap 𝐹)‘𝑓))
29	19, 22, 26, 15, 27, 28	syl32anc 1405	. . . . . 6 ⊢ (((𝐾 ∈ Top ∧ 𝐴 ∈ (𝐽 fClus 𝐿) ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐴)) ∧ (𝑓 ∈ (Fil‘∪ 𝐽) ∧ (𝐿 ⊆ 𝑓 ∧ 𝐴 ∈ (𝐽 fLim 𝑓)))) → ((∪ 𝐾 FilMap 𝐹)‘𝐿) ⊆ ((∪ 𝐾 FilMap 𝐹)‘𝑓))
30		fclsss2 24342	. . . . . 6 ⊢ ((𝐾 ∈ (TopOn‘∪ 𝐾) ∧ ((∪ 𝐾 FilMap 𝐹)‘𝐿) ∈ (Fil‘∪ 𝐾) ∧ ((∪ 𝐾 FilMap 𝐹)‘𝐿) ⊆ ((∪ 𝐾 FilMap 𝐹)‘𝑓)) → (𝐾 fClus ((∪ 𝐾 FilMap 𝐹)‘𝑓)) ⊆ (𝐾 fClus ((∪ 𝐾 FilMap 𝐹)‘𝐿)))
31	10, 24, 29, 30	syl3anc 1398	. . . . 5 ⊢ (((𝐾 ∈ Top ∧ 𝐴 ∈ (𝐽 fClus 𝐿) ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐴)) ∧ (𝑓 ∈ (Fil‘∪ 𝐽) ∧ (𝐿 ⊆ 𝑓 ∧ 𝐴 ∈ (𝐽 fLim 𝑓)))) → (𝐾 fClus ((∪ 𝐾 FilMap 𝐹)‘𝑓)) ⊆ (𝐾 fClus ((∪ 𝐾 FilMap 𝐹)‘𝐿)))
32		fcfval 24352	. . . . . 6 ⊢ ((𝐾 ∈ (TopOn‘∪ 𝐾) ∧ 𝑓 ∈ (Fil‘∪ 𝐽) ∧ 𝐹:∪ 𝐽⟶∪ 𝐾) → ((𝐾 fClusf 𝑓)‘𝐹) = (𝐾 fClus ((∪ 𝐾 FilMap 𝐹)‘𝑓)))
33	10, 11, 15, 32	syl3anc 1398	. . . . 5 ⊢ (((𝐾 ∈ Top ∧ 𝐴 ∈ (𝐽 fClus 𝐿) ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐴)) ∧ (𝑓 ∈ (Fil‘∪ 𝐽) ∧ (𝐿 ⊆ 𝑓 ∧ 𝐴 ∈ (𝐽 fLim 𝑓)))) → ((𝐾 fClusf 𝑓)‘𝐹) = (𝐾 fClus ((∪ 𝐾 FilMap 𝐹)‘𝑓)))
34		fcfval 24352	. . . . . 6 ⊢ ((𝐾 ∈ (TopOn‘∪ 𝐾) ∧ 𝐿 ∈ (Fil‘∪ 𝐽) ∧ 𝐹:∪ 𝐽⟶∪ 𝐾) → ((𝐾 fClusf 𝐿)‘𝐹) = (𝐾 fClus ((∪ 𝐾 FilMap 𝐹)‘𝐿)))
35	10, 20, 15, 34	syl3anc 1398	. . . . 5 ⊢ (((𝐾 ∈ Top ∧ 𝐴 ∈ (𝐽 fClus 𝐿) ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐴)) ∧ (𝑓 ∈ (Fil‘∪ 𝐽) ∧ (𝐿 ⊆ 𝑓 ∧ 𝐴 ∈ (𝐽 fLim 𝑓)))) → ((𝐾 fClusf 𝐿)‘𝐹) = (𝐾 fClus ((∪ 𝐾 FilMap 𝐹)‘𝐿)))
36	31, 33, 35	3sstr4d 3963	. . . 4 ⊢ (((𝐾 ∈ Top ∧ 𝐴 ∈ (𝐽 fClus 𝐿) ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐴)) ∧ (𝑓 ∈ (Fil‘∪ 𝐽) ∧ (𝐿 ⊆ 𝑓 ∧ 𝐴 ∈ (𝐽 fLim 𝑓)))) → ((𝐾 fClusf 𝑓)‘𝐹) ⊆ ((𝐾 fClusf 𝐿)‘𝐹))
37	17, 36	sstrd 3918	. . 3 ⊢ (((𝐾 ∈ Top ∧ 𝐴 ∈ (𝐽 fClus 𝐿) ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐴)) ∧ (𝑓 ∈ (Fil‘∪ 𝐽) ∧ (𝐿 ⊆ 𝑓 ∧ 𝐴 ∈ (𝐽 fLim 𝑓)))) → ((𝐾 fLimf 𝑓)‘𝐹) ⊆ ((𝐾 fClusf 𝐿)‘𝐹))
38		simprrr 794	. . . 4 ⊢ (((𝐾 ∈ Top ∧ 𝐴 ∈ (𝐽 fClus 𝐿) ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐴)) ∧ (𝑓 ∈ (Fil‘∪ 𝐽) ∧ (𝐿 ⊆ 𝑓 ∧ 𝐴 ∈ (𝐽 fLim 𝑓)))) → 𝐴 ∈ (𝐽 fLim 𝑓))
39		simpl3 1212	. . . 4 ⊢ (((𝐾 ∈ Top ∧ 𝐴 ∈ (𝐽 fClus 𝐿) ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐴)) ∧ (𝑓 ∈ (Fil‘∪ 𝐽) ∧ (𝐿 ⊆ 𝑓 ∧ 𝐴 ∈ (𝐽 fLim 𝑓)))) → 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐴))
40		cnpflfi 24318	. . . 4 ⊢ ((𝐴 ∈ (𝐽 fLim 𝑓) ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐴)) → (𝐹‘𝐴) ∈ ((𝐾 fLimf 𝑓)‘𝐹))
41	38, 39, 40	syl2anc 596	. . 3 ⊢ (((𝐾 ∈ Top ∧ 𝐴 ∈ (𝐽 fClus 𝐿) ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐴)) ∧ (𝑓 ∈ (Fil‘∪ 𝐽) ∧ (𝐿 ⊆ 𝑓 ∧ 𝐴 ∈ (𝐽 fLim 𝑓)))) → (𝐹‘𝐴) ∈ ((𝐾 fLimf 𝑓)‘𝐹))
42	37, 41	sseldd 3909	. 2 ⊢ (((𝐾 ∈ Top ∧ 𝐴 ∈ (𝐽 fClus 𝐿) ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐴)) ∧ (𝑓 ∈ (Fil‘∪ 𝐽) ∧ (𝐿 ⊆ 𝑓 ∧ 𝐴 ∈ (𝐽 fLim 𝑓)))) → (𝐹‘𝐴) ∈ ((𝐾 fClusf 𝐿)‘𝐹))
43	7, 42	rexlimddv 3169	1 ⊢ ((𝐾 ∈ Top ∧ 𝐴 ∈ (𝐽 fClus 𝐿) ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐴)) → (𝐹‘𝐴) ∈ ((𝐾 fClusf 𝐿)‘𝐹))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1569   ∈ wcel 2144  ∃wrex 3086   ⊆ wss 3895  ∪ cuni 4866  ⟶wf 6534  ‘cfv 6538  (class class class)co 7420  fBascfbas 21666  Topctop 23211  TopOnctopon 23228   CnP ccnp 23543  Filcfil 24164   FilMap cfm 24252   fLim cflim 24253   fLimf cflf 24254   fClus cfcls 24255   fClusf cfcf 24256

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-3or 1104  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-pss 4014  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-int 4907  df-iun 4952  df-iin 4953  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5545  df-eprel 5550  df-po 5558  df-so 5559  df-fr 5603  df-we 5605  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-ord 6365  df-on 6366  df-lim 6367  df-suc 6368  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-om 7878  df-1st 8001  df-2nd 8002  df-1o 8476  df-2o 8477  df-map 8849  df-en 8974  df-fin 8977  df-fi 9403  df-fbas 21675  df-fg 21676  df-top 23212  df-topon 23229  df-cld 23337  df-ntr 23338  df-cls 23339  df-nei 23416  df-cnp 23546  df-fil 24165  df-fm 24257  df-flim 24258  df-flf 24259  df-fcls 24260  df-fcf 24261

This theorem is used by:  cnpfcf  24360