Theorem regsep2 21986

Description: In a regular space, a closed set is separated by open sets from a point not in it. (Contributed by Jeff Hankins, 1-Feb-2010.) (Revised by Mario Carneiro, 25-Aug-2015.)

Hypothesis

Ref	Expression
t1sep.1	⊢ 𝑋 = ∪ 𝐽

Assertion

Ref	Expression
regsep2	⊢ ((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴 ∈ 𝑋 ∧ ¬ 𝐴 ∈ 𝐶)) → ∃𝑥 ∈ 𝐽 ∃𝑦 ∈ 𝐽 (𝐶 ⊆ 𝑥 ∧ 𝐴 ∈ 𝑦 ∧ (𝑥 ∩ 𝑦) = ∅))

Distinct variable groups:   𝑥,𝑦,𝐴   𝑥,𝐶,𝑦   𝑥,𝐽,𝑦   𝑥,𝑋,𝑦

Proof of Theorem regsep2

Step	Hyp	Ref	Expression
1		regtop 21943	. . . . . . 7 ⊢ (𝐽 ∈ Reg → 𝐽 ∈ Top)
2	1	ad2antrr 724	. . . . . 6 ⊢ (((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴 ∈ 𝑋 ∧ ¬ 𝐴 ∈ 𝐶)) ∧ (𝑦 ∈ 𝐽 ∧ (𝐴 ∈ 𝑦 ∧ ((cls‘𝐽)‘𝑦) ⊆ (𝑋 ∖ 𝐶)))) → 𝐽 ∈ Top)
3		elssuni 4870	. . . . . . . 8 ⊢ (𝑦 ∈ 𝐽 → 𝑦 ⊆ ∪ 𝐽)
4		t1sep.1	. . . . . . . 8 ⊢ 𝑋 = ∪ 𝐽
5	3, 4	sseqtrrdi 4020	. . . . . . 7 ⊢ (𝑦 ∈ 𝐽 → 𝑦 ⊆ 𝑋)
6	5	ad2antrl 726	. . . . . 6 ⊢ (((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴 ∈ 𝑋 ∧ ¬ 𝐴 ∈ 𝐶)) ∧ (𝑦 ∈ 𝐽 ∧ (𝐴 ∈ 𝑦 ∧ ((cls‘𝐽)‘𝑦) ⊆ (𝑋 ∖ 𝐶)))) → 𝑦 ⊆ 𝑋)
7	4	clscld 21657	. . . . . 6 ⊢ ((𝐽 ∈ Top ∧ 𝑦 ⊆ 𝑋) → ((cls‘𝐽)‘𝑦) ∈ (Clsd‘𝐽))
8	2, 6, 7	syl2anc 586	. . . . 5 ⊢ (((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴 ∈ 𝑋 ∧ ¬ 𝐴 ∈ 𝐶)) ∧ (𝑦 ∈ 𝐽 ∧ (𝐴 ∈ 𝑦 ∧ ((cls‘𝐽)‘𝑦) ⊆ (𝑋 ∖ 𝐶)))) → ((cls‘𝐽)‘𝑦) ∈ (Clsd‘𝐽))
9	4	cldopn 21641	. . . . 5 ⊢ (((cls‘𝐽)‘𝑦) ∈ (Clsd‘𝐽) → (𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∈ 𝐽)
10	8, 9	syl 17	. . . 4 ⊢ (((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴 ∈ 𝑋 ∧ ¬ 𝐴 ∈ 𝐶)) ∧ (𝑦 ∈ 𝐽 ∧ (𝐴 ∈ 𝑦 ∧ ((cls‘𝐽)‘𝑦) ⊆ (𝑋 ∖ 𝐶)))) → (𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∈ 𝐽)
11		simprrr 780	. . . . 5 ⊢ (((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴 ∈ 𝑋 ∧ ¬ 𝐴 ∈ 𝐶)) ∧ (𝑦 ∈ 𝐽 ∧ (𝐴 ∈ 𝑦 ∧ ((cls‘𝐽)‘𝑦) ⊆ (𝑋 ∖ 𝐶)))) → ((cls‘𝐽)‘𝑦) ⊆ (𝑋 ∖ 𝐶))
12	4	clsss3 21669	. . . . . . 7 ⊢ ((𝐽 ∈ Top ∧ 𝑦 ⊆ 𝑋) → ((cls‘𝐽)‘𝑦) ⊆ 𝑋)
13	2, 6, 12	syl2anc 586	. . . . . 6 ⊢ (((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴 ∈ 𝑋 ∧ ¬ 𝐴 ∈ 𝐶)) ∧ (𝑦 ∈ 𝐽 ∧ (𝐴 ∈ 𝑦 ∧ ((cls‘𝐽)‘𝑦) ⊆ (𝑋 ∖ 𝐶)))) → ((cls‘𝐽)‘𝑦) ⊆ 𝑋)
14		simplr1 1211	. . . . . . 7 ⊢ (((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴 ∈ 𝑋 ∧ ¬ 𝐴 ∈ 𝐶)) ∧ (𝑦 ∈ 𝐽 ∧ (𝐴 ∈ 𝑦 ∧ ((cls‘𝐽)‘𝑦) ⊆ (𝑋 ∖ 𝐶)))) → 𝐶 ∈ (Clsd‘𝐽))
15	4	cldss 21639	. . . . . . 7 ⊢ (𝐶 ∈ (Clsd‘𝐽) → 𝐶 ⊆ 𝑋)
16	14, 15	syl 17	. . . . . 6 ⊢ (((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴 ∈ 𝑋 ∧ ¬ 𝐴 ∈ 𝐶)) ∧ (𝑦 ∈ 𝐽 ∧ (𝐴 ∈ 𝑦 ∧ ((cls‘𝐽)‘𝑦) ⊆ (𝑋 ∖ 𝐶)))) → 𝐶 ⊆ 𝑋)
17		ssconb 4116	. . . . . 6 ⊢ ((((cls‘𝐽)‘𝑦) ⊆ 𝑋 ∧ 𝐶 ⊆ 𝑋) → (((cls‘𝐽)‘𝑦) ⊆ (𝑋 ∖ 𝐶) ↔ 𝐶 ⊆ (𝑋 ∖ ((cls‘𝐽)‘𝑦))))
18	13, 16, 17	syl2anc 586	. . . . 5 ⊢ (((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴 ∈ 𝑋 ∧ ¬ 𝐴 ∈ 𝐶)) ∧ (𝑦 ∈ 𝐽 ∧ (𝐴 ∈ 𝑦 ∧ ((cls‘𝐽)‘𝑦) ⊆ (𝑋 ∖ 𝐶)))) → (((cls‘𝐽)‘𝑦) ⊆ (𝑋 ∖ 𝐶) ↔ 𝐶 ⊆ (𝑋 ∖ ((cls‘𝐽)‘𝑦))))
19	11, 18	mpbid 234	. . . 4 ⊢ (((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴 ∈ 𝑋 ∧ ¬ 𝐴 ∈ 𝐶)) ∧ (𝑦 ∈ 𝐽 ∧ (𝐴 ∈ 𝑦 ∧ ((cls‘𝐽)‘𝑦) ⊆ (𝑋 ∖ 𝐶)))) → 𝐶 ⊆ (𝑋 ∖ ((cls‘𝐽)‘𝑦)))
20		simprrl 779	. . . 4 ⊢ (((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴 ∈ 𝑋 ∧ ¬ 𝐴 ∈ 𝐶)) ∧ (𝑦 ∈ 𝐽 ∧ (𝐴 ∈ 𝑦 ∧ ((cls‘𝐽)‘𝑦) ⊆ (𝑋 ∖ 𝐶)))) → 𝐴 ∈ 𝑦)
21	4	sscls 21666	. . . . . . 7 ⊢ ((𝐽 ∈ Top ∧ 𝑦 ⊆ 𝑋) → 𝑦 ⊆ ((cls‘𝐽)‘𝑦))
22	2, 6, 21	syl2anc 586	. . . . . 6 ⊢ (((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴 ∈ 𝑋 ∧ ¬ 𝐴 ∈ 𝐶)) ∧ (𝑦 ∈ 𝐽 ∧ (𝐴 ∈ 𝑦 ∧ ((cls‘𝐽)‘𝑦) ⊆ (𝑋 ∖ 𝐶)))) → 𝑦 ⊆ ((cls‘𝐽)‘𝑦))
23		sslin 4213	. . . . . 6 ⊢ (𝑦 ⊆ ((cls‘𝐽)‘𝑦) → ((𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∩ 𝑦) ⊆ ((𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∩ ((cls‘𝐽)‘𝑦)))
24	22, 23	syl 17	. . . . 5 ⊢ (((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴 ∈ 𝑋 ∧ ¬ 𝐴 ∈ 𝐶)) ∧ (𝑦 ∈ 𝐽 ∧ (𝐴 ∈ 𝑦 ∧ ((cls‘𝐽)‘𝑦) ⊆ (𝑋 ∖ 𝐶)))) → ((𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∩ 𝑦) ⊆ ((𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∩ ((cls‘𝐽)‘𝑦)))
25		incom 4180	. . . . . 6 ⊢ ((𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∩ ((cls‘𝐽)‘𝑦)) = (((cls‘𝐽)‘𝑦) ∩ (𝑋 ∖ ((cls‘𝐽)‘𝑦)))
26		disjdif 4423	. . . . . 6 ⊢ (((cls‘𝐽)‘𝑦) ∩ (𝑋 ∖ ((cls‘𝐽)‘𝑦))) = ∅
27	25, 26	eqtri 2846	. . . . 5 ⊢ ((𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∩ ((cls‘𝐽)‘𝑦)) = ∅
28		sseq0 4355	. . . . 5 ⊢ ((((𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∩ 𝑦) ⊆ ((𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∩ ((cls‘𝐽)‘𝑦)) ∧ ((𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∩ ((cls‘𝐽)‘𝑦)) = ∅) → ((𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∩ 𝑦) = ∅)
29	24, 27, 28	sylancl 588	. . . 4 ⊢ (((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴 ∈ 𝑋 ∧ ¬ 𝐴 ∈ 𝐶)) ∧ (𝑦 ∈ 𝐽 ∧ (𝐴 ∈ 𝑦 ∧ ((cls‘𝐽)‘𝑦) ⊆ (𝑋 ∖ 𝐶)))) → ((𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∩ 𝑦) = ∅)
30		sseq2 3995	. . . . . 6 ⊢ (𝑥 = (𝑋 ∖ ((cls‘𝐽)‘𝑦)) → (𝐶 ⊆ 𝑥 ↔ 𝐶 ⊆ (𝑋 ∖ ((cls‘𝐽)‘𝑦))))
31		ineq1 4183	. . . . . . 7 ⊢ (𝑥 = (𝑋 ∖ ((cls‘𝐽)‘𝑦)) → (𝑥 ∩ 𝑦) = ((𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∩ 𝑦))
32	31	eqeq1d 2825	. . . . . 6 ⊢ (𝑥 = (𝑋 ∖ ((cls‘𝐽)‘𝑦)) → ((𝑥 ∩ 𝑦) = ∅ ↔ ((𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∩ 𝑦) = ∅))
33	30, 32	3anbi13d 1434	. . . . 5 ⊢ (𝑥 = (𝑋 ∖ ((cls‘𝐽)‘𝑦)) → ((𝐶 ⊆ 𝑥 ∧ 𝐴 ∈ 𝑦 ∧ (𝑥 ∩ 𝑦) = ∅) ↔ (𝐶 ⊆ (𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∧ 𝐴 ∈ 𝑦 ∧ ((𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∩ 𝑦) = ∅)))
34	33	rspcev 3625	. . . 4 ⊢ (((𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∈ 𝐽 ∧ (𝐶 ⊆ (𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∧ 𝐴 ∈ 𝑦 ∧ ((𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∩ 𝑦) = ∅)) → ∃𝑥 ∈ 𝐽 (𝐶 ⊆ 𝑥 ∧ 𝐴 ∈ 𝑦 ∧ (𝑥 ∩ 𝑦) = ∅))
35	10, 19, 20, 29, 34	syl13anc 1368	. . 3 ⊢ (((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴 ∈ 𝑋 ∧ ¬ 𝐴 ∈ 𝐶)) ∧ (𝑦 ∈ 𝐽 ∧ (𝐴 ∈ 𝑦 ∧ ((cls‘𝐽)‘𝑦) ⊆ (𝑋 ∖ 𝐶)))) → ∃𝑥 ∈ 𝐽 (𝐶 ⊆ 𝑥 ∧ 𝐴 ∈ 𝑦 ∧ (𝑥 ∩ 𝑦) = ∅))
36		simpl 485	. . . 4 ⊢ ((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴 ∈ 𝑋 ∧ ¬ 𝐴 ∈ 𝐶)) → 𝐽 ∈ Reg)
37		simpr1 1190	. . . . 5 ⊢ ((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴 ∈ 𝑋 ∧ ¬ 𝐴 ∈ 𝐶)) → 𝐶 ∈ (Clsd‘𝐽))
38	4	cldopn 21641	. . . . 5 ⊢ (𝐶 ∈ (Clsd‘𝐽) → (𝑋 ∖ 𝐶) ∈ 𝐽)
39	37, 38	syl 17	. . . 4 ⊢ ((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴 ∈ 𝑋 ∧ ¬ 𝐴 ∈ 𝐶)) → (𝑋 ∖ 𝐶) ∈ 𝐽)
40		simpr2 1191	. . . . 5 ⊢ ((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴 ∈ 𝑋 ∧ ¬ 𝐴 ∈ 𝐶)) → 𝐴 ∈ 𝑋)
41		simpr3 1192	. . . . 5 ⊢ ((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴 ∈ 𝑋 ∧ ¬ 𝐴 ∈ 𝐶)) → ¬ 𝐴 ∈ 𝐶)
42	40, 41	eldifd 3949	. . . 4 ⊢ ((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴 ∈ 𝑋 ∧ ¬ 𝐴 ∈ 𝐶)) → 𝐴 ∈ (𝑋 ∖ 𝐶))
43		regsep 21944	. . . 4 ⊢ ((𝐽 ∈ Reg ∧ (𝑋 ∖ 𝐶) ∈ 𝐽 ∧ 𝐴 ∈ (𝑋 ∖ 𝐶)) → ∃𝑦 ∈ 𝐽 (𝐴 ∈ 𝑦 ∧ ((cls‘𝐽)‘𝑦) ⊆ (𝑋 ∖ 𝐶)))
44	36, 39, 42, 43	syl3anc 1367	. . 3 ⊢ ((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴 ∈ 𝑋 ∧ ¬ 𝐴 ∈ 𝐶)) → ∃𝑦 ∈ 𝐽 (𝐴 ∈ 𝑦 ∧ ((cls‘𝐽)‘𝑦) ⊆ (𝑋 ∖ 𝐶)))
45	35, 44	reximddv 3277	. 2 ⊢ ((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴 ∈ 𝑋 ∧ ¬ 𝐴 ∈ 𝐶)) → ∃𝑦 ∈ 𝐽 ∃𝑥 ∈ 𝐽 (𝐶 ⊆ 𝑥 ∧ 𝐴 ∈ 𝑦 ∧ (𝑥 ∩ 𝑦) = ∅))
46		rexcom 3357	. 2 ⊢ (∃𝑦 ∈ 𝐽 ∃𝑥 ∈ 𝐽 (𝐶 ⊆ 𝑥 ∧ 𝐴 ∈ 𝑦 ∧ (𝑥 ∩ 𝑦) = ∅) ↔ ∃𝑥 ∈ 𝐽 ∃𝑦 ∈ 𝐽 (𝐶 ⊆ 𝑥 ∧ 𝐴 ∈ 𝑦 ∧ (𝑥 ∩ 𝑦) = ∅))
47	45, 46	sylib 220	1 ⊢ ((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴 ∈ 𝑋 ∧ ¬ 𝐴 ∈ 𝐶)) → ∃𝑥 ∈ 𝐽 ∃𝑦 ∈ 𝐽 (𝐶 ⊆ 𝑥 ∧ 𝐴 ∈ 𝑦 ∧ (𝑥 ∩ 𝑦) = ∅))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 208   ∧ wa 398   ∧ w3a 1083   = wceq 1537   ∈ wcel 2114  ∃wrex 3141   ∖ cdif 3935   ∩ cin 3937   ⊆ wss 3938  ∅c0 4293  ∪ cuni 4840  ‘cfv 6357  Topctop 21503  Clsdccld 21626  clsccl 21628  Regcreg 21919

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2795  ax-rep 5192  ax-sep 5205  ax-nul 5212  ax-pow 5268  ax-pr 5332  ax-un 7463

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2802  df-cleq 2816  df-clel 2895  df-nfc 2965  df-ne 3019  df-ral 3145  df-rex 3146  df-reu 3147  df-rab 3149  df-v 3498  df-sbc 3775  df-csb 3886  df-dif 3941  df-un 3943  df-in 3945  df-ss 3954  df-nul 4294  df-if 4470  df-pw 4543  df-sn 4570  df-pr 4572  df-op 4576  df-uni 4841  df-int 4879  df-iun 4923  df-iin 4924  df-br 5069  df-opab 5131  df-mpt 5149  df-id 5462  df-xp 5563  df-rel 5564  df-cnv 5565  df-co 5566  df-dm 5567  df-rn 5568  df-res 5569  df-ima 5570  df-iota 6316  df-fun 6359  df-fn 6360  df-f 6361  df-f1 6362  df-fo 6363  df-f1o 6364  df-fv 6365  df-top 21504  df-cld 21629  df-cls 21631  df-reg 21926

This theorem is referenced by:  isreg2  21987