Theorem cnpfcfi 24208

Description: Lemma for cnpfcf 24209. 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 1154	. . 3 ⊢ ((𝐾 ∈ Top ∧ 𝐴 ∈ (𝐽 fClus 𝐿) ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐴)) → 𝐴 ∈ (𝐽 fClus 𝐿))
2		eqid 2762	. . . . . 6 ⊢ ∪ 𝐽 = ∪ 𝐽
3	2	fclsfil 24178	. . . . 5 ⊢ (𝐴 ∈ (𝐽 fClus 𝐿) → 𝐿 ∈ (Fil‘∪ 𝐽))
4	3	3ad2ant2 1151	. . . 4 ⊢ ((𝐾 ∈ Top ∧ 𝐴 ∈ (𝐽 fClus 𝐿) ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐴)) → 𝐿 ∈ (Fil‘∪ 𝐽))
5		fclsfnflim 24195	. . . 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 1209	. . . . . 6 ⊢ (((𝐾 ∈ Top ∧ 𝐴 ∈ (𝐽 fClus 𝐿) ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐴)) ∧ (𝑓 ∈ (Fil‘∪ 𝐽) ∧ (𝐿 ⊆ 𝑓 ∧ 𝐴 ∈ (𝐽 fLim 𝑓)))) → 𝐾 ∈ Top)
9		toptopon2 23086	. . . . . 6 ⊢ (𝐾 ∈ Top ↔ 𝐾 ∈ (TopOn‘∪ 𝐾))
10	8, 9	sylib 221	. . . . 5 ⊢ (((𝐾 ∈ Top ∧ 𝐴 ∈ (𝐽 fClus 𝐿) ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐴)) ∧ (𝑓 ∈ (Fil‘∪ 𝐽) ∧ (𝐿 ⊆ 𝑓 ∧ 𝐴 ∈ (𝐽 fLim 𝑓)))) → 𝐾 ∈ (TopOn‘∪ 𝐾))
11		simprl 782	. . . . 5 ⊢ (((𝐾 ∈ Top ∧ 𝐴 ∈ (𝐽 fClus 𝐿) ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐴)) ∧ (𝑓 ∈ (Fil‘∪ 𝐽) ∧ (𝐿 ⊆ 𝑓 ∧ 𝐴 ∈ (𝐽 fLim 𝑓)))) → 𝑓 ∈ (Fil‘∪ 𝐽))
12		eqid 2762	. . . . . . . 8 ⊢ ∪ 𝐾 = ∪ 𝐾
13	2, 12	cnpf 23415	. . . . . . 7 ⊢ (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐴) → 𝐹:∪ 𝐽⟶∪ 𝐾)
14	13	3ad2ant3 1152	. . . . . 6 ⊢ ((𝐾 ∈ Top ∧ 𝐴 ∈ (𝐽 fClus 𝐿) ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐴)) → 𝐹:∪ 𝐽⟶∪ 𝐾)
15	14	adantr 485	. . . . 5 ⊢ (((𝐾 ∈ Top ∧ 𝐴 ∈ (𝐽 fClus 𝐿) ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐴)) ∧ (𝑓 ∈ (Fil‘∪ 𝐽) ∧ (𝐿 ⊆ 𝑓 ∧ 𝐴 ∈ (𝐽 fLim 𝑓)))) → 𝐹:∪ 𝐽⟶∪ 𝐾)
16		flfssfcf 24206	. . . . 5 ⊢ ((𝐾 ∈ (TopOn‘∪ 𝐾) ∧ 𝑓 ∈ (Fil‘∪ 𝐽) ∧ 𝐹:∪ 𝐽⟶∪ 𝐾) → ((𝐾 fLimf 𝑓)‘𝐹) ⊆ ((𝐾 fClusf 𝑓)‘𝐹))
17	10, 11, 15, 16	syl3anc 1397	. . . 4 ⊢ (((𝐾 ∈ Top ∧ 𝐴 ∈ (𝐽 fClus 𝐿) ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐴)) ∧ (𝑓 ∈ (Fil‘∪ 𝐽) ∧ (𝐿 ⊆ 𝑓 ∧ 𝐴 ∈ (𝐽 fLim 𝑓)))) → ((𝐾 fLimf 𝑓)‘𝐹) ⊆ ((𝐾 fClusf 𝑓)‘𝐹))
18	12	topopn 23074	. . . . . . . 8 ⊢ (𝐾 ∈ Top → ∪ 𝐾 ∈ 𝐾)
19	8, 18	syl 18	. . . . . . 7 ⊢ (((𝐾 ∈ Top ∧ 𝐴 ∈ (𝐽 fClus 𝐿) ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐴)) ∧ (𝑓 ∈ (Fil‘∪ 𝐽) ∧ (𝐿 ⊆ 𝑓 ∧ 𝐴 ∈ (𝐽 fLim 𝑓)))) → ∪ 𝐾 ∈ 𝐾)
20	4	adantr 485	. . . . . . . 8 ⊢ (((𝐾 ∈ Top ∧ 𝐴 ∈ (𝐽 fClus 𝐿) ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐴)) ∧ (𝑓 ∈ (Fil‘∪ 𝐽) ∧ (𝐿 ⊆ 𝑓 ∧ 𝐴 ∈ (𝐽 fLim 𝑓)))) → 𝐿 ∈ (Fil‘∪ 𝐽))
21		filfbas 24016	. . . . . . . 8 ⊢ (𝐿 ∈ (Fil‘∪ 𝐽) → 𝐿 ∈ (fBas‘∪ 𝐽))
22	20, 21	syl 18	. . . . . . 7 ⊢ (((𝐾 ∈ Top ∧ 𝐴 ∈ (𝐽 fClus 𝐿) ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐴)) ∧ (𝑓 ∈ (Fil‘∪ 𝐽) ∧ (𝐿 ⊆ 𝑓 ∧ 𝐴 ∈ (𝐽 fLim 𝑓)))) → 𝐿 ∈ (fBas‘∪ 𝐽))
23		fmfil 24112	. . . . . . 7 ⊢ ((∪ 𝐾 ∈ 𝐾 ∧ 𝐿 ∈ (fBas‘∪ 𝐽) ∧ 𝐹:∪ 𝐽⟶∪ 𝐾) → ((∪ 𝐾 FilMap 𝐹)‘𝐿) ∈ (Fil‘∪ 𝐾))
24	19, 22, 15, 23	syl3anc 1397	. . . . . 6 ⊢ (((𝐾 ∈ Top ∧ 𝐴 ∈ (𝐽 fClus 𝐿) ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐴)) ∧ (𝑓 ∈ (Fil‘∪ 𝐽) ∧ (𝐿 ⊆ 𝑓 ∧ 𝐴 ∈ (𝐽 fLim 𝑓)))) → ((∪ 𝐾 FilMap 𝐹)‘𝐿) ∈ (Fil‘∪ 𝐾))
25		filfbas 24016	. . . . . . . 8 ⊢ (𝑓 ∈ (Fil‘∪ 𝐽) → 𝑓 ∈ (fBas‘∪ 𝐽))
26	25	ad2antrl 740	. . . . . . 7 ⊢ (((𝐾 ∈ Top ∧ 𝐴 ∈ (𝐽 fClus 𝐿) ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐴)) ∧ (𝑓 ∈ (Fil‘∪ 𝐽) ∧ (𝐿 ⊆ 𝑓 ∧ 𝐴 ∈ (𝐽 fLim 𝑓)))) → 𝑓 ∈ (fBas‘∪ 𝐽))
27		simprrl 792	. . . . . . 7 ⊢ (((𝐾 ∈ Top ∧ 𝐴 ∈ (𝐽 fClus 𝐿) ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐴)) ∧ (𝑓 ∈ (Fil‘∪ 𝐽) ∧ (𝐿 ⊆ 𝑓 ∧ 𝐴 ∈ (𝐽 fLim 𝑓)))) → 𝐿 ⊆ 𝑓)
28		fmss 24114	. . . . . . 7 ⊢ (((∪ 𝐾 ∈ 𝐾 ∧ 𝐿 ∈ (fBas‘∪ 𝐽) ∧ 𝑓 ∈ (fBas‘∪ 𝐽)) ∧ (𝐹:∪ 𝐽⟶∪ 𝐾 ∧ 𝐿 ⊆ 𝑓)) → ((∪ 𝐾 FilMap 𝐹)‘𝐿) ⊆ ((∪ 𝐾 FilMap 𝐹)‘𝑓))
29	19, 22, 26, 15, 27, 28	syl32anc 1404	. . . . . 6 ⊢ (((𝐾 ∈ Top ∧ 𝐴 ∈ (𝐽 fClus 𝐿) ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐴)) ∧ (𝑓 ∈ (Fil‘∪ 𝐽) ∧ (𝐿 ⊆ 𝑓 ∧ 𝐴 ∈ (𝐽 fLim 𝑓)))) → ((∪ 𝐾 FilMap 𝐹)‘𝐿) ⊆ ((∪ 𝐾 FilMap 𝐹)‘𝑓))
30		fclsss2 24191	. . . . . 6 ⊢ ((𝐾 ∈ (TopOn‘∪ 𝐾) ∧ ((∪ 𝐾 FilMap 𝐹)‘𝐿) ∈ (Fil‘∪ 𝐾) ∧ ((∪ 𝐾 FilMap 𝐹)‘𝐿) ⊆ ((∪ 𝐾 FilMap 𝐹)‘𝑓)) → (𝐾 fClus ((∪ 𝐾 FilMap 𝐹)‘𝑓)) ⊆ (𝐾 fClus ((∪ 𝐾 FilMap 𝐹)‘𝐿)))
31	10, 24, 29, 30	syl3anc 1397	. . . . 5 ⊢ (((𝐾 ∈ Top ∧ 𝐴 ∈ (𝐽 fClus 𝐿) ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐴)) ∧ (𝑓 ∈ (Fil‘∪ 𝐽) ∧ (𝐿 ⊆ 𝑓 ∧ 𝐴 ∈ (𝐽 fLim 𝑓)))) → (𝐾 fClus ((∪ 𝐾 FilMap 𝐹)‘𝑓)) ⊆ (𝐾 fClus ((∪ 𝐾 FilMap 𝐹)‘𝐿)))
32		fcfval 24201	. . . . . 6 ⊢ ((𝐾 ∈ (TopOn‘∪ 𝐾) ∧ 𝑓 ∈ (Fil‘∪ 𝐽) ∧ 𝐹:∪ 𝐽⟶∪ 𝐾) → ((𝐾 fClusf 𝑓)‘𝐹) = (𝐾 fClus ((∪ 𝐾 FilMap 𝐹)‘𝑓)))
33	10, 11, 15, 32	syl3anc 1397	. . . . 5 ⊢ (((𝐾 ∈ Top ∧ 𝐴 ∈ (𝐽 fClus 𝐿) ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐴)) ∧ (𝑓 ∈ (Fil‘∪ 𝐽) ∧ (𝐿 ⊆ 𝑓 ∧ 𝐴 ∈ (𝐽 fLim 𝑓)))) → ((𝐾 fClusf 𝑓)‘𝐹) = (𝐾 fClus ((∪ 𝐾 FilMap 𝐹)‘𝑓)))
34		fcfval 24201	. . . . . 6 ⊢ ((𝐾 ∈ (TopOn‘∪ 𝐾) ∧ 𝐿 ∈ (Fil‘∪ 𝐽) ∧ 𝐹:∪ 𝐽⟶∪ 𝐾) → ((𝐾 fClusf 𝐿)‘𝐹) = (𝐾 fClus ((∪ 𝐾 FilMap 𝐹)‘𝐿)))
35	10, 20, 15, 34	syl3anc 1397	. . . . 5 ⊢ (((𝐾 ∈ Top ∧ 𝐴 ∈ (𝐽 fClus 𝐿) ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐴)) ∧ (𝑓 ∈ (Fil‘∪ 𝐽) ∧ (𝐿 ⊆ 𝑓 ∧ 𝐴 ∈ (𝐽 fLim 𝑓)))) → ((𝐾 fClusf 𝐿)‘𝐹) = (𝐾 fClus ((∪ 𝐾 FilMap 𝐹)‘𝐿)))
36	31, 33, 35	3sstr4d 3991	. . . 4 ⊢ (((𝐾 ∈ Top ∧ 𝐴 ∈ (𝐽 fClus 𝐿) ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐴)) ∧ (𝑓 ∈ (Fil‘∪ 𝐽) ∧ (𝐿 ⊆ 𝑓 ∧ 𝐴 ∈ (𝐽 fLim 𝑓)))) → ((𝐾 fClusf 𝑓)‘𝐹) ⊆ ((𝐾 fClusf 𝐿)‘𝐹))
37	17, 36	sstrd 3946	. . 3 ⊢ (((𝐾 ∈ Top ∧ 𝐴 ∈ (𝐽 fClus 𝐿) ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐴)) ∧ (𝑓 ∈ (Fil‘∪ 𝐽) ∧ (𝐿 ⊆ 𝑓 ∧ 𝐴 ∈ (𝐽 fLim 𝑓)))) → ((𝐾 fLimf 𝑓)‘𝐹) ⊆ ((𝐾 fClusf 𝐿)‘𝐹))
38		simprrr 793	. . . 4 ⊢ (((𝐾 ∈ Top ∧ 𝐴 ∈ (𝐽 fClus 𝐿) ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐴)) ∧ (𝑓 ∈ (Fil‘∪ 𝐽) ∧ (𝐿 ⊆ 𝑓 ∧ 𝐴 ∈ (𝐽 fLim 𝑓)))) → 𝐴 ∈ (𝐽 fLim 𝑓))
39		simpl3 1211	. . . 4 ⊢ (((𝐾 ∈ Top ∧ 𝐴 ∈ (𝐽 fClus 𝐿) ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐴)) ∧ (𝑓 ∈ (Fil‘∪ 𝐽) ∧ (𝐿 ⊆ 𝑓 ∧ 𝐴 ∈ (𝐽 fLim 𝑓)))) → 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐴))
40		cnpflfi 24167	. . . 4 ⊢ ((𝐴 ∈ (𝐽 fLim 𝑓) ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐴)) → (𝐹‘𝐴) ∈ ((𝐾 fLimf 𝑓)‘𝐹))
41	38, 39, 40	syl2anc 595	. . 3 ⊢ (((𝐾 ∈ Top ∧ 𝐴 ∈ (𝐽 fClus 𝐿) ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐴)) ∧ (𝑓 ∈ (Fil‘∪ 𝐽) ∧ (𝐿 ⊆ 𝑓 ∧ 𝐴 ∈ (𝐽 fLim 𝑓)))) → (𝐹‘𝐴) ∈ ((𝐾 fLimf 𝑓)‘𝐹))
42	37, 41	sseldd 3937	. 2 ⊢ (((𝐾 ∈ Top ∧ 𝐴 ∈ (𝐽 fClus 𝐿) ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐴)) ∧ (𝑓 ∈ (Fil‘∪ 𝐽) ∧ (𝐿 ⊆ 𝑓 ∧ 𝐴 ∈ (𝐽 fLim 𝑓)))) → (𝐹‘𝐴) ∈ ((𝐾 fClusf 𝐿)‘𝐹))
43	7, 42	rexlimddv 3171	1 ⊢ ((𝐾 ∈ Top ∧ 𝐴 ∈ (𝐽 fClus 𝐿) ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐴)) → (𝐹‘𝐴) ∈ ((𝐾 fClusf 𝐿)‘𝐹))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 400   ∧ w3a 1102   = wceq 1569   ∈ wcel 2142  ∃wrex 3088   ⊆ wss 3904  ∪ cuni 4871  ⟶wf 6532  ‘cfv 6536  (class class class)co 7412  fBascfbas 21521  Topctop 23061  TopOnctopon 23078   CnP ccnp 23393  Filcfil 24013   FilMap cfm 24101   fLim cflim 24102   fLimf cflf 24103   fClus cfcls 24104   fClusf cfcf 24105

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-rep 5237  ax-sep 5256  ax-nul 5268  ax-pow 5335  ax-pr 5403  ax-un 7734

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1103  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-nf 1813  df-sb 2096  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-nel 3064  df-ral 3079  df-rex 3089  df-reu 3369  df-rab 3416  df-v 3456  df-sbc 3744  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-pss 3924  df-nul 4286  df-if 4487  df-pw 4563  df-sn 4589  df-pr 4591  df-op 4595  df-uni 4872  df-int 4912  df-iun 4957  df-iin 4958  df-br 5109  df-opab 5173  df-mpt 5192  df-tr 5218  df-id 5555  df-eprel 5560  df-po 5568  df-so 5569  df-fr 5613  df-we 5615  df-xp 5666  df-rel 5667  df-cnv 5668  df-co 5669  df-dm 5670  df-rn 5671  df-res 5672  df-ima 5673  df-ord 6363  df-on 6364  df-lim 6365  df-suc 6366  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-ov 7415  df-oprab 7416  df-mpo 7417  df-om 7861  df-1st 7984  df-2nd 7985  df-1o 8451  df-2o 8452  df-map 8824  df-en 8942  df-fin 8945  df-fi 9369  df-fbas 21530  df-fg 21531  df-top 23062  df-topon 23079  df-cld 23187  df-ntr 23188  df-cls 23189  df-nei 23266  df-cnp 23396  df-fil 24014  df-fm 24106  df-flim 24107  df-flf 24108  df-fcls 24109  df-fcf 24110

This theorem is used by:  cnpfcf  24209