cnptoprest - Intuitionistic Logic Explorer

	Intuitionistic Logic Explorer		< Previous Next > Nearby theorems
Mirrors > Home > ILE Home > Th. List > cnptoprest		GIF version

Theorem cnptoprest 14123

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

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

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

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

Step	Hyp	Ref	Expression
1		simpl1 1002	. . . . . . . . 9 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌)) → 𝐽 ∈ Top)
2		simpl3 1004	. . . . . . . . 9 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌)) → 𝐴 ⊆ 𝑋)
3		cnprest.1	. . . . . . . . . 10 ⊢ 𝑋 = ∪ 𝐽
4	3	ntrss2 14005	. . . . . . . . 9 ⊢ ((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) → ((int‘𝐽)‘𝐴) ⊆ 𝐴)
5	1, 2, 4	syl2anc 411	. . . . . . . 8 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌)) → ((int‘𝐽)‘𝐴) ⊆ 𝐴)
6		simprl 529	. . . . . . . 8 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌)) → 𝑃 ∈ ((int‘𝐽)‘𝐴))
7	5, 6	sseldd 3171	. . . . . . 7 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌)) → 𝑃 ∈ 𝐴)
8		fvres 5554	. . . . . . 7 ⊢ (𝑃 ∈ 𝐴 → ((𝐹 ↾ 𝐴)‘𝑃) = (𝐹‘𝑃))
9	7, 8	syl 14	. . . . . 6 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌)) → ((𝐹 ↾ 𝐴)‘𝑃) = (𝐹‘𝑃))
10	9	eqcomd 2195	. . . . 5 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌)) → (𝐹‘𝑃) = ((𝐹 ↾ 𝐴)‘𝑃))
11	10	eleq1d 2258	. . . 4 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌)) → ((𝐹‘𝑃) ∈ 𝑦 ↔ ((𝐹 ↾ 𝐴)‘𝑃) ∈ 𝑦))
12		inss1 3370	. . . . . . . . 9 ⊢ (𝑥 ∩ 𝐴) ⊆ 𝑥
13		imass2 5019	. . . . . . . . 9 ⊢ ((𝑥 ∩ 𝐴) ⊆ 𝑥 → (𝐹 “ (𝑥 ∩ 𝐴)) ⊆ (𝐹 “ 𝑥))
14		sstr2 3177	. . . . . . . . 9 ⊢ ((𝐹 “ (𝑥 ∩ 𝐴)) ⊆ (𝐹 “ 𝑥) → ((𝐹 “ 𝑥) ⊆ 𝑦 → (𝐹 “ (𝑥 ∩ 𝐴)) ⊆ 𝑦))
15	12, 13, 14	mp2b 8	. . . . . . . 8 ⊢ ((𝐹 “ 𝑥) ⊆ 𝑦 → (𝐹 “ (𝑥 ∩ 𝐴)) ⊆ 𝑦)
16	15	anim2i 342	. . . . . . 7 ⊢ ((𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦) → (𝑃 ∈ 𝑥 ∧ (𝐹 “ (𝑥 ∩ 𝐴)) ⊆ 𝑦))
17	16	reximi 2587	. . . . . 6 ⊢ (∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦) → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ (𝑥 ∩ 𝐴)) ⊆ 𝑦))
18	3	ntropn 14001	. . . . . . . . . . . . 13 ⊢ ((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) → ((int‘𝐽)‘𝐴) ∈ 𝐽)
19	1, 2, 18	syl2anc 411	. . . . . . . . . . . 12 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌)) → ((int‘𝐽)‘𝐴) ∈ 𝐽)
20		inopn 13887	. . . . . . . . . . . . . 14 ⊢ ((𝐽 ∈ Top ∧ 𝑥 ∈ 𝐽 ∧ ((int‘𝐽)‘𝐴) ∈ 𝐽) → (𝑥 ∩ ((int‘𝐽)‘𝐴)) ∈ 𝐽)
21	20	3com23 1211	. . . . . . . . . . . . 13 ⊢ ((𝐽 ∈ Top ∧ ((int‘𝐽)‘𝐴) ∈ 𝐽 ∧ 𝑥 ∈ 𝐽) → (𝑥 ∩ ((int‘𝐽)‘𝐴)) ∈ 𝐽)
22	21	3expia 1207	. . . . . . . . . . . 12 ⊢ ((𝐽 ∈ Top ∧ ((int‘𝐽)‘𝐴) ∈ 𝐽) → (𝑥 ∈ 𝐽 → (𝑥 ∩ ((int‘𝐽)‘𝐴)) ∈ 𝐽))
23	1, 19, 22	syl2anc 411	. . . . . . . . . . 11 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌)) → (𝑥 ∈ 𝐽 → (𝑥 ∩ ((int‘𝐽)‘𝐴)) ∈ 𝐽))
24		elin 3333	. . . . . . . . . . . . . 14 ⊢ (𝑃 ∈ (𝑥 ∩ ((int‘𝐽)‘𝐴)) ↔ (𝑃 ∈ 𝑥 ∧ 𝑃 ∈ ((int‘𝐽)‘𝐴)))
25	24	simplbi2com 1455	. . . . . . . . . . . . 13 ⊢ (𝑃 ∈ ((int‘𝐽)‘𝐴) → (𝑃 ∈ 𝑥 → 𝑃 ∈ (𝑥 ∩ ((int‘𝐽)‘𝐴))))
26	6, 25	syl 14	. . . . . . . . . . . 12 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌)) → (𝑃 ∈ 𝑥 → 𝑃 ∈ (𝑥 ∩ ((int‘𝐽)‘𝐴))))
27		sslin 3376	. . . . . . . . . . . . . 14 ⊢ (((int‘𝐽)‘𝐴) ⊆ 𝐴 → (𝑥 ∩ ((int‘𝐽)‘𝐴)) ⊆ (𝑥 ∩ 𝐴))
28		imass2 5019	. . . . . . . . . . . . . 14 ⊢ ((𝑥 ∩ ((int‘𝐽)‘𝐴)) ⊆ (𝑥 ∩ 𝐴) → (𝐹 “ (𝑥 ∩ ((int‘𝐽)‘𝐴))) ⊆ (𝐹 “ (𝑥 ∩ 𝐴)))
29	5, 27, 28	3syl 17	. . . . . . . . . . . . 13 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌)) → (𝐹 “ (𝑥 ∩ ((int‘𝐽)‘𝐴))) ⊆ (𝐹 “ (𝑥 ∩ 𝐴)))
30		sstr2 3177	. . . . . . . . . . . . 13 ⊢ ((𝐹 “ (𝑥 ∩ ((int‘𝐽)‘𝐴))) ⊆ (𝐹 “ (𝑥 ∩ 𝐴)) → ((𝐹 “ (𝑥 ∩ 𝐴)) ⊆ 𝑦 → (𝐹 “ (𝑥 ∩ ((int‘𝐽)‘𝐴))) ⊆ 𝑦))
31	29, 30	syl 14	. . . . . . . . . . . 12 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌)) → ((𝐹 “ (𝑥 ∩ 𝐴)) ⊆ 𝑦 → (𝐹 “ (𝑥 ∩ ((int‘𝐽)‘𝐴))) ⊆ 𝑦))
32	26, 31	anim12d 335	. . . . . . . . . . 11 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌)) → ((𝑃 ∈ 𝑥 ∧ (𝐹 “ (𝑥 ∩ 𝐴)) ⊆ 𝑦) → (𝑃 ∈ (𝑥 ∩ ((int‘𝐽)‘𝐴)) ∧ (𝐹 “ (𝑥 ∩ ((int‘𝐽)‘𝐴))) ⊆ 𝑦)))
33	23, 32	anim12d 335	. . . . . . . . . 10 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌)) → ((𝑥 ∈ 𝐽 ∧ (𝑃 ∈ 𝑥 ∧ (𝐹 “ (𝑥 ∩ 𝐴)) ⊆ 𝑦)) → ((𝑥 ∩ ((int‘𝐽)‘𝐴)) ∈ 𝐽 ∧ (𝑃 ∈ (𝑥 ∩ ((int‘𝐽)‘𝐴)) ∧ (𝐹 “ (𝑥 ∩ ((int‘𝐽)‘𝐴))) ⊆ 𝑦))))
34		eleq2 2253	. . . . . . . . . . . 12 ⊢ (𝑧 = (𝑥 ∩ ((int‘𝐽)‘𝐴)) → (𝑃 ∈ 𝑧 ↔ 𝑃 ∈ (𝑥 ∩ ((int‘𝐽)‘𝐴))))
35		imaeq2 4981	. . . . . . . . . . . . 13 ⊢ (𝑧 = (𝑥 ∩ ((int‘𝐽)‘𝐴)) → (𝐹 “ 𝑧) = (𝐹 “ (𝑥 ∩ ((int‘𝐽)‘𝐴))))
36	35	sseq1d 3199	. . . . . . . . . . . 12 ⊢ (𝑧 = (𝑥 ∩ ((int‘𝐽)‘𝐴)) → ((𝐹 “ 𝑧) ⊆ 𝑦 ↔ (𝐹 “ (𝑥 ∩ ((int‘𝐽)‘𝐴))) ⊆ 𝑦))
37	34, 36	anbi12d 473	. . . . . . . . . . 11 ⊢ (𝑧 = (𝑥 ∩ ((int‘𝐽)‘𝐴)) → ((𝑃 ∈ 𝑧 ∧ (𝐹 “ 𝑧) ⊆ 𝑦) ↔ (𝑃 ∈ (𝑥 ∩ ((int‘𝐽)‘𝐴)) ∧ (𝐹 “ (𝑥 ∩ ((int‘𝐽)‘𝐴))) ⊆ 𝑦)))
38	37	rspcev 2856	. . . . . . . . . 10 ⊢ (((𝑥 ∩ ((int‘𝐽)‘𝐴)) ∈ 𝐽 ∧ (𝑃 ∈ (𝑥 ∩ ((int‘𝐽)‘𝐴)) ∧ (𝐹 “ (𝑥 ∩ ((int‘𝐽)‘𝐴))) ⊆ 𝑦)) → ∃𝑧 ∈ 𝐽 (𝑃 ∈ 𝑧 ∧ (𝐹 “ 𝑧) ⊆ 𝑦))
39	33, 38	syl6 33	. . . . . . . . 9 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌)) → ((𝑥 ∈ 𝐽 ∧ (𝑃 ∈ 𝑥 ∧ (𝐹 “ (𝑥 ∩ 𝐴)) ⊆ 𝑦)) → ∃𝑧 ∈ 𝐽 (𝑃 ∈ 𝑧 ∧ (𝐹 “ 𝑧) ⊆ 𝑦)))
40	39	expdimp 259	. . . . . . . 8 ⊢ ((((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌)) ∧ 𝑥 ∈ 𝐽) → ((𝑃 ∈ 𝑥 ∧ (𝐹 “ (𝑥 ∩ 𝐴)) ⊆ 𝑦) → ∃𝑧 ∈ 𝐽 (𝑃 ∈ 𝑧 ∧ (𝐹 “ 𝑧) ⊆ 𝑦)))
41	40	rexlimdva 2607	. . . . . . 7 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌)) → (∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ (𝑥 ∩ 𝐴)) ⊆ 𝑦) → ∃𝑧 ∈ 𝐽 (𝑃 ∈ 𝑧 ∧ (𝐹 “ 𝑧) ⊆ 𝑦)))
42		eleq2 2253	. . . . . . . . 9 ⊢ (𝑧 = 𝑥 → (𝑃 ∈ 𝑧 ↔ 𝑃 ∈ 𝑥))
43		imaeq2 4981	. . . . . . . . . 10 ⊢ (𝑧 = 𝑥 → (𝐹 “ 𝑧) = (𝐹 “ 𝑥))
44	43	sseq1d 3199	. . . . . . . . 9 ⊢ (𝑧 = 𝑥 → ((𝐹 “ 𝑧) ⊆ 𝑦 ↔ (𝐹 “ 𝑥) ⊆ 𝑦))
45	42, 44	anbi12d 473	. . . . . . . 8 ⊢ (𝑧 = 𝑥 → ((𝑃 ∈ 𝑧 ∧ (𝐹 “ 𝑧) ⊆ 𝑦) ↔ (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦)))
46	45	cbvrexv 2719	. . . . . . 7 ⊢ (∃𝑧 ∈ 𝐽 (𝑃 ∈ 𝑧 ∧ (𝐹 “ 𝑧) ⊆ 𝑦) ↔ ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦))
47	41, 46	imbitrdi 161	. . . . . 6 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌)) → (∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ (𝑥 ∩ 𝐴)) ⊆ 𝑦) → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦)))
48	17, 47	impbid2 143	. . . . 5 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌)) → (∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦) ↔ ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ (𝑥 ∩ 𝐴)) ⊆ 𝑦)))
49		vex 2755	. . . . . . . 8 ⊢ 𝑥 ∈ V
50	49	inex1 4152	. . . . . . 7 ⊢ (𝑥 ∩ 𝐴) ∈ V
51	50	a1i 9	. . . . . 6 ⊢ ((((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌)) ∧ 𝑥 ∈ 𝐽) → (𝑥 ∩ 𝐴) ∈ V)
52		uniexg 4454	. . . . . . . . 9 ⊢ (𝐽 ∈ Top → ∪ 𝐽 ∈ V)
53	1, 52	syl 14	. . . . . . . 8 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌)) → ∪ 𝐽 ∈ V)
54	2, 3	sseqtrdi 3218	. . . . . . . 8 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌)) → 𝐴 ⊆ ∪ 𝐽)
55	53, 54	ssexd 4158	. . . . . . 7 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌)) → 𝐴 ∈ V)
56		elrest 12717	. . . . . . 7 ⊢ ((𝐽 ∈ Top ∧ 𝐴 ∈ V) → (𝑧 ∈ (𝐽 ↾_t 𝐴) ↔ ∃𝑥 ∈ 𝐽 𝑧 = (𝑥 ∩ 𝐴)))
57	1, 55, 56	syl2anc 411	. . . . . 6 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌)) → (𝑧 ∈ (𝐽 ↾_t 𝐴) ↔ ∃𝑥 ∈ 𝐽 𝑧 = (𝑥 ∩ 𝐴)))
58		eleq2 2253	. . . . . . . 8 ⊢ (𝑧 = (𝑥 ∩ 𝐴) → (𝑃 ∈ 𝑧 ↔ 𝑃 ∈ (𝑥 ∩ 𝐴)))
59		elin 3333	. . . . . . . . . 10 ⊢ (𝑃 ∈ (𝑥 ∩ 𝐴) ↔ (𝑃 ∈ 𝑥 ∧ 𝑃 ∈ 𝐴))
60	59	rbaib 922	. . . . . . . . 9 ⊢ (𝑃 ∈ 𝐴 → (𝑃 ∈ (𝑥 ∩ 𝐴) ↔ 𝑃 ∈ 𝑥))
61	7, 60	syl 14	. . . . . . . 8 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌)) → (𝑃 ∈ (𝑥 ∩ 𝐴) ↔ 𝑃 ∈ 𝑥))
62	58, 61	sylan9bbr 463	. . . . . . 7 ⊢ ((((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌)) ∧ 𝑧 = (𝑥 ∩ 𝐴)) → (𝑃 ∈ 𝑧 ↔ 𝑃 ∈ 𝑥))
63		simpr 110	. . . . . . . . . 10 ⊢ ((((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌)) ∧ 𝑧 = (𝑥 ∩ 𝐴)) → 𝑧 = (𝑥 ∩ 𝐴))
64	63	imaeq2d 4985	. . . . . . . . 9 ⊢ ((((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌)) ∧ 𝑧 = (𝑥 ∩ 𝐴)) → ((𝐹 ↾ 𝐴) “ 𝑧) = ((𝐹 ↾ 𝐴) “ (𝑥 ∩ 𝐴)))
65		inss2 3371	. . . . . . . . . 10 ⊢ (𝑥 ∩ 𝐴) ⊆ 𝐴
66		resima2 4956	. . . . . . . . . 10 ⊢ ((𝑥 ∩ 𝐴) ⊆ 𝐴 → ((𝐹 ↾ 𝐴) “ (𝑥 ∩ 𝐴)) = (𝐹 “ (𝑥 ∩ 𝐴)))
67	65, 66	ax-mp 5	. . . . . . . . 9 ⊢ ((𝐹 ↾ 𝐴) “ (𝑥 ∩ 𝐴)) = (𝐹 “ (𝑥 ∩ 𝐴))
68	64, 67	eqtrdi 2238	. . . . . . . 8 ⊢ ((((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌)) ∧ 𝑧 = (𝑥 ∩ 𝐴)) → ((𝐹 ↾ 𝐴) “ 𝑧) = (𝐹 “ (𝑥 ∩ 𝐴)))
69	68	sseq1d 3199	. . . . . . 7 ⊢ ((((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌)) ∧ 𝑧 = (𝑥 ∩ 𝐴)) → (((𝐹 ↾ 𝐴) “ 𝑧) ⊆ 𝑦 ↔ (𝐹 “ (𝑥 ∩ 𝐴)) ⊆ 𝑦))
70	62, 69	anbi12d 473	. . . . . 6 ⊢ ((((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌)) ∧ 𝑧 = (𝑥 ∩ 𝐴)) → ((𝑃 ∈ 𝑧 ∧ ((𝐹 ↾ 𝐴) “ 𝑧) ⊆ 𝑦) ↔ (𝑃 ∈ 𝑥 ∧ (𝐹 “ (𝑥 ∩ 𝐴)) ⊆ 𝑦)))
71	51, 57, 70	rexxfr2d 4480	. . . . 5 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌)) → (∃𝑧 ∈ (𝐽 ↾_t 𝐴)(𝑃 ∈ 𝑧 ∧ ((𝐹 ↾ 𝐴) “ 𝑧) ⊆ 𝑦) ↔ ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ (𝑥 ∩ 𝐴)) ⊆ 𝑦)))
72	48, 71	bitr4d 191	. . . 4 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌)) → (∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦) ↔ ∃𝑧 ∈ (𝐽 ↾_t 𝐴)(𝑃 ∈ 𝑧 ∧ ((𝐹 ↾ 𝐴) “ 𝑧) ⊆ 𝑦)))
73	11, 72	imbi12d 234	. . 3 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌)) → (((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦)) ↔ (((𝐹 ↾ 𝐴)‘𝑃) ∈ 𝑦 → ∃𝑧 ∈ (𝐽 ↾_t 𝐴)(𝑃 ∈ 𝑧 ∧ ((𝐹 ↾ 𝐴) “ 𝑧) ⊆ 𝑦))))
74	73	ralbidv 2490	. 2 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌)) → (∀𝑦 ∈ 𝐾 ((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦)) ↔ ∀𝑦 ∈ 𝐾 (((𝐹 ↾ 𝐴)‘𝑃) ∈ 𝑦 → ∃𝑧 ∈ (𝐽 ↾_t 𝐴)(𝑃 ∈ 𝑧 ∧ ((𝐹 ↾ 𝐴) “ 𝑧) ⊆ 𝑦))))
75	3	toptopon 13902	. . . . 5 ⊢ (𝐽 ∈ Top ↔ 𝐽 ∈ (TopOn‘𝑋))
76	1, 75	sylib 122	. . . 4 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌)) → 𝐽 ∈ (TopOn‘𝑋))
77		simpl2 1003	. . . . 5 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌)) → 𝐾 ∈ Top)
78		cnprest.2	. . . . . 6 ⊢ 𝑌 = ∪ 𝐾
79	78	toptopon 13902	. . . . 5 ⊢ (𝐾 ∈ Top ↔ 𝐾 ∈ (TopOn‘𝑌))
80	77, 79	sylib 122	. . . 4 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌)) → 𝐾 ∈ (TopOn‘𝑌))
81	2, 7	sseldd 3171	. . . 4 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌)) → 𝑃 ∈ 𝑋)
82		iscnp 14083	. . . 4 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝑃 ∈ 𝑋) → (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ↔ (𝐹:𝑋⟶𝑌 ∧ ∀𝑦 ∈ 𝐾 ((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦)))))
83	76, 80, 81, 82	syl3anc 1249	. . 3 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌)) → (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ↔ (𝐹:𝑋⟶𝑌 ∧ ∀𝑦 ∈ 𝐾 ((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦)))))
84		simprr 531	. . . 4 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌)) → 𝐹:𝑋⟶𝑌)
85	84	biantrurd 305	. . 3 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌)) → (∀𝑦 ∈ 𝐾 ((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦)) ↔ (𝐹:𝑋⟶𝑌 ∧ ∀𝑦 ∈ 𝐾 ((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦)))))
86	83, 85	bitr4d 191	. 2 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌)) → (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ↔ ∀𝑦 ∈ 𝐾 ((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦))))
87		simp1l 1023	. . . . . . 7 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → 𝐽 ∈ Top)
88	87, 75	sylib 122	. . . . . 6 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → 𝐽 ∈ (TopOn‘𝑋))
89		simp1r 1024	. . . . . 6 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → 𝐴 ⊆ 𝑋)
90		resttopon 14055	. . . . . 6 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴 ⊆ 𝑋) → (𝐽 ↾_t 𝐴) ∈ (TopOn‘𝐴))
91	88, 89, 90	syl2anc 411	. . . . 5 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → (𝐽 ↾_t 𝐴) ∈ (TopOn‘𝐴))
92		simp3 1001	. . . . . 6 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → 𝐾 ∈ Top)
93	92, 79	sylib 122	. . . . 5 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → 𝐾 ∈ (TopOn‘𝑌))
94	4	3ad2ant1 1020	. . . . . 6 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → ((int‘𝐽)‘𝐴) ⊆ 𝐴)
95		simp2l 1025	. . . . . 6 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → 𝑃 ∈ ((int‘𝐽)‘𝐴))
96	94, 95	sseldd 3171	. . . . 5 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → 𝑃 ∈ 𝐴)
97		iscnp 14083	. . . . 5 ⊢ (((𝐽 ↾_t 𝐴) ∈ (TopOn‘𝐴) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝑃 ∈ 𝐴) → ((𝐹 ↾ 𝐴) ∈ (((𝐽 ↾_t 𝐴) CnP 𝐾)‘𝑃) ↔ ((𝐹 ↾ 𝐴):𝐴⟶𝑌 ∧ ∀𝑦 ∈ 𝐾 (((𝐹 ↾ 𝐴)‘𝑃) ∈ 𝑦 → ∃𝑧 ∈ (𝐽 ↾_t 𝐴)(𝑃 ∈ 𝑧 ∧ ((𝐹 ↾ 𝐴) “ 𝑧) ⊆ 𝑦)))))
98	91, 93, 96, 97	syl3anc 1249	. . . 4 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → ((𝐹 ↾ 𝐴) ∈ (((𝐽 ↾_t 𝐴) CnP 𝐾)‘𝑃) ↔ ((𝐹 ↾ 𝐴):𝐴⟶𝑌 ∧ ∀𝑦 ∈ 𝐾 (((𝐹 ↾ 𝐴)‘𝑃) ∈ 𝑦 → ∃𝑧 ∈ (𝐽 ↾_t 𝐴)(𝑃 ∈ 𝑧 ∧ ((𝐹 ↾ 𝐴) “ 𝑧) ⊆ 𝑦)))))
99		simp2r 1026	. . . . . 6 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → 𝐹:𝑋⟶𝑌)
100	99, 89	fssresd 5407	. . . . 5 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → (𝐹 ↾ 𝐴):𝐴⟶𝑌)
101	100	biantrurd 305	. . . 4 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → (∀𝑦 ∈ 𝐾 (((𝐹 ↾ 𝐴)‘𝑃) ∈ 𝑦 → ∃𝑧 ∈ (𝐽 ↾_t 𝐴)(𝑃 ∈ 𝑧 ∧ ((𝐹 ↾ 𝐴) “ 𝑧) ⊆ 𝑦)) ↔ ((𝐹 ↾ 𝐴):𝐴⟶𝑌 ∧ ∀𝑦 ∈ 𝐾 (((𝐹 ↾ 𝐴)‘𝑃) ∈ 𝑦 → ∃𝑧 ∈ (𝐽 ↾_t 𝐴)(𝑃 ∈ 𝑧 ∧ ((𝐹 ↾ 𝐴) “ 𝑧) ⊆ 𝑦)))))
102	98, 101	bitr4d 191	. . 3 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝐾 ∈ Top) → ((𝐹 ↾ 𝐴) ∈ (((𝐽 ↾_t 𝐴) CnP 𝐾)‘𝑃) ↔ ∀𝑦 ∈ 𝐾 (((𝐹 ↾ 𝐴)‘𝑃) ∈ 𝑦 → ∃𝑧 ∈ (𝐽 ↾_t 𝐴)(𝑃 ∈ 𝑧 ∧ ((𝐹 ↾ 𝐴) “ 𝑧) ⊆ 𝑦))))
103	1, 2, 6, 84, 77, 102	syl221anc 1260	. 2 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌)) → ((𝐹 ↾ 𝐴) ∈ (((𝐽 ↾_t 𝐴) CnP 𝐾)‘𝑃) ↔ ∀𝑦 ∈ 𝐾 (((𝐹 ↾ 𝐴)‘𝑃) ∈ 𝑦 → ∃𝑧 ∈ (𝐽 ↾_t 𝐴)(𝑃 ∈ 𝑧 ∧ ((𝐹 ↾ 𝐴) “ 𝑧) ⊆ 𝑦))))
104	74, 86, 103	3bitr4d 220	1 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝐴 ⊆ 𝑋) ∧ (𝑃 ∈ ((int‘𝐽)‘𝐴) ∧ 𝐹:𝑋⟶𝑌)) → (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ↔ (𝐹 ↾ 𝐴) ∈ (((𝐽 ↾_t 𝐴) CnP 𝐾)‘𝑃)))

