Theorem elcls 23267

Description: Membership in a closure. Theorem 6.5(a) of [Munkres] p. 95. (Contributed by NM, 22-Feb-2007.)

Hypothesis

Ref	Expression
clscld.1	⊢ 𝑋 = ∪ 𝐽

Assertion

Ref	Expression
elcls	⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋 ∧ 𝑃 ∈ 𝑋) → (𝑃 ∈ ((cls‘𝐽)‘𝑆) ↔ ∀𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 → (𝑥 ∩ 𝑆) ≠ ∅)))

Distinct variable groups:   𝑥,𝐽   𝑥,𝑃   𝑥,𝑆   𝑥,𝑋

Proof of Theorem elcls

Step	Hyp	Ref	Expression
1		clscld.1	. . . . . . . 8 ⊢ 𝑋 = ∪ 𝐽
2	1	cmclsopn 23256	. . . . . . 7 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → (𝑋 ∖ ((cls‘𝐽)‘𝑆)) ∈ 𝐽)
3	2	3adant3 1150	. . . . . 6 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋 ∧ 𝑃 ∈ 𝑋) → (𝑋 ∖ ((cls‘𝐽)‘𝑆)) ∈ 𝐽)
4	3	adantr 486	. . . . 5 ⊢ (((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋 ∧ 𝑃 ∈ 𝑋) ∧ ¬ 𝑃 ∈ ((cls‘𝐽)‘𝑆)) → (𝑋 ∖ ((cls‘𝐽)‘𝑆)) ∈ 𝐽)
5		eldif 3918	. . . . . . 7 ⊢ (𝑃 ∈ (𝑋 ∖ ((cls‘𝐽)‘𝑆)) ↔ (𝑃 ∈ 𝑋 ∧ ¬ 𝑃 ∈ ((cls‘𝐽)‘𝑆)))
6	5	biimpri 231	. . . . . 6 ⊢ ((𝑃 ∈ 𝑋 ∧ ¬ 𝑃 ∈ ((cls‘𝐽)‘𝑆)) → 𝑃 ∈ (𝑋 ∖ ((cls‘𝐽)‘𝑆)))
7	6	3ad2antl3 1206	. . . . 5 ⊢ (((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋 ∧ 𝑃 ∈ 𝑋) ∧ ¬ 𝑃 ∈ ((cls‘𝐽)‘𝑆)) → 𝑃 ∈ (𝑋 ∖ ((cls‘𝐽)‘𝑆)))
8		simpr 490	. . . . . . . . . . 11 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → 𝑆 ⊆ 𝑋)
9	1	sscls 23250	. . . . . . . . . . 11 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → 𝑆 ⊆ ((cls‘𝐽)‘𝑆))
10	8, 9	ssind 4196	. . . . . . . . . 10 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → 𝑆 ⊆ (𝑋 ∩ ((cls‘𝐽)‘𝑆)))
11		dfin4 4234	. . . . . . . . . 10 ⊢ (𝑋 ∩ ((cls‘𝐽)‘𝑆)) = (𝑋 ∖ (𝑋 ∖ ((cls‘𝐽)‘𝑆)))
12	10, 11	sseqtrdi 3980	. . . . . . . . 9 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → 𝑆 ⊆ (𝑋 ∖ (𝑋 ∖ ((cls‘𝐽)‘𝑆))))
13		reldisj 4416	. . . . . . . . . 10 ⊢ (𝑆 ⊆ 𝑋 → ((𝑆 ∩ (𝑋 ∖ ((cls‘𝐽)‘𝑆))) = ∅ ↔ 𝑆 ⊆ (𝑋 ∖ (𝑋 ∖ ((cls‘𝐽)‘𝑆)))))
14	13	adantl 487	. . . . . . . . 9 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → ((𝑆 ∩ (𝑋 ∖ ((cls‘𝐽)‘𝑆))) = ∅ ↔ 𝑆 ⊆ (𝑋 ∖ (𝑋 ∖ ((cls‘𝐽)‘𝑆)))))
15	12, 14	mpbird 260	. . . . . . . 8 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → (𝑆 ∩ (𝑋 ∖ ((cls‘𝐽)‘𝑆))) = ∅)
16		nne 2965	. . . . . . . . 9 ⊢ (¬ ((𝑋 ∖ ((cls‘𝐽)‘𝑆)) ∩ 𝑆) ≠ ∅ ↔ ((𝑋 ∖ ((cls‘𝐽)‘𝑆)) ∩ 𝑆) = ∅)
17		incom 4165	. . . . . . . . . 10 ⊢ ((𝑋 ∖ ((cls‘𝐽)‘𝑆)) ∩ 𝑆) = (𝑆 ∩ (𝑋 ∖ ((cls‘𝐽)‘𝑆)))
18	17	eqeq1i 2771	. . . . . . . . 9 ⊢ (((𝑋 ∖ ((cls‘𝐽)‘𝑆)) ∩ 𝑆) = ∅ ↔ (𝑆 ∩ (𝑋 ∖ ((cls‘𝐽)‘𝑆))) = ∅)
19	16, 18	bitri 278	. . . . . . . 8 ⊢ (¬ ((𝑋 ∖ ((cls‘𝐽)‘𝑆)) ∩ 𝑆) ≠ ∅ ↔ (𝑆 ∩ (𝑋 ∖ ((cls‘𝐽)‘𝑆))) = ∅)
20	15, 19	sylibr 237	. . . . . . 7 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → ¬ ((𝑋 ∖ ((cls‘𝐽)‘𝑆)) ∩ 𝑆) ≠ ∅)
21	20	3adant3 1150	. . . . . 6 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋 ∧ 𝑃 ∈ 𝑋) → ¬ ((𝑋 ∖ ((cls‘𝐽)‘𝑆)) ∩ 𝑆) ≠ ∅)
22	21	adantr 486	. . . . 5 ⊢ (((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋 ∧ 𝑃 ∈ 𝑋) ∧ ¬ 𝑃 ∈ ((cls‘𝐽)‘𝑆)) → ¬ ((𝑋 ∖ ((cls‘𝐽)‘𝑆)) ∩ 𝑆) ≠ ∅)
23		eleq2 2855	. . . . . . 7 ⊢ (𝑥 = (𝑋 ∖ ((cls‘𝐽)‘𝑆)) → (𝑃 ∈ 𝑥 ↔ 𝑃 ∈ (𝑋 ∖ ((cls‘𝐽)‘𝑆))))
24		ineq1 4169	. . . . . . . . 9 ⊢ (𝑥 = (𝑋 ∖ ((cls‘𝐽)‘𝑆)) → (𝑥 ∩ 𝑆) = ((𝑋 ∖ ((cls‘𝐽)‘𝑆)) ∩ 𝑆))
25	24	neeq1d 3020	. . . . . . . 8 ⊢ (𝑥 = (𝑋 ∖ ((cls‘𝐽)‘𝑆)) → ((𝑥 ∩ 𝑆) ≠ ∅ ↔ ((𝑋 ∖ ((cls‘𝐽)‘𝑆)) ∩ 𝑆) ≠ ∅))
26	25	notbid 321	. . . . . . 7 ⊢ (𝑥 = (𝑋 ∖ ((cls‘𝐽)‘𝑆)) → (¬ (𝑥 ∩ 𝑆) ≠ ∅ ↔ ¬ ((𝑋 ∖ ((cls‘𝐽)‘𝑆)) ∩ 𝑆) ≠ ∅))
27	23, 26	anbi12d 644	. . . . . 6 ⊢ (𝑥 = (𝑋 ∖ ((cls‘𝐽)‘𝑆)) → ((𝑃 ∈ 𝑥 ∧ ¬ (𝑥 ∩ 𝑆) ≠ ∅) ↔ (𝑃 ∈ (𝑋 ∖ ((cls‘𝐽)‘𝑆)) ∧ ¬ ((𝑋 ∖ ((cls‘𝐽)‘𝑆)) ∩ 𝑆) ≠ ∅)))
28	27	rspcev 3584	. . . . 5 ⊢ (((𝑋 ∖ ((cls‘𝐽)‘𝑆)) ∈ 𝐽 ∧ (𝑃 ∈ (𝑋 ∖ ((cls‘𝐽)‘𝑆)) ∧ ¬ ((𝑋 ∖ ((cls‘𝐽)‘𝑆)) ∩ 𝑆) ≠ ∅)) → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ ¬ (𝑥 ∩ 𝑆) ≠ ∅))
29	4, 7, 22, 28	syl12anc 850	. . . 4 ⊢ (((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋 ∧ 𝑃 ∈ 𝑋) ∧ ¬ 𝑃 ∈ ((cls‘𝐽)‘𝑆)) → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ ¬ (𝑥 ∩ 𝑆) ≠ ∅))
30		incom 4165	. . . . . . . . . . . . 13 ⊢ (𝑆 ∩ 𝑥) = (𝑥 ∩ 𝑆)
31	30	eqeq1i 2771	. . . . . . . . . . . 12 ⊢ ((𝑆 ∩ 𝑥) = ∅ ↔ (𝑥 ∩ 𝑆) = ∅)
32		df-ne 2962	. . . . . . . . . . . . 13 ⊢ ((𝑥 ∩ 𝑆) ≠ ∅ ↔ ¬ (𝑥 ∩ 𝑆) = ∅)
33	32	con2bii 360	. . . . . . . . . . . 12 ⊢ ((𝑥 ∩ 𝑆) = ∅ ↔ ¬ (𝑥 ∩ 𝑆) ≠ ∅)
34	31, 33	bitri 278	. . . . . . . . . . 11 ⊢ ((𝑆 ∩ 𝑥) = ∅ ↔ ¬ (𝑥 ∩ 𝑆) ≠ ∅)
35	1	opncld 23227	. . . . . . . . . . . . . . . 16 ⊢ ((𝐽 ∈ Top ∧ 𝑥 ∈ 𝐽) → (𝑋 ∖ 𝑥) ∈ (Clsd‘𝐽))
36	35	adantlr 728	. . . . . . . . . . . . . . 15 ⊢ (((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) ∧ 𝑥 ∈ 𝐽) → (𝑋 ∖ 𝑥) ∈ (Clsd‘𝐽))
37		reldisj 4416	. . . . . . . . . . . . . . . . 17 ⊢ (𝑆 ⊆ 𝑋 → ((𝑆 ∩ 𝑥) = ∅ ↔ 𝑆 ⊆ (𝑋 ∖ 𝑥)))
38	37	biimpa 482	. . . . . . . . . . . . . . . 16 ⊢ ((𝑆 ⊆ 𝑋 ∧ (𝑆 ∩ 𝑥) = ∅) → 𝑆 ⊆ (𝑋 ∖ 𝑥))
39	38	ad4ant24 767	. . . . . . . . . . . . . . 15 ⊢ ((((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) ∧ 𝑥 ∈ 𝐽) ∧ (𝑆 ∩ 𝑥) = ∅) → 𝑆 ⊆ (𝑋 ∖ 𝑥))
40	1	clsss2 23266	. . . . . . . . . . . . . . 15 ⊢ (((𝑋 ∖ 𝑥) ∈ (Clsd‘𝐽) ∧ 𝑆 ⊆ (𝑋 ∖ 𝑥)) → ((cls‘𝐽)‘𝑆) ⊆ (𝑋 ∖ 𝑥))
41	36, 39, 40	syl2an2r 698	. . . . . . . . . . . . . 14 ⊢ ((((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) ∧ 𝑥 ∈ 𝐽) ∧ (𝑆 ∩ 𝑥) = ∅) → ((cls‘𝐽)‘𝑆) ⊆ (𝑋 ∖ 𝑥))
42	41	sseld 3939	. . . . . . . . . . . . 13 ⊢ ((((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) ∧ 𝑥 ∈ 𝐽) ∧ (𝑆 ∩ 𝑥) = ∅) → (𝑃 ∈ ((cls‘𝐽)‘𝑆) → 𝑃 ∈ (𝑋 ∖ 𝑥)))
43		eldifn 4089	. . . . . . . . . . . . 13 ⊢ (𝑃 ∈ (𝑋 ∖ 𝑥) → ¬ 𝑃 ∈ 𝑥)
44	42, 43	syl6 36	. . . . . . . . . . . 12 ⊢ ((((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) ∧ 𝑥 ∈ 𝐽) ∧ (𝑆 ∩ 𝑥) = ∅) → (𝑃 ∈ ((cls‘𝐽)‘𝑆) → ¬ 𝑃 ∈ 𝑥))
45	44	con2d 135	. . . . . . . . . . 11 ⊢ ((((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) ∧ 𝑥 ∈ 𝐽) ∧ (𝑆 ∩ 𝑥) = ∅) → (𝑃 ∈ 𝑥 → ¬ 𝑃 ∈ ((cls‘𝐽)‘𝑆)))
46	34, 45	sylan2br 607	. . . . . . . . . 10 ⊢ ((((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) ∧ 𝑥 ∈ 𝐽) ∧ ¬ (𝑥 ∩ 𝑆) ≠ ∅) → (𝑃 ∈ 𝑥 → ¬ 𝑃 ∈ ((cls‘𝐽)‘𝑆)))
47	46	exp31 425	. . . . . . . . 9 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → (𝑥 ∈ 𝐽 → (¬ (𝑥 ∩ 𝑆) ≠ ∅ → (𝑃 ∈ 𝑥 → ¬ 𝑃 ∈ ((cls‘𝐽)‘𝑆)))))
48	47	com34 92	. . . . . . . 8 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → (𝑥 ∈ 𝐽 → (𝑃 ∈ 𝑥 → (¬ (𝑥 ∩ 𝑆) ≠ ∅ → ¬ 𝑃 ∈ ((cls‘𝐽)‘𝑆)))))
49	48	imp4a 428	. . . . . . 7 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → (𝑥 ∈ 𝐽 → ((𝑃 ∈ 𝑥 ∧ ¬ (𝑥 ∩ 𝑆) ≠ ∅) → ¬ 𝑃 ∈ ((cls‘𝐽)‘𝑆))))
50	49	rexlimdv 3167	. . . . . 6 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → (∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ ¬ (𝑥 ∩ 𝑆) ≠ ∅) → ¬ 𝑃 ∈ ((cls‘𝐽)‘𝑆)))
51	50	imp 412	. . . . 5 ⊢ (((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) ∧ ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ ¬ (𝑥 ∩ 𝑆) ≠ ∅)) → ¬ 𝑃 ∈ ((cls‘𝐽)‘𝑆))
52	51	3adantl3 1187	. . . 4 ⊢ (((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋 ∧ 𝑃 ∈ 𝑋) ∧ ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ ¬ (𝑥 ∩ 𝑆) ≠ ∅)) → ¬ 𝑃 ∈ ((cls‘𝐽)‘𝑆))
53	29, 52	impbida 813	. . 3 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋 ∧ 𝑃 ∈ 𝑋) → (¬ 𝑃 ∈ ((cls‘𝐽)‘𝑆) ↔ ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ ¬ (𝑥 ∩ 𝑆) ≠ ∅)))
54		rexanali 3122	. . 3 ⊢ (∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ ¬ (𝑥 ∩ 𝑆) ≠ ∅) ↔ ¬ ∀𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 → (𝑥 ∩ 𝑆) ≠ ∅))
55	53, 54	bitrdi 290	. 2 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋 ∧ 𝑃 ∈ 𝑋) → (¬ 𝑃 ∈ ((cls‘𝐽)‘𝑆) ↔ ¬ ∀𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 → (𝑥 ∩ 𝑆) ≠ ∅)))
56	55	con4bid 320	1 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋 ∧ 𝑃 ∈ 𝑋) → (𝑃 ∈ ((cls‘𝐽)‘𝑆) ↔ ∀𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 → (𝑥 ∩ 𝑆) ≠ ∅)))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2146   ≠ wne 2961  ∀wral 3082  ∃wrex 3092   ∖ cdif 3905   ∩ cin 3907   ⊆ wss 3908  ∅c0 4289  ∪ cuni 4877  ‘cfv 6543  Topctop 23087  Clsdccld 23210  clsccl 23212

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2738  ax-rep 5243  ax-sep 5262  ax-nul 5274  ax-pow 5341  ax-pr 5409  ax-un 7745

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ne 2962  df-ral 3083  df-rex 3093  df-reu 3373  df-rab 3420  df-v 3460  df-sbc 3748  df-csb 3857  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-int 4918  df-iun 4963  df-iin 4964  df-br 5115  df-opab 5179  df-mpt 5198  df-id 5561  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-rn 5677  df-res 5678  df-ima 5679  df-iota 6499  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-top 23088  df-cld 23213  df-ntr 23214  df-cls 23215

This theorem is used by:  elcls2  23268  clsndisj  23269  elcls3  23277  neindisj2  23317  islp3  23340  lmcls  23496  1stccnp  23656  txcls  23798  dfac14lem  23811  fclsopn  24208  metdseq0  25049  qndenserrn  47054