Theorem cnrest2 14556

Description: Equivalence of continuity in the parent topology and continuity in a subspace. (Contributed by Jeff Hankins, 10-Jul-2009.) (Proof shortened by Mario Carneiro, 21-Aug-2015.)

Assertion

Ref	Expression
cnrest2	⊢ ((𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 ⊆ 𝐵 ∧ 𝐵 ⊆ 𝑌) → (𝐹 ∈ (𝐽 Cn 𝐾) ↔ 𝐹 ∈ (𝐽 Cn (𝐾 ↾t 𝐵))))

Proof of Theorem cnrest2

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		cntop1 14521	. . . 4 ⊢ (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐽 ∈ Top)
2	1	a1i 9	. . 3 ⊢ ((𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 ⊆ 𝐵 ∧ 𝐵 ⊆ 𝑌) → (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐽 ∈ Top))
3		eqid 2196	. . . . . . . 8 ⊢ ∪ 𝐽 = ∪ 𝐽
4		eqid 2196	. . . . . . . 8 ⊢ ∪ 𝐾 = ∪ 𝐾
5	3, 4	cnf 14524	. . . . . . 7 ⊢ (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐹:∪ 𝐽⟶∪ 𝐾)
6	5	ffnd 5411	. . . . . 6 ⊢ (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐹 Fn ∪ 𝐽)
7	6	a1i 9	. . . . 5 ⊢ ((𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 ⊆ 𝐵 ∧ 𝐵 ⊆ 𝑌) → (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐹 Fn ∪ 𝐽))
8		simp2 1000	. . . . 5 ⊢ ((𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 ⊆ 𝐵 ∧ 𝐵 ⊆ 𝑌) → ran 𝐹 ⊆ 𝐵)
9	7, 8	jctird 317	. . . 4 ⊢ ((𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 ⊆ 𝐵 ∧ 𝐵 ⊆ 𝑌) → (𝐹 ∈ (𝐽 Cn 𝐾) → (𝐹 Fn ∪ 𝐽 ∧ ran 𝐹 ⊆ 𝐵)))
10		df-f 5263	. . . 4 ⊢ (𝐹:∪ 𝐽⟶𝐵 ↔ (𝐹 Fn ∪ 𝐽 ∧ ran 𝐹 ⊆ 𝐵))
11	9, 10	imbitrrdi 162	. . 3 ⊢ ((𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 ⊆ 𝐵 ∧ 𝐵 ⊆ 𝑌) → (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐹:∪ 𝐽⟶𝐵))
12	2, 11	jcad 307	. 2 ⊢ ((𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 ⊆ 𝐵 ∧ 𝐵 ⊆ 𝑌) → (𝐹 ∈ (𝐽 Cn 𝐾) → (𝐽 ∈ Top ∧ 𝐹:∪ 𝐽⟶𝐵)))
13		cntop1 14521	. . . . 5 ⊢ (𝐹 ∈ (𝐽 Cn (𝐾 ↾t 𝐵)) → 𝐽 ∈ Top)
14	13	adantl 277	. . . 4 ⊢ (((𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 ⊆ 𝐵 ∧ 𝐵 ⊆ 𝑌) ∧ 𝐹 ∈ (𝐽 Cn (𝐾 ↾t 𝐵))) → 𝐽 ∈ Top)
15	3	toptopon 14338	. . . . . 6 ⊢ (𝐽 ∈ Top ↔ 𝐽 ∈ (TopOn‘∪ 𝐽))
16	14, 15	sylib 122	. . . . 5 ⊢ (((𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 ⊆ 𝐵 ∧ 𝐵 ⊆ 𝑌) ∧ 𝐹 ∈ (𝐽 Cn (𝐾 ↾t 𝐵))) → 𝐽 ∈ (TopOn‘∪ 𝐽))
17		resttopon 14491	. . . . . . 7 ⊢ ((𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵 ⊆ 𝑌) → (𝐾 ↾t 𝐵) ∈ (TopOn‘𝐵))
18	17	3adant2 1018	. . . . . 6 ⊢ ((𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 ⊆ 𝐵 ∧ 𝐵 ⊆ 𝑌) → (𝐾 ↾t 𝐵) ∈ (TopOn‘𝐵))
19	18	adantr 276	. . . . 5 ⊢ (((𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 ⊆ 𝐵 ∧ 𝐵 ⊆ 𝑌) ∧ 𝐹 ∈ (𝐽 Cn (𝐾 ↾t 𝐵))) → (𝐾 ↾t 𝐵) ∈ (TopOn‘𝐵))
20		simpr 110	. . . . 5 ⊢ (((𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 ⊆ 𝐵 ∧ 𝐵 ⊆ 𝑌) ∧ 𝐹 ∈ (𝐽 Cn (𝐾 ↾t 𝐵))) → 𝐹 ∈ (𝐽 Cn (𝐾 ↾t 𝐵)))
21		cnf2 14525	. . . . 5 ⊢ ((𝐽 ∈ (TopOn‘∪ 𝐽) ∧ (𝐾 ↾t 𝐵) ∈ (TopOn‘𝐵) ∧ 𝐹 ∈ (𝐽 Cn (𝐾 ↾t 𝐵))) → 𝐹:∪ 𝐽⟶𝐵)
22	16, 19, 20, 21	syl3anc 1249	. . . 4 ⊢ (((𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 ⊆ 𝐵 ∧ 𝐵 ⊆ 𝑌) ∧ 𝐹 ∈ (𝐽 Cn (𝐾 ↾t 𝐵))) → 𝐹:∪ 𝐽⟶𝐵)
23	14, 22	jca 306	. . 3 ⊢ (((𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 ⊆ 𝐵 ∧ 𝐵 ⊆ 𝑌) ∧ 𝐹 ∈ (𝐽 Cn (𝐾 ↾t 𝐵))) → (𝐽 ∈ Top ∧ 𝐹:∪ 𝐽⟶𝐵))
24	23	ex 115	. 2 ⊢ ((𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 ⊆ 𝐵 ∧ 𝐵 ⊆ 𝑌) → (𝐹 ∈ (𝐽 Cn (𝐾 ↾t 𝐵)) → (𝐽 ∈ Top ∧ 𝐹:∪ 𝐽⟶𝐵)))
25		vex 2766	. . . . . . . . 9 ⊢ 𝑥 ∈ V
26	25	inex1 4168	. . . . . . . 8 ⊢ (𝑥 ∩ 𝐵) ∈ V
27	26	a1i 9	. . . . . . 7 ⊢ ((((𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 ⊆ 𝐵 ∧ 𝐵 ⊆ 𝑌) ∧ (𝐽 ∈ Top ∧ 𝐹:∪ 𝐽⟶𝐵)) ∧ 𝑥 ∈ 𝐾) → (𝑥 ∩ 𝐵) ∈ V)
28		simpl1 1002	. . . . . . . 8 ⊢ (((𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 ⊆ 𝐵 ∧ 𝐵 ⊆ 𝑌) ∧ (𝐽 ∈ Top ∧ 𝐹:∪ 𝐽⟶𝐵)) → 𝐾 ∈ (TopOn‘𝑌))
29		toponmax 14345	. . . . . . . . . 10 ⊢ (𝐾 ∈ (TopOn‘𝑌) → 𝑌 ∈ 𝐾)
30	28, 29	syl 14	. . . . . . . . 9 ⊢ (((𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 ⊆ 𝐵 ∧ 𝐵 ⊆ 𝑌) ∧ (𝐽 ∈ Top ∧ 𝐹:∪ 𝐽⟶𝐵)) → 𝑌 ∈ 𝐾)
31		simpl3 1004	. . . . . . . . 9 ⊢ (((𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 ⊆ 𝐵 ∧ 𝐵 ⊆ 𝑌) ∧ (𝐽 ∈ Top ∧ 𝐹:∪ 𝐽⟶𝐵)) → 𝐵 ⊆ 𝑌)
32	30, 31	ssexd 4174	. . . . . . . 8 ⊢ (((𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 ⊆ 𝐵 ∧ 𝐵 ⊆ 𝑌) ∧ (𝐽 ∈ Top ∧ 𝐹:∪ 𝐽⟶𝐵)) → 𝐵 ∈ V)
33		elrest 12948	. . . . . . . 8 ⊢ ((𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵 ∈ V) → (𝑦 ∈ (𝐾 ↾t 𝐵) ↔ ∃𝑥 ∈ 𝐾 𝑦 = (𝑥 ∩ 𝐵)))
34	28, 32, 33	syl2anc 411	. . . . . . 7 ⊢ (((𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 ⊆ 𝐵 ∧ 𝐵 ⊆ 𝑌) ∧ (𝐽 ∈ Top ∧ 𝐹:∪ 𝐽⟶𝐵)) → (𝑦 ∈ (𝐾 ↾t 𝐵) ↔ ∃𝑥 ∈ 𝐾 𝑦 = (𝑥 ∩ 𝐵)))
35		imaeq2 5006	. . . . . . . . 9 ⊢ (𝑦 = (𝑥 ∩ 𝐵) → (◡𝐹 “ 𝑦) = (◡𝐹 “ (𝑥 ∩ 𝐵)))
36	35	eleq1d 2265	. . . . . . . 8 ⊢ (𝑦 = (𝑥 ∩ 𝐵) → ((◡𝐹 “ 𝑦) ∈ 𝐽 ↔ (◡𝐹 “ (𝑥 ∩ 𝐵)) ∈ 𝐽))
37	36	adantl 277	. . . . . . 7 ⊢ ((((𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 ⊆ 𝐵 ∧ 𝐵 ⊆ 𝑌) ∧ (𝐽 ∈ Top ∧ 𝐹:∪ 𝐽⟶𝐵)) ∧ 𝑦 = (𝑥 ∩ 𝐵)) → ((◡𝐹 “ 𝑦) ∈ 𝐽 ↔ (◡𝐹 “ (𝑥 ∩ 𝐵)) ∈ 𝐽))
38	27, 34, 37	ralxfr2d 4500	. . . . . 6 ⊢ (((𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 ⊆ 𝐵 ∧ 𝐵 ⊆ 𝑌) ∧ (𝐽 ∈ Top ∧ 𝐹:∪ 𝐽⟶𝐵)) → (∀𝑦 ∈ (𝐾 ↾t 𝐵)(◡𝐹 “ 𝑦) ∈ 𝐽 ↔ ∀𝑥 ∈ 𝐾 (◡𝐹 “ (𝑥 ∩ 𝐵)) ∈ 𝐽))
39		simplrr 536	. . . . . . . . . 10 ⊢ ((((𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 ⊆ 𝐵 ∧ 𝐵 ⊆ 𝑌) ∧ (𝐽 ∈ Top ∧ 𝐹:∪ 𝐽⟶𝐵)) ∧ 𝑥 ∈ 𝐾) → 𝐹:∪ 𝐽⟶𝐵)
40		ffun 5413	. . . . . . . . . 10 ⊢ (𝐹:∪ 𝐽⟶𝐵 → Fun 𝐹)
41		inpreima 5691	. . . . . . . . . 10 ⊢ (Fun 𝐹 → (◡𝐹 “ (𝑥 ∩ 𝐵)) = ((◡𝐹 “ 𝑥) ∩ (◡𝐹 “ 𝐵)))
42	39, 40, 41	3syl 17	. . . . . . . . 9 ⊢ ((((𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 ⊆ 𝐵 ∧ 𝐵 ⊆ 𝑌) ∧ (𝐽 ∈ Top ∧ 𝐹:∪ 𝐽⟶𝐵)) ∧ 𝑥 ∈ 𝐾) → (◡𝐹 “ (𝑥 ∩ 𝐵)) = ((◡𝐹 “ 𝑥) ∩ (◡𝐹 “ 𝐵)))
43		cnvimass 5033	. . . . . . . . . . . 12 ⊢ (◡𝐹 “ 𝑥) ⊆ dom 𝐹
44		cnvimarndm 5034	. . . . . . . . . . . 12 ⊢ (◡𝐹 “ ran 𝐹) = dom 𝐹
45	43, 44	sseqtrri 3219	. . . . . . . . . . 11 ⊢ (◡𝐹 “ 𝑥) ⊆ (◡𝐹 “ ran 𝐹)
46		simpll2 1039	. . . . . . . . . . . 12 ⊢ ((((𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 ⊆ 𝐵 ∧ 𝐵 ⊆ 𝑌) ∧ (𝐽 ∈ Top ∧ 𝐹:∪ 𝐽⟶𝐵)) ∧ 𝑥 ∈ 𝐾) → ran 𝐹 ⊆ 𝐵)
47		imass2 5046	. . . . . . . . . . . 12 ⊢ (ran 𝐹 ⊆ 𝐵 → (◡𝐹 “ ran 𝐹) ⊆ (◡𝐹 “ 𝐵))
48	46, 47	syl 14	. . . . . . . . . . 11 ⊢ ((((𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 ⊆ 𝐵 ∧ 𝐵 ⊆ 𝑌) ∧ (𝐽 ∈ Top ∧ 𝐹:∪ 𝐽⟶𝐵)) ∧ 𝑥 ∈ 𝐾) → (◡𝐹 “ ran 𝐹) ⊆ (◡𝐹 “ 𝐵))
49	45, 48	sstrid 3195	. . . . . . . . . 10 ⊢ ((((𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 ⊆ 𝐵 ∧ 𝐵 ⊆ 𝑌) ∧ (𝐽 ∈ Top ∧ 𝐹:∪ 𝐽⟶𝐵)) ∧ 𝑥 ∈ 𝐾) → (◡𝐹 “ 𝑥) ⊆ (◡𝐹 “ 𝐵))
50		df-ss 3170	. . . . . . . . . 10 ⊢ ((◡𝐹 “ 𝑥) ⊆ (◡𝐹 “ 𝐵) ↔ ((◡𝐹 “ 𝑥) ∩ (◡𝐹 “ 𝐵)) = (◡𝐹 “ 𝑥))
51	49, 50	sylib 122	. . . . . . . . 9 ⊢ ((((𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 ⊆ 𝐵 ∧ 𝐵 ⊆ 𝑌) ∧ (𝐽 ∈ Top ∧ 𝐹:∪ 𝐽⟶𝐵)) ∧ 𝑥 ∈ 𝐾) → ((◡𝐹 “ 𝑥) ∩ (◡𝐹 “ 𝐵)) = (◡𝐹 “ 𝑥))
52	42, 51	eqtrd 2229	. . . . . . . 8 ⊢ ((((𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 ⊆ 𝐵 ∧ 𝐵 ⊆ 𝑌) ∧ (𝐽 ∈ Top ∧ 𝐹:∪ 𝐽⟶𝐵)) ∧ 𝑥 ∈ 𝐾) → (◡𝐹 “ (𝑥 ∩ 𝐵)) = (◡𝐹 “ 𝑥))
53	52	eleq1d 2265	. . . . . . 7 ⊢ ((((𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 ⊆ 𝐵 ∧ 𝐵 ⊆ 𝑌) ∧ (𝐽 ∈ Top ∧ 𝐹:∪ 𝐽⟶𝐵)) ∧ 𝑥 ∈ 𝐾) → ((◡𝐹 “ (𝑥 ∩ 𝐵)) ∈ 𝐽 ↔ (◡𝐹 “ 𝑥) ∈ 𝐽))
54	53	ralbidva 2493	. . . . . 6 ⊢ (((𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 ⊆ 𝐵 ∧ 𝐵 ⊆ 𝑌) ∧ (𝐽 ∈ Top ∧ 𝐹:∪ 𝐽⟶𝐵)) → (∀𝑥 ∈ 𝐾 (◡𝐹 “ (𝑥 ∩ 𝐵)) ∈ 𝐽 ↔ ∀𝑥 ∈ 𝐾 (◡𝐹 “ 𝑥) ∈ 𝐽))
55		simprr 531	. . . . . . . 8 ⊢ (((𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 ⊆ 𝐵 ∧ 𝐵 ⊆ 𝑌) ∧ (𝐽 ∈ Top ∧ 𝐹:∪ 𝐽⟶𝐵)) → 𝐹:∪ 𝐽⟶𝐵)
56	55, 31	fssd 5423	. . . . . . 7 ⊢ (((𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 ⊆ 𝐵 ∧ 𝐵 ⊆ 𝑌) ∧ (𝐽 ∈ Top ∧ 𝐹:∪ 𝐽⟶𝐵)) → 𝐹:∪ 𝐽⟶𝑌)
57	56	biantrurd 305	. . . . . 6 ⊢ (((𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 ⊆ 𝐵 ∧ 𝐵 ⊆ 𝑌) ∧ (𝐽 ∈ Top ∧ 𝐹:∪ 𝐽⟶𝐵)) → (∀𝑥 ∈ 𝐾 (◡𝐹 “ 𝑥) ∈ 𝐽 ↔ (𝐹:∪ 𝐽⟶𝑌 ∧ ∀𝑥 ∈ 𝐾 (◡𝐹 “ 𝑥) ∈ 𝐽)))
58	38, 54, 57	3bitrrd 215	. . . . 5 ⊢ (((𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 ⊆ 𝐵 ∧ 𝐵 ⊆ 𝑌) ∧ (𝐽 ∈ Top ∧ 𝐹:∪ 𝐽⟶𝐵)) → ((𝐹:∪ 𝐽⟶𝑌 ∧ ∀𝑥 ∈ 𝐾 (◡𝐹 “ 𝑥) ∈ 𝐽) ↔ ∀𝑦 ∈ (𝐾 ↾t 𝐵)(◡𝐹 “ 𝑦) ∈ 𝐽))
59	55	biantrurd 305	. . . . 5 ⊢ (((𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 ⊆ 𝐵 ∧ 𝐵 ⊆ 𝑌) ∧ (𝐽 ∈ Top ∧ 𝐹:∪ 𝐽⟶𝐵)) → (∀𝑦 ∈ (𝐾 ↾t 𝐵)(◡𝐹 “ 𝑦) ∈ 𝐽 ↔ (𝐹:∪ 𝐽⟶𝐵 ∧ ∀𝑦 ∈ (𝐾 ↾t 𝐵)(◡𝐹 “ 𝑦) ∈ 𝐽)))
60	58, 59	bitrd 188	. . . 4 ⊢ (((𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 ⊆ 𝐵 ∧ 𝐵 ⊆ 𝑌) ∧ (𝐽 ∈ Top ∧ 𝐹:∪ 𝐽⟶𝐵)) → ((𝐹:∪ 𝐽⟶𝑌 ∧ ∀𝑥 ∈ 𝐾 (◡𝐹 “ 𝑥) ∈ 𝐽) ↔ (𝐹:∪ 𝐽⟶𝐵 ∧ ∀𝑦 ∈ (𝐾 ↾t 𝐵)(◡𝐹 “ 𝑦) ∈ 𝐽)))
61		simprl 529	. . . . . 6 ⊢ (((𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 ⊆ 𝐵 ∧ 𝐵 ⊆ 𝑌) ∧ (𝐽 ∈ Top ∧ 𝐹:∪ 𝐽⟶𝐵)) → 𝐽 ∈ Top)
62	61, 15	sylib 122	. . . . 5 ⊢ (((𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 ⊆ 𝐵 ∧ 𝐵 ⊆ 𝑌) ∧ (𝐽 ∈ Top ∧ 𝐹:∪ 𝐽⟶𝐵)) → 𝐽 ∈ (TopOn‘∪ 𝐽))
63		iscn 14517	. . . . 5 ⊢ ((𝐽 ∈ (TopOn‘∪ 𝐽) ∧ 𝐾 ∈ (TopOn‘𝑌)) → (𝐹 ∈ (𝐽 Cn 𝐾) ↔ (𝐹:∪ 𝐽⟶𝑌 ∧ ∀𝑥 ∈ 𝐾 (◡𝐹 “ 𝑥) ∈ 𝐽)))
64	62, 28, 63	syl2anc 411	. . . 4 ⊢ (((𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 ⊆ 𝐵 ∧ 𝐵 ⊆ 𝑌) ∧ (𝐽 ∈ Top ∧ 𝐹:∪ 𝐽⟶𝐵)) → (𝐹 ∈ (𝐽 Cn 𝐾) ↔ (𝐹:∪ 𝐽⟶𝑌 ∧ ∀𝑥 ∈ 𝐾 (◡𝐹 “ 𝑥) ∈ 𝐽)))
65	18	adantr 276	. . . . 5 ⊢ (((𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 ⊆ 𝐵 ∧ 𝐵 ⊆ 𝑌) ∧ (𝐽 ∈ Top ∧ 𝐹:∪ 𝐽⟶𝐵)) → (𝐾 ↾t 𝐵) ∈ (TopOn‘𝐵))
66		iscn 14517	. . . . 5 ⊢ ((𝐽 ∈ (TopOn‘∪ 𝐽) ∧ (𝐾 ↾t 𝐵) ∈ (TopOn‘𝐵)) → (𝐹 ∈ (𝐽 Cn (𝐾 ↾t 𝐵)) ↔ (𝐹:∪ 𝐽⟶𝐵 ∧ ∀𝑦 ∈ (𝐾 ↾t 𝐵)(◡𝐹 “ 𝑦) ∈ 𝐽)))
67	62, 65, 66	syl2anc 411	. . . 4 ⊢ (((𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 ⊆ 𝐵 ∧ 𝐵 ⊆ 𝑌) ∧ (𝐽 ∈ Top ∧ 𝐹:∪ 𝐽⟶𝐵)) → (𝐹 ∈ (𝐽 Cn (𝐾 ↾t 𝐵)) ↔ (𝐹:∪ 𝐽⟶𝐵 ∧ ∀𝑦 ∈ (𝐾 ↾t 𝐵)(◡𝐹 “ 𝑦) ∈ 𝐽)))
68	60, 64, 67	3bitr4d 220	. . 3 ⊢ (((𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 ⊆ 𝐵 ∧ 𝐵 ⊆ 𝑌) ∧ (𝐽 ∈ Top ∧ 𝐹:∪ 𝐽⟶𝐵)) → (𝐹 ∈ (𝐽 Cn 𝐾) ↔ 𝐹 ∈ (𝐽 Cn (𝐾 ↾t 𝐵))))
69	68	ex 115	. 2 ⊢ ((𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 ⊆ 𝐵 ∧ 𝐵 ⊆ 𝑌) → ((𝐽 ∈ Top ∧ 𝐹:∪ 𝐽⟶𝐵) → (𝐹 ∈ (𝐽 Cn 𝐾) ↔ 𝐹 ∈ (𝐽 Cn (𝐾 ↾t 𝐵)))))
70	12, 24, 69	pm5.21ndd 706	1 ⊢ ((𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 ⊆ 𝐵 ∧ 𝐵 ⊆ 𝑌) → (𝐹 ∈ (𝐽 Cn 𝐾) ↔ 𝐹 ∈ (𝐽 Cn (𝐾 ↾t 𝐵))))

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   ∧ w3a 980   = wceq 1364   ∈ wcel 2167  ∀wral 2475  ∃wrex 2476  Vcvv 2763   ∩ cin 3156   ⊆ wss 3157  ∪ cuni 3840  ^◡ccnv 4663  dom cdm 4664  ran crn 4665   “ cima 4667  Fun wfun 5253   Fn wfn 5254  ⟶wf 5255  ‘cfv 5259  (class class class)co 5925   ↾_t crest 12941  Topctop 14317  TopOnctopon 14330   Cn ccn 14505

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 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-coll 4149  ax-sep 4152  ax-pow 4208  ax-pr 4243  ax-un 4469  ax-setind 4574

This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ne 2368  df-ral 2480  df-rex 2481  df-reu 2482  df-rab 2484  df-v 2765  df-sbc 2990  df-csb 3085  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-pw 3608  df-sn 3629  df-pr 3630  df-op 3632  df-uni 3841  df-iun 3919  df-br 4035  df-opab 4096  df-mpt 4097  df-id 4329  df-xp 4670  df-rel 4671  df-cnv 4672  df-co 4673  df-dm 4674  df-rn 4675  df-res 4676  df-ima 4677  df-iota 5220  df-fun 5261  df-fn 5262  df-f 5263  df-f1 5264  df-fo 5265  df-f1o 5266  df-fv 5267  df-ov 5928  df-oprab 5929  df-mpo 5930  df-1st 6207  df-2nd 6208  df-map 6718  df-rest 12943  df-topgen 12962  df-top 14318  df-topon 14331  df-bases 14363  df-cn 14508

This theorem is referenced by:  cnrest2r  14557  hmeores  14635