Colors of variables: wff set class

Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 ∧ w3a 980 = wceq 1364 ∈ wcel 2160 ∀wral 2468 ∃wrex 2469 Vcvv 2752 ∩ cin 3143 ⊆ wss 3144 ∪ cuni 3824 ↾ cres 4643 “ cima 4644 ⟶wf 5227 ‘cfv 5231 (class class class)co 5891 ↾_t crest 12710 Topctop 13881 TopOnctopon 13894 intcnt 13977 CnP ccnp 14070

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 615 ax-in2 616 ax-io 710 ax-5 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-10 1516 ax-11 1517 ax-i12 1518 ax-bndl 1520 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-13 2162 ax-14 2163 ax-ext 2171 ax-coll 4133 ax-sep 4136 ax-pow 4189 ax-pr 4224 ax-un 4448 ax-setind 4551

This theorem depends on definitions: df-bi 117 df-3an 982 df-tru 1367 df-fal 1370 df-nf 1472 df-sb 1774 df-eu 2041 df-mo 2042 df-clab 2176 df-cleq 2182 df-clel 2185 df-nfc 2321 df-ne 2361 df-ral 2473 df-rex 2474 df-reu 2475 df-rab 2477 df-v 2754 df-sbc 2978 df-csb 3073 df-dif 3146 df-un 3148 df-in 3150 df-ss 3157 df-pw 3592 df-sn 3613 df-pr 3614 df-op 3616 df-uni 3825 df-iun 3903 df-br 4019 df-opab 4080 df-mpt 4081 df-id 4308 df-xp 4647 df-rel 4648 df-cnv 4649 df-co 4650 df-dm 4651 df-rn 4652 df-res 4653 df-ima 4654 df-iota 5193 df-fun 5233 df-fn 5234 df-f 5235 df-f1 5236 df-fo 5237 df-f1o 5238 df-fv 5239 df-ov 5894 df-oprab 5895 df-mpo 5896 df-1st 6159 df-2nd 6160 df-map 6668 df-rest 12712 df-topgen 12731 df-top 13882 df-topon 13895 df-bases 13927 df-ntr 13980 df-cnp 14073

This theorem is referenced by: (None)

W3C validator