Theorem restcls 23129

Description: A closure in a subspace topology. (Contributed by Jeff Hankins, 22-Jan-2010.) (Revised by Mario Carneiro, 15-Dec-2013.)

Hypotheses

Ref	Expression
restcls.1	⊢ 𝑋 = ∪ 𝐽
restcls.2	⊢ 𝐾 = (𝐽 ↾t 𝑌)

Assertion

Ref	Expression
restcls	⊢ ((𝐽 ∈ Top ∧ 𝑌 ⊆ 𝑋 ∧ 𝑆 ⊆ 𝑌) → ((cls‘𝐾)‘𝑆) = (((cls‘𝐽)‘𝑆) ∩ 𝑌))

Proof of Theorem restcls

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		simp1 1137	. . . . . 6 ⊢ ((𝐽 ∈ Top ∧ 𝑌 ⊆ 𝑋 ∧ 𝑆 ⊆ 𝑌) → 𝐽 ∈ Top)
2		sstr 3943	. . . . . . . 8 ⊢ ((𝑆 ⊆ 𝑌 ∧ 𝑌 ⊆ 𝑋) → 𝑆 ⊆ 𝑋)
3	2	ancoms 458	. . . . . . 7 ⊢ ((𝑌 ⊆ 𝑋 ∧ 𝑆 ⊆ 𝑌) → 𝑆 ⊆ 𝑋)
4	3	3adant1 1131	. . . . . 6 ⊢ ((𝐽 ∈ Top ∧ 𝑌 ⊆ 𝑋 ∧ 𝑆 ⊆ 𝑌) → 𝑆 ⊆ 𝑋)
5		restcls.1	. . . . . . 7 ⊢ 𝑋 = ∪ 𝐽
6	5	clscld 22995	. . . . . 6 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → ((cls‘𝐽)‘𝑆) ∈ (Clsd‘𝐽))
7	1, 4, 6	syl2anc 585	. . . . 5 ⊢ ((𝐽 ∈ Top ∧ 𝑌 ⊆ 𝑋 ∧ 𝑆 ⊆ 𝑌) → ((cls‘𝐽)‘𝑆) ∈ (Clsd‘𝐽))
8		eqid 2737	. . . . 5 ⊢ (((cls‘𝐽)‘𝑆) ∩ 𝑌) = (((cls‘𝐽)‘𝑆) ∩ 𝑌)
9		ineq1 4166	. . . . . 6 ⊢ (𝑥 = ((cls‘𝐽)‘𝑆) → (𝑥 ∩ 𝑌) = (((cls‘𝐽)‘𝑆) ∩ 𝑌))
10	9	rspceeqv 3600	. . . . 5 ⊢ ((((cls‘𝐽)‘𝑆) ∈ (Clsd‘𝐽) ∧ (((cls‘𝐽)‘𝑆) ∩ 𝑌) = (((cls‘𝐽)‘𝑆) ∩ 𝑌)) → ∃𝑥 ∈ (Clsd‘𝐽)(((cls‘𝐽)‘𝑆) ∩ 𝑌) = (𝑥 ∩ 𝑌))
11	7, 8, 10	sylancl 587	. . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝑌 ⊆ 𝑋 ∧ 𝑆 ⊆ 𝑌) → ∃𝑥 ∈ (Clsd‘𝐽)(((cls‘𝐽)‘𝑆) ∩ 𝑌) = (𝑥 ∩ 𝑌))
12		restcls.2	. . . . . . 7 ⊢ 𝐾 = (𝐽 ↾t 𝑌)
13	12	fveq2i 6838	. . . . . 6 ⊢ (Clsd‘𝐾) = (Clsd‘(𝐽 ↾t 𝑌))
14	13	eleq2i 2829	. . . . 5 ⊢ ((((cls‘𝐽)‘𝑆) ∩ 𝑌) ∈ (Clsd‘𝐾) ↔ (((cls‘𝐽)‘𝑆) ∩ 𝑌) ∈ (Clsd‘(𝐽 ↾t 𝑌)))
15	5	restcld 23120	. . . . . 6 ⊢ ((𝐽 ∈ Top ∧ 𝑌 ⊆ 𝑋) → ((((cls‘𝐽)‘𝑆) ∩ 𝑌) ∈ (Clsd‘(𝐽 ↾t 𝑌)) ↔ ∃𝑥 ∈ (Clsd‘𝐽)(((cls‘𝐽)‘𝑆) ∩ 𝑌) = (𝑥 ∩ 𝑌)))
16	15	3adant3 1133	. . . . 5 ⊢ ((𝐽 ∈ Top ∧ 𝑌 ⊆ 𝑋 ∧ 𝑆 ⊆ 𝑌) → ((((cls‘𝐽)‘𝑆) ∩ 𝑌) ∈ (Clsd‘(𝐽 ↾t 𝑌)) ↔ ∃𝑥 ∈ (Clsd‘𝐽)(((cls‘𝐽)‘𝑆) ∩ 𝑌) = (𝑥 ∩ 𝑌)))
17	14, 16	bitrid 283	. . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝑌 ⊆ 𝑋 ∧ 𝑆 ⊆ 𝑌) → ((((cls‘𝐽)‘𝑆) ∩ 𝑌) ∈ (Clsd‘𝐾) ↔ ∃𝑥 ∈ (Clsd‘𝐽)(((cls‘𝐽)‘𝑆) ∩ 𝑌) = (𝑥 ∩ 𝑌)))
18	11, 17	mpbird 257	. . 3 ⊢ ((𝐽 ∈ Top ∧ 𝑌 ⊆ 𝑋 ∧ 𝑆 ⊆ 𝑌) → (((cls‘𝐽)‘𝑆) ∩ 𝑌) ∈ (Clsd‘𝐾))
19	5	sscls 23004	. . . . 5 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → 𝑆 ⊆ ((cls‘𝐽)‘𝑆))
20	1, 4, 19	syl2anc 585	. . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝑌 ⊆ 𝑋 ∧ 𝑆 ⊆ 𝑌) → 𝑆 ⊆ ((cls‘𝐽)‘𝑆))
21		simp3 1139	. . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝑌 ⊆ 𝑋 ∧ 𝑆 ⊆ 𝑌) → 𝑆 ⊆ 𝑌)
22	20, 21	ssind 4194	. . 3 ⊢ ((𝐽 ∈ Top ∧ 𝑌 ⊆ 𝑋 ∧ 𝑆 ⊆ 𝑌) → 𝑆 ⊆ (((cls‘𝐽)‘𝑆) ∩ 𝑌))
23		eqid 2737	. . . 4 ⊢ ∪ 𝐾 = ∪ 𝐾
24	23	clsss2 23020	. . 3 ⊢ (((((cls‘𝐽)‘𝑆) ∩ 𝑌) ∈ (Clsd‘𝐾) ∧ 𝑆 ⊆ (((cls‘𝐽)‘𝑆) ∩ 𝑌)) → ((cls‘𝐾)‘𝑆) ⊆ (((cls‘𝐽)‘𝑆) ∩ 𝑌))
25	18, 22, 24	syl2anc 585	. 2 ⊢ ((𝐽 ∈ Top ∧ 𝑌 ⊆ 𝑋 ∧ 𝑆 ⊆ 𝑌) → ((cls‘𝐾)‘𝑆) ⊆ (((cls‘𝐽)‘𝑆) ∩ 𝑌))
26	12	fveq2i 6838	. . . . . 6 ⊢ (cls‘𝐾) = (cls‘(𝐽 ↾t 𝑌))
27	26	fveq1i 6836	. . . . 5 ⊢ ((cls‘𝐾)‘𝑆) = ((cls‘(𝐽 ↾t 𝑌))‘𝑆)
28		id 22	. . . . . . . . 9 ⊢ (𝑌 ⊆ 𝑋 → 𝑌 ⊆ 𝑋)
29	5	topopn 22854	. . . . . . . . 9 ⊢ (𝐽 ∈ Top → 𝑋 ∈ 𝐽)
30		ssexg 5269	. . . . . . . . 9 ⊢ ((𝑌 ⊆ 𝑋 ∧ 𝑋 ∈ 𝐽) → 𝑌 ∈ V)
31	28, 29, 30	syl2anr 598	. . . . . . . 8 ⊢ ((𝐽 ∈ Top ∧ 𝑌 ⊆ 𝑋) → 𝑌 ∈ V)
32		resttop 23108	. . . . . . . 8 ⊢ ((𝐽 ∈ Top ∧ 𝑌 ∈ V) → (𝐽 ↾t 𝑌) ∈ Top)
33	31, 32	syldan 592	. . . . . . 7 ⊢ ((𝐽 ∈ Top ∧ 𝑌 ⊆ 𝑋) → (𝐽 ↾t 𝑌) ∈ Top)
34	33	3adant3 1133	. . . . . 6 ⊢ ((𝐽 ∈ Top ∧ 𝑌 ⊆ 𝑋 ∧ 𝑆 ⊆ 𝑌) → (𝐽 ↾t 𝑌) ∈ Top)
35	5	restuni 23110	. . . . . . . 8 ⊢ ((𝐽 ∈ Top ∧ 𝑌 ⊆ 𝑋) → 𝑌 = ∪ (𝐽 ↾t 𝑌))
36	35	3adant3 1133	. . . . . . 7 ⊢ ((𝐽 ∈ Top ∧ 𝑌 ⊆ 𝑋 ∧ 𝑆 ⊆ 𝑌) → 𝑌 = ∪ (𝐽 ↾t 𝑌))
37	21, 36	sseqtrd 3971	. . . . . 6 ⊢ ((𝐽 ∈ Top ∧ 𝑌 ⊆ 𝑋 ∧ 𝑆 ⊆ 𝑌) → 𝑆 ⊆ ∪ (𝐽 ↾t 𝑌))
38		eqid 2737	. . . . . . 7 ⊢ ∪ (𝐽 ↾t 𝑌) = ∪ (𝐽 ↾t 𝑌)
39	38	clscld 22995	. . . . . 6 ⊢ (((𝐽 ↾t 𝑌) ∈ Top ∧ 𝑆 ⊆ ∪ (𝐽 ↾t 𝑌)) → ((cls‘(𝐽 ↾t 𝑌))‘𝑆) ∈ (Clsd‘(𝐽 ↾t 𝑌)))
40	34, 37, 39	syl2anc 585	. . . . 5 ⊢ ((𝐽 ∈ Top ∧ 𝑌 ⊆ 𝑋 ∧ 𝑆 ⊆ 𝑌) → ((cls‘(𝐽 ↾t 𝑌))‘𝑆) ∈ (Clsd‘(𝐽 ↾t 𝑌)))
41	27, 40	eqeltrid 2841	. . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝑌 ⊆ 𝑋 ∧ 𝑆 ⊆ 𝑌) → ((cls‘𝐾)‘𝑆) ∈ (Clsd‘(𝐽 ↾t 𝑌)))
42	5	restcld 23120	. . . . 5 ⊢ ((𝐽 ∈ Top ∧ 𝑌 ⊆ 𝑋) → (((cls‘𝐾)‘𝑆) ∈ (Clsd‘(𝐽 ↾t 𝑌)) ↔ ∃𝑥 ∈ (Clsd‘𝐽)((cls‘𝐾)‘𝑆) = (𝑥 ∩ 𝑌)))
43	42	3adant3 1133	. . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝑌 ⊆ 𝑋 ∧ 𝑆 ⊆ 𝑌) → (((cls‘𝐾)‘𝑆) ∈ (Clsd‘(𝐽 ↾t 𝑌)) ↔ ∃𝑥 ∈ (Clsd‘𝐽)((cls‘𝐾)‘𝑆) = (𝑥 ∩ 𝑌)))
44	41, 43	mpbid 232	. . 3 ⊢ ((𝐽 ∈ Top ∧ 𝑌 ⊆ 𝑋 ∧ 𝑆 ⊆ 𝑌) → ∃𝑥 ∈ (Clsd‘𝐽)((cls‘𝐾)‘𝑆) = (𝑥 ∩ 𝑌))
45	12, 33	eqeltrid 2841	. . . . . . . 8 ⊢ ((𝐽 ∈ Top ∧ 𝑌 ⊆ 𝑋) → 𝐾 ∈ Top)
46	45	3adant3 1133	. . . . . . 7 ⊢ ((𝐽 ∈ Top ∧ 𝑌 ⊆ 𝑋 ∧ 𝑆 ⊆ 𝑌) → 𝐾 ∈ Top)
47	12	unieqi 4876	. . . . . . . . 9 ⊢ ∪ 𝐾 = ∪ (𝐽 ↾t 𝑌)
48	47	eqcomi 2746	. . . . . . . 8 ⊢ ∪ (𝐽 ↾t 𝑌) = ∪ 𝐾
49	48	sscls 23004	. . . . . . 7 ⊢ ((𝐾 ∈ Top ∧ 𝑆 ⊆ ∪ (𝐽 ↾t 𝑌)) → 𝑆 ⊆ ((cls‘𝐾)‘𝑆))
50	46, 37, 49	syl2anc 585	. . . . . 6 ⊢ ((𝐽 ∈ Top ∧ 𝑌 ⊆ 𝑋 ∧ 𝑆 ⊆ 𝑌) → 𝑆 ⊆ ((cls‘𝐾)‘𝑆))
51	50	adantr 480	. . . . 5 ⊢ (((𝐽 ∈ Top ∧ 𝑌 ⊆ 𝑋 ∧ 𝑆 ⊆ 𝑌) ∧ (𝑥 ∈ (Clsd‘𝐽) ∧ ((cls‘𝐾)‘𝑆) = (𝑥 ∩ 𝑌))) → 𝑆 ⊆ ((cls‘𝐾)‘𝑆))
52		inss1 4190	. . . . . . 7 ⊢ (𝑥 ∩ 𝑌) ⊆ 𝑥
53		sseq1 3960	. . . . . . 7 ⊢ (((cls‘𝐾)‘𝑆) = (𝑥 ∩ 𝑌) → (((cls‘𝐾)‘𝑆) ⊆ 𝑥 ↔ (𝑥 ∩ 𝑌) ⊆ 𝑥))
54	52, 53	mpbiri 258	. . . . . 6 ⊢ (((cls‘𝐾)‘𝑆) = (𝑥 ∩ 𝑌) → ((cls‘𝐾)‘𝑆) ⊆ 𝑥)
55	54	ad2antll 730	. . . . 5 ⊢ (((𝐽 ∈ Top ∧ 𝑌 ⊆ 𝑋 ∧ 𝑆 ⊆ 𝑌) ∧ (𝑥 ∈ (Clsd‘𝐽) ∧ ((cls‘𝐾)‘𝑆) = (𝑥 ∩ 𝑌))) → ((cls‘𝐾)‘𝑆) ⊆ 𝑥)
56	51, 55	sstrd 3945	. . . 4 ⊢ (((𝐽 ∈ Top ∧ 𝑌 ⊆ 𝑋 ∧ 𝑆 ⊆ 𝑌) ∧ (𝑥 ∈ (Clsd‘𝐽) ∧ ((cls‘𝐾)‘𝑆) = (𝑥 ∩ 𝑌))) → 𝑆 ⊆ 𝑥)
57	5	clsss2 23020	. . . . . . . . . 10 ⊢ ((𝑥 ∈ (Clsd‘𝐽) ∧ 𝑆 ⊆ 𝑥) → ((cls‘𝐽)‘𝑆) ⊆ 𝑥)
58	57	adantl 481	. . . . . . . . 9 ⊢ (((𝐽 ∈ Top ∧ 𝑌 ⊆ 𝑋 ∧ 𝑆 ⊆ 𝑌) ∧ (𝑥 ∈ (Clsd‘𝐽) ∧ 𝑆 ⊆ 𝑥)) → ((cls‘𝐽)‘𝑆) ⊆ 𝑥)
59	58	ssrind 4197	. . . . . . . 8 ⊢ (((𝐽 ∈ Top ∧ 𝑌 ⊆ 𝑋 ∧ 𝑆 ⊆ 𝑌) ∧ (𝑥 ∈ (Clsd‘𝐽) ∧ 𝑆 ⊆ 𝑥)) → (((cls‘𝐽)‘𝑆) ∩ 𝑌) ⊆ (𝑥 ∩ 𝑌))
60		sseq2 3961	. . . . . . . 8 ⊢ (((cls‘𝐾)‘𝑆) = (𝑥 ∩ 𝑌) → ((((cls‘𝐽)‘𝑆) ∩ 𝑌) ⊆ ((cls‘𝐾)‘𝑆) ↔ (((cls‘𝐽)‘𝑆) ∩ 𝑌) ⊆ (𝑥 ∩ 𝑌)))
61	59, 60	syl5ibrcom 247	. . . . . . 7 ⊢ (((𝐽 ∈ Top ∧ 𝑌 ⊆ 𝑋 ∧ 𝑆 ⊆ 𝑌) ∧ (𝑥 ∈ (Clsd‘𝐽) ∧ 𝑆 ⊆ 𝑥)) → (((cls‘𝐾)‘𝑆) = (𝑥 ∩ 𝑌) → (((cls‘𝐽)‘𝑆) ∩ 𝑌) ⊆ ((cls‘𝐾)‘𝑆)))
62	61	expr 456	. . . . . 6 ⊢ (((𝐽 ∈ Top ∧ 𝑌 ⊆ 𝑋 ∧ 𝑆 ⊆ 𝑌) ∧ 𝑥 ∈ (Clsd‘𝐽)) → (𝑆 ⊆ 𝑥 → (((cls‘𝐾)‘𝑆) = (𝑥 ∩ 𝑌) → (((cls‘𝐽)‘𝑆) ∩ 𝑌) ⊆ ((cls‘𝐾)‘𝑆))))
63	62	com23 86	. . . . 5 ⊢ (((𝐽 ∈ Top ∧ 𝑌 ⊆ 𝑋 ∧ 𝑆 ⊆ 𝑌) ∧ 𝑥 ∈ (Clsd‘𝐽)) → (((cls‘𝐾)‘𝑆) = (𝑥 ∩ 𝑌) → (𝑆 ⊆ 𝑥 → (((cls‘𝐽)‘𝑆) ∩ 𝑌) ⊆ ((cls‘𝐾)‘𝑆))))
64	63	impr 454	. . . 4 ⊢ (((𝐽 ∈ Top ∧ 𝑌 ⊆ 𝑋 ∧ 𝑆 ⊆ 𝑌) ∧ (𝑥 ∈ (Clsd‘𝐽) ∧ ((cls‘𝐾)‘𝑆) = (𝑥 ∩ 𝑌))) → (𝑆 ⊆ 𝑥 → (((cls‘𝐽)‘𝑆) ∩ 𝑌) ⊆ ((cls‘𝐾)‘𝑆)))
65	56, 64	mpd 15	. . 3 ⊢ (((𝐽 ∈ Top ∧ 𝑌 ⊆ 𝑋 ∧ 𝑆 ⊆ 𝑌) ∧ (𝑥 ∈ (Clsd‘𝐽) ∧ ((cls‘𝐾)‘𝑆) = (𝑥 ∩ 𝑌))) → (((cls‘𝐽)‘𝑆) ∩ 𝑌) ⊆ ((cls‘𝐾)‘𝑆))
66	44, 65	rexlimddv 3144	. 2 ⊢ ((𝐽 ∈ Top ∧ 𝑌 ⊆ 𝑋 ∧ 𝑆 ⊆ 𝑌) → (((cls‘𝐽)‘𝑆) ∩ 𝑌) ⊆ ((cls‘𝐾)‘𝑆))
67	25, 66	eqssd 3952	1 ⊢ ((𝐽 ∈ Top ∧ 𝑌 ⊆ 𝑋 ∧ 𝑆 ⊆ 𝑌) → ((cls‘𝐾)‘𝑆) = (((cls‘𝐽)‘𝑆) ∩ 𝑌))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1087   = wceq 1542   ∈ wcel 2114  ∃wrex 3061  Vcvv 3441   ∩ cin 3901   ⊆ wss 3902  ∪ cuni 4864  ‘cfv 6493  (class class class)co 7360   ↾_t crest 17344  Topctop 22841  Clsdccld 22964  clsccl 22966

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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5225  ax-sep 5242  ax-nul 5252  ax-pow 5311  ax-pr 5378  ax-un 7682

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3062  df-reu 3352  df-rab 3401  df-v 3443  df-sbc 3742  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4287  df-if 4481  df-pw 4557  df-sn 4582  df-pr 4584  df-op 4588  df-uni 4865  df-int 4904  df-iun 4949  df-iin 4950  df-br 5100  df-opab 5162  df-mpt 5181  df-tr 5207  df-id 5520  df-eprel 5525  df-po 5533  df-so 5534  df-fr 5578  df-we 5580  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637  df-ima 5638  df-ord 6321  df-on 6322  df-lim 6323  df-suc 6324  df-iota 6449  df-fun 6495  df-fn 6496  df-f 6497  df-f1 6498  df-fo 6499  df-f1o 6500  df-fv 6501  df-ov 7363  df-oprab 7364  df-mpo 7365  df-om 7811  df-1st 7935  df-2nd 7936  df-en 8888  df-fin 8891  df-fi 9318  df-rest 17346  df-topgen 17367  df-top 22842  df-topon 22859  df-bases 22894  df-cld 22967  df-cls 22969

This theorem is referenced by:  restlp  23131  resscdrg  25318  restcls2  49195