cnprest - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > cnprest		Structured version Visualization version GIF version

Theorem cnprest 21894

Description: Equivalence of continuity at a point and continuity of the restricted function at a point. (Contributed by Mario Carneiro, 8-Aug-2014.)

**Hypotheses**
Ref	Expression
cnprest.1	⊢ 𝑋 = ∪ 𝐽
cnprest.2	⊢ 𝑌 = ∪ 𝐾

**Assertion**
Ref	Expression
cnprest	⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌)) → (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ↔ (𝐹 ↾ 𝐴) ∈ (((𝐽 ↾_t 𝐴) CnP 𝐾)‘𝑃)))

Proof of Theorem cnprest Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		cnptop2 21848	. . 3 ⊢ (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) → 𝐾 ∈ Top)
2	1	a1i 11	. 2 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌)) → (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) → 𝐾 ∈ Top))
3		cnptop2 21848	. . 3 ⊢ ((𝐹 ↾ 𝐴) ∈ (((𝐽 ↾_t 𝐴) CnP 𝐾)‘𝑃) → 𝐾 ∈ Top)
4	3	a1i 11	. 2 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌)) → ((𝐹 ↾ 𝐴) ∈ (((𝐽 ↾_t 𝐴) CnP 𝐾)‘𝑃) → 𝐾 ∈ Top))
5		cnprest.1	. . . . . . . . . . . 12 ⊢ 𝑋 = ∪ 𝐽
6	5	ntrss2 21662	. . . . . . . . . . 11 ⊢ ((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) → ((int‘𝐽)‘𝐴) ⊆ 𝐴)
7	6	3ad2ant1 1130	. . . . . . . . . 10 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → ((int‘𝐽)‘𝐴) ⊆ 𝐴)
8		simp2l 1196	. . . . . . . . . 10 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → 𝑃 ∈ ((int‘𝐽)‘𝐴))
9	7, 8	sseldd 3916	. . . . . . . . 9 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → 𝑃 ∈ 𝐴)
10	9	fvresd 6665	. . . . . . . 8 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → ((𝐹 ↾ 𝐴)‘𝑃) = (𝐹‘𝑃))
11	10	eqcomd 2804	. . . . . . 7 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → (𝐹‘𝑃) = ((𝐹 ↾ 𝐴)‘𝑃))
12	11	eleq1d 2874	. . . . . 6 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → ((𝐹‘𝑃) ∈ 𝑦 ↔ ((𝐹 ↾ 𝐴)‘𝑃) ∈ 𝑦))
13		inss1 4155	. . . . . . . . . . 11 ⊢ (𝑥 ∩ 𝐴) ⊆ 𝑥
14		imass2 5932	. . . . . . . . . . 11 ⊢ ((𝑥 ∩ 𝐴) ⊆ 𝑥 → (𝐹 “ (𝑥 ∩ 𝐴)) ⊆ (𝐹 “ 𝑥))
15		sstr2 3922	. . . . . . . . . . 11 ⊢ ((𝐹 “ (𝑥 ∩ 𝐴)) ⊆ (𝐹 “ 𝑥) → ((𝐹 “ 𝑥) ⊆ 𝑦 → (𝐹 “ (𝑥 ∩ 𝐴)) ⊆ 𝑦))
16	13, 14, 15	mp2b 10	. . . . . . . . . 10 ⊢ ((𝐹 “ 𝑥) ⊆ 𝑦 → (𝐹 “ (𝑥 ∩ 𝐴)) ⊆ 𝑦)
17	16	anim2i 619	. . . . . . . . 9 ⊢ ((𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦) → (𝑃 ∈ 𝑥 ∧ (𝐹 “ (𝑥 ∩ 𝐴)) ⊆ 𝑦))
18	17	reximi 3206	. . . . . . . 8 ⊢ (∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦) → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ (𝑥 ∩ 𝐴)) ⊆ 𝑦))
19		simp1l 1194	. . . . . . . . . . . . . 14 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → 𝐽 ∈ Top)
20	5	ntropn 21654	. . . . . . . . . . . . . . 15 ⊢ ((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) → ((int‘𝐽)‘𝐴) ∈ 𝐽)
21	20	3ad2ant1 1130	. . . . . . . . . . . . . 14 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → ((int‘𝐽)‘𝐴) ∈ 𝐽)
22		inopn 21504	. . . . . . . . . . . . . . . 16 ⊢ ((𝐽 ∈ Top ∧ 𝑥 ∈ 𝐽 ∧ ((int‘𝐽)‘𝐴) ∈ 𝐽) → (𝑥 ∩ ((int‘𝐽)‘𝐴)) ∈ 𝐽)
23	22	3com23 1123	. . . . . . . . . . . . . . 15 ⊢ ((𝐽 ∈ Top ∧ ((int‘𝐽)‘𝐴) ∈ 𝐽 ∧ 𝑥 ∈ 𝐽) → (𝑥 ∩ ((int‘𝐽)‘𝐴)) ∈ 𝐽)
24	23	3expia 1118	. . . . . . . . . . . . . 14 ⊢ ((𝐽 ∈ Top ∧ ((int‘𝐽)‘𝐴) ∈ 𝐽) → (𝑥 ∈ 𝐽 → (𝑥 ∩ ((int‘𝐽)‘𝐴)) ∈ 𝐽))
25	19, 21, 24	syl2anc 587	. . . . . . . . . . . . 13 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → (𝑥 ∈ 𝐽 → (𝑥 ∩ ((int‘𝐽)‘𝐴)) ∈ 𝐽))
26		elin 3897	. . . . . . . . . . . . . . . 16 ⊢ (𝑃 ∈ (𝑥 ∩ ((int‘𝐽)‘𝐴)) ↔ (𝑃 ∈ 𝑥 ∧ 𝑃 ∈ ((int‘𝐽)‘𝐴)))
27	26	simplbi2com 506	. . . . . . . . . . . . . . 15 ⊢ (𝑃 ∈ ((int‘𝐽)‘𝐴) → (𝑃 ∈ 𝑥 → 𝑃 ∈ (𝑥 ∩ ((int‘𝐽)‘𝐴))))
28	8, 27	syl 17	. . . . . . . . . . . . . 14 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → (𝑃 ∈ 𝑥 → 𝑃 ∈ (𝑥 ∩ ((int‘𝐽)‘𝐴))))
29		sslin 4161	. . . . . . . . . . . . . . . . 17 ⊢ (((int‘𝐽)‘𝐴) ⊆ 𝐴 → (𝑥 ∩ ((int‘𝐽)‘𝐴)) ⊆ (𝑥 ∩ 𝐴))
30	7, 29	syl 17	. . . . . . . . . . . . . . . 16 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → (𝑥 ∩ ((int‘𝐽)‘𝐴)) ⊆ (𝑥 ∩ 𝐴))
31		imass2 5932	. . . . . . . . . . . . . . . 16 ⊢ ((𝑥 ∩ ((int‘𝐽)‘𝐴)) ⊆ (𝑥 ∩ 𝐴) → (𝐹 “ (𝑥 ∩ ((int‘𝐽)‘𝐴))) ⊆ (𝐹 “ (𝑥 ∩ 𝐴)))
32	30, 31	syl 17	. . . . . . . . . . . . . . 15 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → (𝐹 “ (𝑥 ∩ ((int‘𝐽)‘𝐴))) ⊆ (𝐹 “ (𝑥 ∩ 𝐴)))
33		sstr2 3922	. . . . . . . . . . . . . . 15 ⊢ ((𝐹 “ (𝑥 ∩ ((int‘𝐽)‘𝐴))) ⊆ (𝐹 “ (𝑥 ∩ 𝐴)) → ((𝐹 “ (𝑥 ∩ 𝐴)) ⊆ 𝑦 → (𝐹 “ (𝑥 ∩ ((int‘𝐽)‘𝐴))) ⊆ 𝑦))
34	32, 33	syl 17	. . . . . . . . . . . . . 14 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → ((𝐹 “ (𝑥 ∩ 𝐴)) ⊆ 𝑦 → (𝐹 “ (𝑥 ∩ ((int‘𝐽)‘𝐴))) ⊆ 𝑦))
35	28, 34	anim12d 611	. . . . . . . . . . . . 13 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → ((𝑃 ∈ 𝑥 ∧ (𝐹 “ (𝑥 ∩ 𝐴)) ⊆ 𝑦) → (𝑃 ∈ (𝑥 ∩ ((int‘𝐽)‘𝐴)) ∧ (𝐹 “ (𝑥 ∩ ((int‘𝐽)‘𝐴))) ⊆ 𝑦)))
36	25, 35	anim12d 611	. . . . . . . . . . . 12 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → ((𝑥 ∈ 𝐽 ∧ (𝑃 ∈ 𝑥 ∧ (𝐹 “ (𝑥 ∩ 𝐴)) ⊆ 𝑦)) → ((𝑥 ∩ ((int‘𝐽)‘𝐴)) ∈ 𝐽 ∧ (𝑃 ∈ (𝑥 ∩ ((int‘𝐽)‘𝐴)) ∧ (𝐹 “ (𝑥 ∩ ((int‘𝐽)‘𝐴))) ⊆ 𝑦))))
37		eleq2 2878	. . . . . . . . . . . . . 14 ⊢ (𝑧 = (𝑥 ∩ ((int‘𝐽)‘𝐴)) → (𝑃 ∈ 𝑧 ↔ 𝑃 ∈ (𝑥 ∩ ((int‘𝐽)‘𝐴))))
38		imaeq2 5892	. . . . . . . . . . . . . . 15 ⊢ (𝑧 = (𝑥 ∩ ((int‘𝐽)‘𝐴)) → (𝐹 “ 𝑧) = (𝐹 “ (𝑥 ∩ ((int‘𝐽)‘𝐴))))
39	38	sseq1d 3946	. . . . . . . . . . . . . 14 ⊢ (𝑧 = (𝑥 ∩ ((int‘𝐽)‘𝐴)) → ((𝐹 “ 𝑧) ⊆ 𝑦 ↔ (𝐹 “ (𝑥 ∩ ((int‘𝐽)‘𝐴))) ⊆ 𝑦))
40	37, 39	anbi12d 633	. . . . . . . . . . . . 13 ⊢ (𝑧 = (𝑥 ∩ ((int‘𝐽)‘𝐴)) → ((𝑃 ∈ 𝑧 ∧ (𝐹 “ 𝑧) ⊆ 𝑦) ↔ (𝑃 ∈ (𝑥 ∩ ((int‘𝐽)‘𝐴)) ∧ (𝐹 “ (𝑥 ∩ ((int‘𝐽)‘𝐴))) ⊆ 𝑦)))
41	40	rspcev 3571	. . . . . . . . . . . 12 ⊢ (((𝑥 ∩ ((int‘𝐽)‘𝐴)) ∈ 𝐽 ∧ (𝑃 ∈ (𝑥 ∩ ((int‘𝐽)‘𝐴)) ∧ (𝐹 “ (𝑥 ∩ ((int‘𝐽)‘𝐴))) ⊆ 𝑦)) → ∃𝑧 ∈ 𝐽 (𝑃 ∈ 𝑧 ∧ (𝐹 “ 𝑧) ⊆ 𝑦))
42	36, 41	syl6 35	. . . . . . . . . . 11 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → ((𝑥 ∈ 𝐽 ∧ (𝑃 ∈ 𝑥 ∧ (𝐹 “ (𝑥 ∩ 𝐴)) ⊆ 𝑦)) → ∃𝑧 ∈ 𝐽 (𝑃 ∈ 𝑧 ∧ (𝐹 “ 𝑧) ⊆ 𝑦)))
43	42	expdimp 456	. . . . . . . . . 10 ⊢ ((((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) ∧ 𝑥 ∈ 𝐽) → ((𝑃 ∈ 𝑥 ∧ (𝐹 “ (𝑥 ∩ 𝐴)) ⊆ 𝑦) → ∃𝑧 ∈ 𝐽 (𝑃 ∈ 𝑧 ∧ (𝐹 “ 𝑧) ⊆ 𝑦)))
44	43	rexlimdva 3243	. . . . . . . . 9 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → (∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ (𝑥 ∩ 𝐴)) ⊆ 𝑦) → ∃𝑧 ∈ 𝐽 (𝑃 ∈ 𝑧 ∧ (𝐹 “ 𝑧) ⊆ 𝑦)))
45		eleq2 2878	. . . . . . . . . . 11 ⊢ (𝑧 = 𝑥 → (𝑃 ∈ 𝑧 ↔ 𝑃 ∈ 𝑥))
46		imaeq2 5892	. . . . . . . . . . . 12 ⊢ (𝑧 = 𝑥 → (𝐹 “ 𝑧) = (𝐹 “ 𝑥))
47	46	sseq1d 3946	. . . . . . . . . . 11 ⊢ (𝑧 = 𝑥 → ((𝐹 “ 𝑧) ⊆ 𝑦 ↔ (𝐹 “ 𝑥) ⊆ 𝑦))
48	45, 47	anbi12d 633	. . . . . . . . . 10 ⊢ (𝑧 = 𝑥 → ((𝑃 ∈ 𝑧 ∧ (𝐹 “ 𝑧) ⊆ 𝑦) ↔ (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦)))
49	48	cbvrexvw 3397	. . . . . . . . 9 ⊢ (∃𝑧 ∈ 𝐽 (𝑃 ∈ 𝑧 ∧ (𝐹 “ 𝑧) ⊆ 𝑦) ↔ ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦))
50	44, 49	syl6ib 254	. . . . . . . 8 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → (∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ (𝑥 ∩ 𝐴)) ⊆ 𝑦) → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦)))
51	18, 50	impbid2 229	. . . . . . 7 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → (∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦) ↔ ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ (𝑥 ∩ 𝐴)) ⊆ 𝑦)))
52		vex 3444	. . . . . . . . . 10 ⊢ 𝑥 ∈ V
53	52	inex1 5185	. . . . . . . . 9 ⊢ (𝑥 ∩ 𝐴) ∈ V
54	53	a1i 11	. . . . . . . 8 ⊢ ((((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) ∧ 𝑥 ∈ 𝐽) → (𝑥 ∩ 𝐴) ∈ V)
55	19	uniexd 7448	. . . . . . . . . 10 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → ∪ 𝐽 ∈ V)
56		simp1r 1195	. . . . . . . . . . 11 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → 𝐴 ⊆ 𝑋)
57	56, 5	sseqtrdi 3965	. . . . . . . . . 10 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → 𝐴 ⊆ ∪ 𝐽)
58	55, 57	ssexd 5192	. . . . . . . . 9 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → 𝐴 ∈ V)
59		elrest 16693	. . . . . . . . 9 ⊢ ((𝐽 ∈ Top ∧ 𝐴 ∈ V) → (𝑧 ∈ (𝐽 ↾_t 𝐴) ↔ ∃𝑥 ∈ 𝐽 𝑧 = (𝑥 ∩ 𝐴)))
60	19, 58, 59	syl2anc 587	. . . . . . . 8 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → (𝑧 ∈ (𝐽 ↾_t 𝐴) ↔ ∃𝑥 ∈ 𝐽 𝑧 = (𝑥 ∩ 𝐴)))
61		eleq2 2878	. . . . . . . . . 10 ⊢ (𝑧 = (𝑥 ∩ 𝐴) → (𝑃 ∈ 𝑧 ↔ 𝑃 ∈ (𝑥 ∩ 𝐴)))
62		elin 3897	. . . . . . . . . . . 12 ⊢ (𝑃 ∈ (𝑥 ∩ 𝐴) ↔ (𝑃 ∈ 𝑥 ∧ 𝑃 ∈ 𝐴))
63	62	rbaib 542	. . . . . . . . . . 11 ⊢ (𝑃 ∈ 𝐴 → (𝑃 ∈ (𝑥 ∩ 𝐴) ↔ 𝑃 ∈ 𝑥))
64	9, 63	syl 17	. . . . . . . . . 10 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → (𝑃 ∈ (𝑥 ∩ 𝐴) ↔ 𝑃 ∈ 𝑥))
65	61, 64	sylan9bbr 514	. . . . . . . . 9 ⊢ ((((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) ∧ 𝑧 = (𝑥 ∩ 𝐴)) → (𝑃 ∈ 𝑧 ↔ 𝑃 ∈ 𝑥))
66		simpr 488	. . . . . . . . . . . 12 ⊢ ((((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) ∧ 𝑧 = (𝑥 ∩ 𝐴)) → 𝑧 = (𝑥 ∩ 𝐴))
67	66	imaeq2d 5896	. . . . . . . . . . 11 ⊢ ((((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) ∧ 𝑧 = (𝑥 ∩ 𝐴)) → ((𝐹 ↾ 𝐴) “ 𝑧) = ((𝐹 ↾ 𝐴) “ (𝑥 ∩ 𝐴)))
68		inss2 4156	. . . . . . . . . . . 12 ⊢ (𝑥 ∩ 𝐴) ⊆ 𝐴
69		resima2 5853	. . . . . . . . . . . 12 ⊢ ((𝑥 ∩ 𝐴) ⊆ 𝐴 → ((𝐹 ↾ 𝐴) “ (𝑥 ∩ 𝐴)) = (𝐹 “ (𝑥 ∩ 𝐴)))
70	68, 69	ax-mp 5	. . . . . . . . . . 11 ⊢ ((𝐹 ↾ 𝐴) “ (𝑥 ∩ 𝐴)) = (𝐹 “ (𝑥 ∩ 𝐴))
71	67, 70	eqtrdi 2849	. . . . . . . . . 10 ⊢ ((((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) ∧ 𝑧 = (𝑥 ∩ 𝐴)) → ((𝐹 ↾ 𝐴) “ 𝑧) = (𝐹 “ (𝑥 ∩ 𝐴)))
72	71	sseq1d 3946	. . . . . . . . 9 ⊢ ((((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) ∧ 𝑧 = (𝑥 ∩ 𝐴)) → (((𝐹 ↾ 𝐴) “ 𝑧) ⊆ 𝑦 ↔ (𝐹 “ (𝑥 ∩ 𝐴)) ⊆ 𝑦))
73	65, 72	anbi12d 633	. . . . . . . 8 ⊢ ((((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) ∧ 𝑧 = (𝑥 ∩ 𝐴)) → ((𝑃 ∈ 𝑧 ∧ ((𝐹 ↾ 𝐴) “ 𝑧) ⊆ 𝑦) ↔ (𝑃 ∈ 𝑥 ∧ (𝐹 “ (𝑥 ∩ 𝐴)) ⊆ 𝑦)))
74	54, 60, 73	rexxfr2d 5277	. . . . . . 7 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → (∃𝑧 ∈ (𝐽 ↾_t 𝐴)(𝑃 ∈ 𝑧 ∧ ((𝐹 ↾ 𝐴) “ 𝑧) ⊆ 𝑦) ↔ ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ (𝑥 ∩ 𝐴)) ⊆ 𝑦)))
75	51, 74	bitr4d 285	. . . . . 6 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → (∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦) ↔ ∃𝑧 ∈ (𝐽 ↾_t 𝐴)(𝑃 ∈ 𝑧 ∧ ((𝐹 ↾ 𝐴) “ 𝑧) ⊆ 𝑦)))
76	12, 75	imbi12d 348	. . . . 5 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → (((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦)) ↔ (((𝐹 ↾ 𝐴)‘𝑃) ∈ 𝑦 → ∃𝑧 ∈ (𝐽 ↾_t 𝐴)(𝑃 ∈ 𝑧 ∧ ((𝐹 ↾ 𝐴) “ 𝑧) ⊆ 𝑦))))
77	76	ralbidv 3162	. . . 4 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → (∀𝑦 ∈ 𝐾 ((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦)) ↔ ∀𝑦 ∈ 𝐾 (((𝐹 ↾ 𝐴)‘𝑃) ∈ 𝑦 → ∃𝑧 ∈ (𝐽 ↾_t 𝐴)(𝑃 ∈ 𝑧 ∧ ((𝐹 ↾ 𝐴) “ 𝑧) ⊆ 𝑦))))
78		simp2r 1197	. . . . 5 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → 𝐹:𝑋⟶𝑌)
79		simp3 1135	. . . . . 6 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → 𝐾 ∈ Top)
80	56, 9	sseldd 3916	. . . . . 6 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → 𝑃 ∈ 𝑋)
81		cnprest.2	. . . . . . . 8 ⊢ 𝑌 = ∪ 𝐾
82	5, 81	iscnp2 21844	. . . . . . 7 ⊢ (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ↔ ((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝑃 ∈ 𝑋) ∧ (𝐹:𝑋⟶𝑌 ∧ ∀𝑦 ∈ 𝐾 ((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦)))))
83	82	baib 539	. . . . . 6 ⊢ ((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝑃 ∈ 𝑋) → (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ↔ (𝐹:𝑋⟶𝑌 ∧ ∀𝑦 ∈ 𝐾 ((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦)))))
84	19, 79, 80, 83	syl3anc 1368	. . . . 5 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ↔ (𝐹:𝑋⟶𝑌 ∧ ∀𝑦 ∈ 𝐾 ((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦)))))
85	78, 84	mpbirand 706	. . . 4 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ↔ ∀𝑦 ∈ 𝐾 ((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦))))
86	78, 56	fssresd 6519	. . . . 5 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → (𝐹 ↾ 𝐴):𝐴⟶𝑌)
87	5	toptopon 21522	. . . . . . . 8 ⊢ (𝐽 ∈ Top ↔ 𝐽 ∈ (TopOn‘𝑋))
88	19, 87	sylib 221	. . . . . . 7 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → 𝐽 ∈ (TopOn‘𝑋))
89		resttopon 21766	. . . . . . 7 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴 ⊆ 𝑋) → (𝐽 ↾_t 𝐴) ∈ (TopOn‘𝐴))
90	88, 56, 89	syl2anc 587	. . . . . 6 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → (𝐽 ↾_t 𝐴) ∈ (TopOn‘𝐴))
91	81	toptopon 21522	. . . . . . 7 ⊢ (𝐾 ∈ Top ↔ 𝐾 ∈ (TopOn‘𝑌))
92	79, 91	sylib 221	. . . . . 6 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → 𝐾 ∈ (TopOn‘𝑌))
93		iscnp 21842	. . . . . 6 ⊢ (((𝐽 ↾_t 𝐴) ∈ (TopOn‘𝐴) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝑃 ∈ 𝐴) → ((𝐹 ↾ 𝐴) ∈ (((𝐽 ↾_t 𝐴) CnP 𝐾)‘𝑃) ↔ ((𝐹 ↾ 𝐴):𝐴⟶𝑌 ∧ ∀𝑦 ∈ 𝐾 (((𝐹 ↾ 𝐴)‘𝑃) ∈ 𝑦 → ∃𝑧 ∈ (𝐽 ↾_t 𝐴)(𝑃 ∈ 𝑧 ∧ ((𝐹 ↾ 𝐴) “ 𝑧) ⊆ 𝑦)))))
94	90, 92, 9, 93	syl3anc 1368	. . . . 5 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → ((𝐹 ↾ 𝐴) ∈ (((𝐽 ↾_t 𝐴) CnP 𝐾)‘𝑃) ↔ ((𝐹 ↾ 𝐴):𝐴⟶𝑌 ∧ ∀𝑦 ∈ 𝐾 (((𝐹 ↾ 𝐴)‘𝑃) ∈ 𝑦 → ∃𝑧 ∈ (𝐽 ↾_t 𝐴)(𝑃 ∈ 𝑧 ∧ ((𝐹 ↾ 𝐴) “ 𝑧) ⊆ 𝑦)))))
95	86, 94	mpbirand 706	. . . 4 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → ((𝐹 ↾ 𝐴) ∈ (((𝐽 ↾_t 𝐴) CnP 𝐾)‘𝑃) ↔ ∀𝑦 ∈ 𝐾 (((𝐹 ↾ 𝐴)‘𝑃) ∈ 𝑦 → ∃𝑧 ∈ (𝐽 ↾_t 𝐴)(𝑃 ∈ 𝑧 ∧ ((𝐹 ↾ 𝐴) “ 𝑧) ⊆ 𝑦))))
96	77, 85, 95	3bitr4d 314	. . 3 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ↔ (𝐹 ↾ 𝐴) ∈ (((𝐽 ↾_t 𝐴) CnP 𝐾)‘𝑃)))
97	96	3expia 1118	. 2 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌)) → (𝐾 ∈ Top → (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ↔ (𝐹 ↾ 𝐴) ∈ (((𝐽 ↾_t 𝐴) CnP 𝐾)‘𝑃))))
98	2, 4, 97	pm5.21ndd 384	1 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌)) → (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ↔ (𝐹 ↾ 𝐴) ∈ (((𝐽 ↾_t 𝐴) CnP 𝐾)‘𝑃)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 209 ∧ wa 399 ∧ w3a 1084 = wceq 1538 ∈ wcel 2111 ∀wral 3106 ∃wrex 3107 Vcvv 3441 ∩ cin 3880 ⊆ wss 3881 ∪ cuni 4800 ↾ cres 5521 “ cima 5522 ⟶wf 6320 ‘cfv 6324 (class class class)co 7135 ↾_t crest 16686 Topctop 21498 TopOnctopon 21515 intcnt 21622 CnP ccnp 21830

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 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-rep 5154 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441

This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1085 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-ral 3111 df-rex 3112 df-reu 3113 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-pss 3900 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-tp 4530 df-op 4532 df-uni 4801 df-int 4839 df-iun 4883 df-br 5031 df-opab 5093 df-mpt 5111 df-tr 5137 df-id 5425 df-eprel 5430 df-po 5438 df-so 5439 df-fr 5478 df-we 5480 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-pred 6116 df-ord 6162 df-on 6163 df-lim 6164 df-suc 6165 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-ov 7138 df-oprab 7139 df-mpo 7140 df-om 7561 df-1st 7671 df-2nd 7672 df-wrecs 7930 df-recs 7991 df-rdg 8029 df-oadd 8089 df-er 8272 df-map 8391 df-en 8493 df-fin 8496 df-fi 8859 df-rest 16688 df-topgen 16709 df-top 21499 df-topon 21516 df-bases 21551 df-ntr 21625 df-cnp 21833

This theorem is referenced by: limcres 24489 dvcnvrelem2 24621 psercn 25021 abelth 25036 cxpcn3 25337 efrlim 25555 cvmlift2lem11 32673 cvmlift2lem12 32674 cvmlift3lem7 32685 cncfuni 42528 cncfiooicclem1 42535 dirkercncflem4 42748 fourierdlem62 42810

W3C validator