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 23209

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 23163	. . 3 ⊢ (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) → 𝐾 ∈ Top)
2	1	a1i 11	. 2 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌)) → (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) → 𝐾 ∈ Top))
3		cnptop2 23163	. . 3 ⊢ ((𝐹 ↾ 𝐴) ∈ (((𝐽 ↾_t 𝐴) CnP 𝐾)‘𝑃) → 𝐾 ∈ Top)
4	3	a1i 11	. 2 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌)) → ((𝐹 ↾ 𝐴) ∈ (((𝐽 ↾_t 𝐴) CnP 𝐾)‘𝑃) → 𝐾 ∈ Top))
5		cnprest.1	. . . . . . . . . . . 12 ⊢ 𝑋 = ∪ 𝐽
6	5	ntrss2 22977	. . . . . . . . . . 11 ⊢ ((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) → ((int‘𝐽)‘𝐴) ⊆ 𝐴)
7	6	3ad2ant1 1133	. . . . . . . . . 10 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → ((int‘𝐽)‘𝐴) ⊆ 𝐴)
8		simp2l 1200	. . . . . . . . . 10 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → 𝑃 ∈ ((int‘𝐽)‘𝐴))
9	7, 8	sseldd 3944	. . . . . . . . 9 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → 𝑃 ∈ 𝐴)
10	9	fvresd 6860	. . . . . . . 8 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → ((𝐹 ↾ 𝐴)‘𝑃) = (𝐹‘𝑃))
11	10	eqcomd 2735	. . . . . . 7 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → (𝐹‘𝑃) = ((𝐹 ↾ 𝐴)‘𝑃))
12	11	eleq1d 2813	. . . . . 6 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → ((𝐹‘𝑃) ∈ 𝑦 ↔ ((𝐹 ↾ 𝐴)‘𝑃) ∈ 𝑦))
13		inss1 4196	. . . . . . . . . . 11 ⊢ (𝑥 ∩ 𝐴) ⊆ 𝑥
14		imass2 6062	. . . . . . . . . . 11 ⊢ ((𝑥 ∩ 𝐴) ⊆ 𝑥 → (𝐹 “ (𝑥 ∩ 𝐴)) ⊆ (𝐹 “ 𝑥))
15		sstr2 3950	. . . . . . . . . . 11 ⊢ ((𝐹 “ (𝑥 ∩ 𝐴)) ⊆ (𝐹 “ 𝑥) → ((𝐹 “ 𝑥) ⊆ 𝑦 → (𝐹 “ (𝑥 ∩ 𝐴)) ⊆ 𝑦))
16	13, 14, 15	mp2b 10	. . . . . . . . . 10 ⊢ ((𝐹 “ 𝑥) ⊆ 𝑦 → (𝐹 “ (𝑥 ∩ 𝐴)) ⊆ 𝑦)
17	16	anim2i 617	. . . . . . . . 9 ⊢ ((𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦) → (𝑃 ∈ 𝑥 ∧ (𝐹 “ (𝑥 ∩ 𝐴)) ⊆ 𝑦))
18	17	reximi 3067	. . . . . . . 8 ⊢ (∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦) → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ (𝑥 ∩ 𝐴)) ⊆ 𝑦))
19		simp1l 1198	. . . . . . . . . . . . . 14 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → 𝐽 ∈ Top)
20	5	ntropn 22969	. . . . . . . . . . . . . . 15 ⊢ ((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) → ((int‘𝐽)‘𝐴) ∈ 𝐽)
21	20	3ad2ant1 1133	. . . . . . . . . . . . . 14 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → ((int‘𝐽)‘𝐴) ∈ 𝐽)
22		inopn 22819	. . . . . . . . . . . . . . . 16 ⊢ ((𝐽 ∈ Top ∧ 𝑥 ∈ 𝐽 ∧ ((int‘𝐽)‘𝐴) ∈ 𝐽) → (𝑥 ∩ ((int‘𝐽)‘𝐴)) ∈ 𝐽)
23	22	3com23 1126	. . . . . . . . . . . . . . 15 ⊢ ((𝐽 ∈ Top ∧ ((int‘𝐽)‘𝐴) ∈ 𝐽 ∧ 𝑥 ∈ 𝐽) → (𝑥 ∩ ((int‘𝐽)‘𝐴)) ∈ 𝐽)
24	23	3expia 1121	. . . . . . . . . . . . . 14 ⊢ ((𝐽 ∈ Top ∧ ((int‘𝐽)‘𝐴) ∈ 𝐽) → (𝑥 ∈ 𝐽 → (𝑥 ∩ ((int‘𝐽)‘𝐴)) ∈ 𝐽))
25	19, 21, 24	syl2anc 584	. . . . . . . . . . . . 13 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → (𝑥 ∈ 𝐽 → (𝑥 ∩ ((int‘𝐽)‘𝐴)) ∈ 𝐽))
26		elin 3927	. . . . . . . . . . . . . . . 16 ⊢ (𝑃 ∈ (𝑥 ∩ ((int‘𝐽)‘𝐴)) ↔ (𝑃 ∈ 𝑥 ∧ 𝑃 ∈ ((int‘𝐽)‘𝐴)))
27	26	simplbi2com 502	. . . . . . . . . . . . . . 15 ⊢ (𝑃 ∈ ((int‘𝐽)‘𝐴) → (𝑃 ∈ 𝑥 → 𝑃 ∈ (𝑥 ∩ ((int‘𝐽)‘𝐴))))
28	8, 27	syl 17	. . . . . . . . . . . . . 14 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → (𝑃 ∈ 𝑥 → 𝑃 ∈ (𝑥 ∩ ((int‘𝐽)‘𝐴))))
29		sslin 4202	. . . . . . . . . . . . . . . . 17 ⊢ (((int‘𝐽)‘𝐴) ⊆ 𝐴 → (𝑥 ∩ ((int‘𝐽)‘𝐴)) ⊆ (𝑥 ∩ 𝐴))
30	7, 29	syl 17	. . . . . . . . . . . . . . . 16 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → (𝑥 ∩ ((int‘𝐽)‘𝐴)) ⊆ (𝑥 ∩ 𝐴))
31		imass2 6062	. . . . . . . . . . . . . . . 16 ⊢ ((𝑥 ∩ ((int‘𝐽)‘𝐴)) ⊆ (𝑥 ∩ 𝐴) → (𝐹 “ (𝑥 ∩ ((int‘𝐽)‘𝐴))) ⊆ (𝐹 “ (𝑥 ∩ 𝐴)))
32	30, 31	syl 17	. . . . . . . . . . . . . . 15 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → (𝐹 “ (𝑥 ∩ ((int‘𝐽)‘𝐴))) ⊆ (𝐹 “ (𝑥 ∩ 𝐴)))
33		sstr2 3950	. . . . . . . . . . . . . . 15 ⊢ ((𝐹 “ (𝑥 ∩ ((int‘𝐽)‘𝐴))) ⊆ (𝐹 “ (𝑥 ∩ 𝐴)) → ((𝐹 “ (𝑥 ∩ 𝐴)) ⊆ 𝑦 → (𝐹 “ (𝑥 ∩ ((int‘𝐽)‘𝐴))) ⊆ 𝑦))
34	32, 33	syl 17	. . . . . . . . . . . . . 14 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → ((𝐹 “ (𝑥 ∩ 𝐴)) ⊆ 𝑦 → (𝐹 “ (𝑥 ∩ ((int‘𝐽)‘𝐴))) ⊆ 𝑦))
35	28, 34	anim12d 609	. . . . . . . . . . . . 13 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → ((𝑃 ∈ 𝑥 ∧ (𝐹 “ (𝑥 ∩ 𝐴)) ⊆ 𝑦) → (𝑃 ∈ (𝑥 ∩ ((int‘𝐽)‘𝐴)) ∧ (𝐹 “ (𝑥 ∩ ((int‘𝐽)‘𝐴))) ⊆ 𝑦)))
36	25, 35	anim12d 609	. . . . . . . . . . . 12 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → ((𝑥 ∈ 𝐽 ∧ (𝑃 ∈ 𝑥 ∧ (𝐹 “ (𝑥 ∩ 𝐴)) ⊆ 𝑦)) → ((𝑥 ∩ ((int‘𝐽)‘𝐴)) ∈ 𝐽 ∧ (𝑃 ∈ (𝑥 ∩ ((int‘𝐽)‘𝐴)) ∧ (𝐹 “ (𝑥 ∩ ((int‘𝐽)‘𝐴))) ⊆ 𝑦))))
37		eleq2 2817	. . . . . . . . . . . . . 14 ⊢ (𝑧 = (𝑥 ∩ ((int‘𝐽)‘𝐴)) → (𝑃 ∈ 𝑧 ↔ 𝑃 ∈ (𝑥 ∩ ((int‘𝐽)‘𝐴))))
38		imaeq2 6016	. . . . . . . . . . . . . . 15 ⊢ (𝑧 = (𝑥 ∩ ((int‘𝐽)‘𝐴)) → (𝐹 “ 𝑧) = (𝐹 “ (𝑥 ∩ ((int‘𝐽)‘𝐴))))
39	38	sseq1d 3975	. . . . . . . . . . . . . 14 ⊢ (𝑧 = (𝑥 ∩ ((int‘𝐽)‘𝐴)) → ((𝐹 “ 𝑧) ⊆ 𝑦 ↔ (𝐹 “ (𝑥 ∩ ((int‘𝐽)‘𝐴))) ⊆ 𝑦))
40	37, 39	anbi12d 632	. . . . . . . . . . . . 13 ⊢ (𝑧 = (𝑥 ∩ ((int‘𝐽)‘𝐴)) → ((𝑃 ∈ 𝑧 ∧ (𝐹 “ 𝑧) ⊆ 𝑦) ↔ (𝑃 ∈ (𝑥 ∩ ((int‘𝐽)‘𝐴)) ∧ (𝐹 “ (𝑥 ∩ ((int‘𝐽)‘𝐴))) ⊆ 𝑦)))
41	40	rspcev 3585	. . . . . . . . . . . 12 ⊢ (((𝑥 ∩ ((int‘𝐽)‘𝐴)) ∈ 𝐽 ∧ (𝑃 ∈ (𝑥 ∩ ((int‘𝐽)‘𝐴)) ∧ (𝐹 “ (𝑥 ∩ ((int‘𝐽)‘𝐴))) ⊆ 𝑦)) → ∃𝑧 ∈ 𝐽 (𝑃 ∈ 𝑧 ∧ (𝐹 “ 𝑧) ⊆ 𝑦))
42	36, 41	syl6 35	. . . . . . . . . . 11 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → ((𝑥 ∈ 𝐽 ∧ (𝑃 ∈ 𝑥 ∧ (𝐹 “ (𝑥 ∩ 𝐴)) ⊆ 𝑦)) → ∃𝑧 ∈ 𝐽 (𝑃 ∈ 𝑧 ∧ (𝐹 “ 𝑧) ⊆ 𝑦)))
43	42	expdimp 452	. . . . . . . . . 10 ⊢ ((((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) ∧ 𝑥 ∈ 𝐽) → ((𝑃 ∈ 𝑥 ∧ (𝐹 “ (𝑥 ∩ 𝐴)) ⊆ 𝑦) → ∃𝑧 ∈ 𝐽 (𝑃 ∈ 𝑧 ∧ (𝐹 “ 𝑧) ⊆ 𝑦)))
44	43	rexlimdva 3134	. . . . . . . . 9 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → (∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ (𝑥 ∩ 𝐴)) ⊆ 𝑦) → ∃𝑧 ∈ 𝐽 (𝑃 ∈ 𝑧 ∧ (𝐹 “ 𝑧) ⊆ 𝑦)))
45		eleq2 2817	. . . . . . . . . . 11 ⊢ (𝑧 = 𝑥 → (𝑃 ∈ 𝑧 ↔ 𝑃 ∈ 𝑥))
46		imaeq2 6016	. . . . . . . . . . . 12 ⊢ (𝑧 = 𝑥 → (𝐹 “ 𝑧) = (𝐹 “ 𝑥))
47	46	sseq1d 3975	. . . . . . . . . . 11 ⊢ (𝑧 = 𝑥 → ((𝐹 “ 𝑧) ⊆ 𝑦 ↔ (𝐹 “ 𝑥) ⊆ 𝑦))
48	45, 47	anbi12d 632	. . . . . . . . . 10 ⊢ (𝑧 = 𝑥 → ((𝑃 ∈ 𝑧 ∧ (𝐹 “ 𝑧) ⊆ 𝑦) ↔ (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦)))
49	48	cbvrexvw 3214	. . . . . . . . 9 ⊢ (∃𝑧 ∈ 𝐽 (𝑃 ∈ 𝑧 ∧ (𝐹 “ 𝑧) ⊆ 𝑦) ↔ ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦))
50	44, 49	imbitrdi 251	. . . . . . . 8 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → (∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ (𝑥 ∩ 𝐴)) ⊆ 𝑦) → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦)))
51	18, 50	impbid2 226	. . . . . . 7 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → (∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦) ↔ ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ (𝑥 ∩ 𝐴)) ⊆ 𝑦)))
52		vex 3448	. . . . . . . . . 10 ⊢ 𝑥 ∈ V
53	52	inex1 5267	. . . . . . . . 9 ⊢ (𝑥 ∩ 𝐴) ∈ V
54	53	a1i 11	. . . . . . . 8 ⊢ ((((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) ∧ 𝑥 ∈ 𝐽) → (𝑥 ∩ 𝐴) ∈ V)
55	19	uniexd 7698	. . . . . . . . . 10 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → ∪ 𝐽 ∈ V)
56		simp1r 1199	. . . . . . . . . . 11 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → 𝐴 ⊆ 𝑋)
57	56, 5	sseqtrdi 3984	. . . . . . . . . 10 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → 𝐴 ⊆ ∪ 𝐽)
58	55, 57	ssexd 5274	. . . . . . . . 9 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → 𝐴 ∈ V)
59		elrest 17366	. . . . . . . . 9 ⊢ ((𝐽 ∈ Top ∧ 𝐴 ∈ V) → (𝑧 ∈ (𝐽 ↾_t 𝐴) ↔ ∃𝑥 ∈ 𝐽 𝑧 = (𝑥 ∩ 𝐴)))
60	19, 58, 59	syl2anc 584	. . . . . . . 8 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → (𝑧 ∈ (𝐽 ↾_t 𝐴) ↔ ∃𝑥 ∈ 𝐽 𝑧 = (𝑥 ∩ 𝐴)))
61		eleq2 2817	. . . . . . . . . 10 ⊢ (𝑧 = (𝑥 ∩ 𝐴) → (𝑃 ∈ 𝑧 ↔ 𝑃 ∈ (𝑥 ∩ 𝐴)))
62		elin 3927	. . . . . . . . . . . 12 ⊢ (𝑃 ∈ (𝑥 ∩ 𝐴) ↔ (𝑃 ∈ 𝑥 ∧ 𝑃 ∈ 𝐴))
63	62	rbaib 538	. . . . . . . . . . 11 ⊢ (𝑃 ∈ 𝐴 → (𝑃 ∈ (𝑥 ∩ 𝐴) ↔ 𝑃 ∈ 𝑥))
64	9, 63	syl 17	. . . . . . . . . 10 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → (𝑃 ∈ (𝑥 ∩ 𝐴) ↔ 𝑃 ∈ 𝑥))
65	61, 64	sylan9bbr 510	. . . . . . . . 9 ⊢ ((((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) ∧ 𝑧 = (𝑥 ∩ 𝐴)) → (𝑃 ∈ 𝑧 ↔ 𝑃 ∈ 𝑥))
66		simpr 484	. . . . . . . . . . . 12 ⊢ ((((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) ∧ 𝑧 = (𝑥 ∩ 𝐴)) → 𝑧 = (𝑥 ∩ 𝐴))
67	66	imaeq2d 6020	. . . . . . . . . . 11 ⊢ ((((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) ∧ 𝑧 = (𝑥 ∩ 𝐴)) → ((𝐹 ↾ 𝐴) “ 𝑧) = ((𝐹 ↾ 𝐴) “ (𝑥 ∩ 𝐴)))
68		inss2 4197	. . . . . . . . . . . 12 ⊢ (𝑥 ∩ 𝐴) ⊆ 𝐴
69		resima2 5976	. . . . . . . . . . . 12 ⊢ ((𝑥 ∩ 𝐴) ⊆ 𝐴 → ((𝐹 ↾ 𝐴) “ (𝑥 ∩ 𝐴)) = (𝐹 “ (𝑥 ∩ 𝐴)))
70	68, 69	ax-mp 5	. . . . . . . . . . 11 ⊢ ((𝐹 ↾ 𝐴) “ (𝑥 ∩ 𝐴)) = (𝐹 “ (𝑥 ∩ 𝐴))
71	67, 70	eqtrdi 2780	. . . . . . . . . 10 ⊢ ((((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) ∧ 𝑧 = (𝑥 ∩ 𝐴)) → ((𝐹 ↾ 𝐴) “ 𝑧) = (𝐹 “ (𝑥 ∩ 𝐴)))
72	71	sseq1d 3975	. . . . . . . . 9 ⊢ ((((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) ∧ 𝑧 = (𝑥 ∩ 𝐴)) → (((𝐹 ↾ 𝐴) “ 𝑧) ⊆ 𝑦 ↔ (𝐹 “ (𝑥 ∩ 𝐴)) ⊆ 𝑦))
73	65, 72	anbi12d 632	. . . . . . . 8 ⊢ ((((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) ∧ 𝑧 = (𝑥 ∩ 𝐴)) → ((𝑃 ∈ 𝑧 ∧ ((𝐹 ↾ 𝐴) “ 𝑧) ⊆ 𝑦) ↔ (𝑃 ∈ 𝑥 ∧ (𝐹 “ (𝑥 ∩ 𝐴)) ⊆ 𝑦)))
74	54, 60, 73	rexxfr2d 5361	. . . . . . 7 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → (∃𝑧 ∈ (𝐽 ↾_t 𝐴)(𝑃 ∈ 𝑧 ∧ ((𝐹 ↾ 𝐴) “ 𝑧) ⊆ 𝑦) ↔ ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ (𝑥 ∩ 𝐴)) ⊆ 𝑦)))
75	51, 74	bitr4d 282	. . . . . 6 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → (∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦) ↔ ∃𝑧 ∈ (𝐽 ↾_t 𝐴)(𝑃 ∈ 𝑧 ∧ ((𝐹 ↾ 𝐴) “ 𝑧) ⊆ 𝑦)))
76	12, 75	imbi12d 344	. . . . 5 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → (((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦)) ↔ (((𝐹 ↾ 𝐴)‘𝑃) ∈ 𝑦 → ∃𝑧 ∈ (𝐽 ↾_t 𝐴)(𝑃 ∈ 𝑧 ∧ ((𝐹 ↾ 𝐴) “ 𝑧) ⊆ 𝑦))))
77	76	ralbidv 3156	. . . 4 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → (∀𝑦 ∈ 𝐾 ((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦)) ↔ ∀𝑦 ∈ 𝐾 (((𝐹 ↾ 𝐴)‘𝑃) ∈ 𝑦 → ∃𝑧 ∈ (𝐽 ↾_t 𝐴)(𝑃 ∈ 𝑧 ∧ ((𝐹 ↾ 𝐴) “ 𝑧) ⊆ 𝑦))))
78		simp2r 1201	. . . . 5 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → 𝐹:𝑋⟶𝑌)
79		simp3 1138	. . . . . 6 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → 𝐾 ∈ Top)
80	56, 9	sseldd 3944	. . . . . 6 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → 𝑃 ∈ 𝑋)
81		cnprest.2	. . . . . . . 8 ⊢ 𝑌 = ∪ 𝐾
82	5, 81	iscnp2 23159	. . . . . . 7 ⊢ (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ↔ ((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝑃 ∈ 𝑋) ∧ (𝐹:𝑋⟶𝑌 ∧ ∀𝑦 ∈ 𝐾 ((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦)))))
83	82	baib 535	. . . . . 6 ⊢ ((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝑃 ∈ 𝑋) → (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ↔ (𝐹:𝑋⟶𝑌 ∧ ∀𝑦 ∈ 𝐾 ((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦)))))
84	19, 79, 80, 83	syl3anc 1373	. . . . 5 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ↔ (𝐹:𝑋⟶𝑌 ∧ ∀𝑦 ∈ 𝐾 ((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦)))))
85	78, 84	mpbirand 707	. . . 4 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ↔ ∀𝑦 ∈ 𝐾 ((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦))))
86	78, 56	fssresd 6709	. . . . 5 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → (𝐹 ↾ 𝐴):𝐴⟶𝑌)
87	5	toptopon 22837	. . . . . . . 8 ⊢ (𝐽 ∈ Top ↔ 𝐽 ∈ (TopOn‘𝑋))
88	19, 87	sylib 218	. . . . . . 7 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → 𝐽 ∈ (TopOn‘𝑋))
89		resttopon 23081	. . . . . . 7 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴 ⊆ 𝑋) → (𝐽 ↾_t 𝐴) ∈ (TopOn‘𝐴))
90	88, 56, 89	syl2anc 584	. . . . . 6 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → (𝐽 ↾_t 𝐴) ∈ (TopOn‘𝐴))
91	81	toptopon 22837	. . . . . . 7 ⊢ (𝐾 ∈ Top ↔ 𝐾 ∈ (TopOn‘𝑌))
92	79, 91	sylib 218	. . . . . 6 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → 𝐾 ∈ (TopOn‘𝑌))
93		iscnp 23157	. . . . . 6 ⊢ (((𝐽 ↾_t 𝐴) ∈ (TopOn‘𝐴) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝑃 ∈ 𝐴) → ((𝐹 ↾ 𝐴) ∈ (((𝐽 ↾_t 𝐴) CnP 𝐾)‘𝑃) ↔ ((𝐹 ↾ 𝐴):𝐴⟶𝑌 ∧ ∀𝑦 ∈ 𝐾 (((𝐹 ↾ 𝐴)‘𝑃) ∈ 𝑦 → ∃𝑧 ∈ (𝐽 ↾_t 𝐴)(𝑃 ∈ 𝑧 ∧ ((𝐹 ↾ 𝐴) “ 𝑧) ⊆ 𝑦)))))
94	90, 92, 9, 93	syl3anc 1373	. . . . 5 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → ((𝐹 ↾ 𝐴) ∈ (((𝐽 ↾_t 𝐴) CnP 𝐾)‘𝑃) ↔ ((𝐹 ↾ 𝐴):𝐴⟶𝑌 ∧ ∀𝑦 ∈ 𝐾 (((𝐹 ↾ 𝐴)‘𝑃) ∈ 𝑦 → ∃𝑧 ∈ (𝐽 ↾_t 𝐴)(𝑃 ∈ 𝑧 ∧ ((𝐹 ↾ 𝐴) “ 𝑧) ⊆ 𝑦)))))
95	86, 94	mpbirand 707	. . . 4 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → ((𝐹 ↾ 𝐴) ∈ (((𝐽 ↾_t 𝐴) CnP 𝐾)‘𝑃) ↔ ∀𝑦 ∈ 𝐾 (((𝐹 ↾ 𝐴)‘𝑃) ∈ 𝑦 → ∃𝑧 ∈ (𝐽 ↾_t 𝐴)(𝑃 ∈ 𝑧 ∧ ((𝐹 ↾ 𝐴) “ 𝑧) ⊆ 𝑦))))
96	77, 85, 95	3bitr4d 311	. . 3 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ↔ (𝐹 ↾ 𝐴) ∈ (((𝐽 ↾_t 𝐴) CnP 𝐾)‘𝑃)))
97	96	3expia 1121	. 2 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌)) → (𝐾 ∈ Top → (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ↔ (𝐹 ↾ 𝐴) ∈ (((𝐽 ↾_t 𝐴) CnP 𝐾)‘𝑃))))
98	2, 4, 97	pm5.21ndd 379	1 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌)) → (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ↔ (𝐹 ↾ 𝐴) ∈ (((𝐽 ↾_t 𝐴) CnP 𝐾)‘𝑃)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1086 = wceq 1540 ∈ wcel 2109 ∀wral 3044 ∃wrex 3053 Vcvv 3444 ∩ cin 3910 ⊆ wss 3911 ∪ cuni 4867 ↾ cres 5633 “ cima 5634 ⟶wf 6495 ‘cfv 6499 (class class class)co 7369 ↾_t crest 17359 Topctop 22813 TopOnctopon 22830 intcnt 22937 CnP ccnp 23145

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 2701 ax-rep 5229 ax-sep 5246 ax-nul 5256 ax-pow 5315 ax-pr 5382 ax-un 7691

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-ral 3045 df-rex 3054 df-reu 3352 df-rab 3403 df-v 3446 df-sbc 3751 df-csb 3860 df-dif 3914 df-un 3916 df-in 3918 df-ss 3928 df-pss 3931 df-nul 4293 df-if 4485 df-pw 4561 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4868 df-int 4907 df-iun 4953 df-br 5103 df-opab 5165 df-mpt 5184 df-tr 5210 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-ord 6323 df-on 6324 df-lim 6325 df-suc 6326 df-iota 6452 df-fun 6501 df-fn 6502 df-f 6503 df-f1 6504 df-fo 6505 df-f1o 6506 df-fv 6507 df-ov 7372 df-oprab 7373 df-mpo 7374 df-om 7823 df-1st 7947 df-2nd 7948 df-map 8778 df-en 8896 df-fin 8899 df-fi 9338 df-rest 17361 df-topgen 17382 df-top 22814 df-topon 22831 df-bases 22866 df-ntr 22940 df-cnp 23148

This theorem is referenced by: limcres 25820 dvcnvrelem2 25956 psercn 26369 abelth 26384 cxpcn3 26691 efrlim 26912 efrlimOLD 26913 cvmlift2lem11 35293 cvmlift2lem12 35294 cvmlift3lem7 35305 cncfuni 45877 cncfiooicclem1 45884 dirkercncflem4 46097 fourierdlem62 46159

W3C validator