Theorem regsep2 21551

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 21508	. . . . . . 7 ⊢ (𝐽 ∈ Reg → 𝐽 ∈ Top)
2	1	ad2antrr 719	. . . . . 6 ⊢ (((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴 ∈ 𝑋 ∧ ¬ 𝐴 ∈ 𝐶)) ∧ (𝑦 ∈ 𝐽 ∧ (𝐴 ∈ 𝑦 ∧ ((cls‘𝐽)‘𝑦) ⊆ (𝑋 ∖ 𝐶)))) → 𝐽 ∈ Top)
3		elssuni 4689	. . . . . . . 8 ⊢ (𝑦 ∈ 𝐽 → 𝑦 ⊆ ∪ 𝐽)
4		t1sep.1	. . . . . . . 8 ⊢ 𝑋 = ∪ 𝐽
5	3, 4	syl6sseqr 3877	. . . . . . 7 ⊢ (𝑦 ∈ 𝐽 → 𝑦 ⊆ 𝑋)
6	5	ad2antrl 721	. . . . . 6 ⊢ (((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴 ∈ 𝑋 ∧ ¬ 𝐴 ∈ 𝐶)) ∧ (𝑦 ∈ 𝐽 ∧ (𝐴 ∈ 𝑦 ∧ ((cls‘𝐽)‘𝑦) ⊆ (𝑋 ∖ 𝐶)))) → 𝑦 ⊆ 𝑋)
7	4	clscld 21222	. . . . . 6 ⊢ ((𝐽 ∈ Top ∧ 𝑦 ⊆ 𝑋) → ((cls‘𝐽)‘𝑦) ∈ (Clsd‘𝐽))
8	2, 6, 7	syl2anc 581	. . . . 5 ⊢ (((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴 ∈ 𝑋 ∧ ¬ 𝐴 ∈ 𝐶)) ∧ (𝑦 ∈ 𝐽 ∧ (𝐴 ∈ 𝑦 ∧ ((cls‘𝐽)‘𝑦) ⊆ (𝑋 ∖ 𝐶)))) → ((cls‘𝐽)‘𝑦) ∈ (Clsd‘𝐽))
9	4	cldopn 21206	. . . . 5 ⊢ (((cls‘𝐽)‘𝑦) ∈ (Clsd‘𝐽) → (𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∈ 𝐽)
10	8, 9	syl 17	. . . 4 ⊢ (((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴 ∈ 𝑋 ∧ ¬ 𝐴 ∈ 𝐶)) ∧ (𝑦 ∈ 𝐽 ∧ (𝐴 ∈ 𝑦 ∧ ((cls‘𝐽)‘𝑦) ⊆ (𝑋 ∖ 𝐶)))) → (𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∈ 𝐽)
11		simprrr 802	. . . . 5 ⊢ (((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴 ∈ 𝑋 ∧ ¬ 𝐴 ∈ 𝐶)) ∧ (𝑦 ∈ 𝐽 ∧ (𝐴 ∈ 𝑦 ∧ ((cls‘𝐽)‘𝑦) ⊆ (𝑋 ∖ 𝐶)))) → ((cls‘𝐽)‘𝑦) ⊆ (𝑋 ∖ 𝐶))
12	4	clsss3 21234	. . . . . . 7 ⊢ ((𝐽 ∈ Top ∧ 𝑦 ⊆ 𝑋) → ((cls‘𝐽)‘𝑦) ⊆ 𝑋)
13	2, 6, 12	syl2anc 581	. . . . . 6 ⊢ (((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴 ∈ 𝑋 ∧ ¬ 𝐴 ∈ 𝐶)) ∧ (𝑦 ∈ 𝐽 ∧ (𝐴 ∈ 𝑦 ∧ ((cls‘𝐽)‘𝑦) ⊆ (𝑋 ∖ 𝐶)))) → ((cls‘𝐽)‘𝑦) ⊆ 𝑋)
14		simplr1 1281	. . . . . . 7 ⊢ (((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴 ∈ 𝑋 ∧ ¬ 𝐴 ∈ 𝐶)) ∧ (𝑦 ∈ 𝐽 ∧ (𝐴 ∈ 𝑦 ∧ ((cls‘𝐽)‘𝑦) ⊆ (𝑋 ∖ 𝐶)))) → 𝐶 ∈ (Clsd‘𝐽))
15	4	cldss 21204	. . . . . . 7 ⊢ (𝐶 ∈ (Clsd‘𝐽) → 𝐶 ⊆ 𝑋)
16	14, 15	syl 17	. . . . . 6 ⊢ (((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴 ∈ 𝑋 ∧ ¬ 𝐴 ∈ 𝐶)) ∧ (𝑦 ∈ 𝐽 ∧ (𝐴 ∈ 𝑦 ∧ ((cls‘𝐽)‘𝑦) ⊆ (𝑋 ∖ 𝐶)))) → 𝐶 ⊆ 𝑋)
17		ssconb 3970	. . . . . 6 ⊢ ((((cls‘𝐽)‘𝑦) ⊆ 𝑋 ∧ 𝐶 ⊆ 𝑋) → (((cls‘𝐽)‘𝑦) ⊆ (𝑋 ∖ 𝐶) ↔ 𝐶 ⊆ (𝑋 ∖ ((cls‘𝐽)‘𝑦))))
18	13, 16, 17	syl2anc 581	. . . . 5 ⊢ (((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴 ∈ 𝑋 ∧ ¬ 𝐴 ∈ 𝐶)) ∧ (𝑦 ∈ 𝐽 ∧ (𝐴 ∈ 𝑦 ∧ ((cls‘𝐽)‘𝑦) ⊆ (𝑋 ∖ 𝐶)))) → (((cls‘𝐽)‘𝑦) ⊆ (𝑋 ∖ 𝐶) ↔ 𝐶 ⊆ (𝑋 ∖ ((cls‘𝐽)‘𝑦))))
19	11, 18	mpbid 224	. . . 4 ⊢ (((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴 ∈ 𝑋 ∧ ¬ 𝐴 ∈ 𝐶)) ∧ (𝑦 ∈ 𝐽 ∧ (𝐴 ∈ 𝑦 ∧ ((cls‘𝐽)‘𝑦) ⊆ (𝑋 ∖ 𝐶)))) → 𝐶 ⊆ (𝑋 ∖ ((cls‘𝐽)‘𝑦)))
20		simprrl 801	. . . 4 ⊢ (((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴 ∈ 𝑋 ∧ ¬ 𝐴 ∈ 𝐶)) ∧ (𝑦 ∈ 𝐽 ∧ (𝐴 ∈ 𝑦 ∧ ((cls‘𝐽)‘𝑦) ⊆ (𝑋 ∖ 𝐶)))) → 𝐴 ∈ 𝑦)
21	4	sscls 21231	. . . . . . 7 ⊢ ((𝐽 ∈ Top ∧ 𝑦 ⊆ 𝑋) → 𝑦 ⊆ ((cls‘𝐽)‘𝑦))
22	2, 6, 21	syl2anc 581	. . . . . 6 ⊢ (((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴 ∈ 𝑋 ∧ ¬ 𝐴 ∈ 𝐶)) ∧ (𝑦 ∈ 𝐽 ∧ (𝐴 ∈ 𝑦 ∧ ((cls‘𝐽)‘𝑦) ⊆ (𝑋 ∖ 𝐶)))) → 𝑦 ⊆ ((cls‘𝐽)‘𝑦))
23		sslin 4063	. . . . . 6 ⊢ (𝑦 ⊆ ((cls‘𝐽)‘𝑦) → ((𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∩ 𝑦) ⊆ ((𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∩ ((cls‘𝐽)‘𝑦)))
24	22, 23	syl 17	. . . . 5 ⊢ (((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴 ∈ 𝑋 ∧ ¬ 𝐴 ∈ 𝐶)) ∧ (𝑦 ∈ 𝐽 ∧ (𝐴 ∈ 𝑦 ∧ ((cls‘𝐽)‘𝑦) ⊆ (𝑋 ∖ 𝐶)))) → ((𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∩ 𝑦) ⊆ ((𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∩ ((cls‘𝐽)‘𝑦)))
25		incom 4032	. . . . . 6 ⊢ ((𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∩ ((cls‘𝐽)‘𝑦)) = (((cls‘𝐽)‘𝑦) ∩ (𝑋 ∖ ((cls‘𝐽)‘𝑦)))
26		disjdif 4263	. . . . . 6 ⊢ (((cls‘𝐽)‘𝑦) ∩ (𝑋 ∖ ((cls‘𝐽)‘𝑦))) = ∅
27	25, 26	eqtri 2849	. . . . 5 ⊢ ((𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∩ ((cls‘𝐽)‘𝑦)) = ∅
28		sseq0 4200	. . . . 5 ⊢ ((((𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∩ 𝑦) ⊆ ((𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∩ ((cls‘𝐽)‘𝑦)) ∧ ((𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∩ ((cls‘𝐽)‘𝑦)) = ∅) → ((𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∩ 𝑦) = ∅)
29	24, 27, 28	sylancl 582	. . . 4 ⊢ (((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴 ∈ 𝑋 ∧ ¬ 𝐴 ∈ 𝐶)) ∧ (𝑦 ∈ 𝐽 ∧ (𝐴 ∈ 𝑦 ∧ ((cls‘𝐽)‘𝑦) ⊆ (𝑋 ∖ 𝐶)))) → ((𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∩ 𝑦) = ∅)
30		sseq2 3852	. . . . . 6 ⊢ (𝑥 = (𝑋 ∖ ((cls‘𝐽)‘𝑦)) → (𝐶 ⊆ 𝑥 ↔ 𝐶 ⊆ (𝑋 ∖ ((cls‘𝐽)‘𝑦))))
31		ineq1 4034	. . . . . . 7 ⊢ (𝑥 = (𝑋 ∖ ((cls‘𝐽)‘𝑦)) → (𝑥 ∩ 𝑦) = ((𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∩ 𝑦))
32	31	eqeq1d 2827	. . . . . 6 ⊢ (𝑥 = (𝑋 ∖ ((cls‘𝐽)‘𝑦)) → ((𝑥 ∩ 𝑦) = ∅ ↔ ((𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∩ 𝑦) = ∅))
33	30, 32	3anbi13d 1568	. . . . 5 ⊢ (𝑥 = (𝑋 ∖ ((cls‘𝐽)‘𝑦)) → ((𝐶 ⊆ 𝑥 ∧ 𝐴 ∈ 𝑦 ∧ (𝑥 ∩ 𝑦) = ∅) ↔ (𝐶 ⊆ (𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∧ 𝐴 ∈ 𝑦 ∧ ((𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∩ 𝑦) = ∅)))
34	33	rspcev 3526	. . . 4 ⊢ (((𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∈ 𝐽 ∧ (𝐶 ⊆ (𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∧ 𝐴 ∈ 𝑦 ∧ ((𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∩ 𝑦) = ∅)) → ∃𝑥 ∈ 𝐽 (𝐶 ⊆ 𝑥 ∧ 𝐴 ∈ 𝑦 ∧ (𝑥 ∩ 𝑦) = ∅))
35	10, 19, 20, 29, 34	syl13anc 1497	. . 3 ⊢ (((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴 ∈ 𝑋 ∧ ¬ 𝐴 ∈ 𝐶)) ∧ (𝑦 ∈ 𝐽 ∧ (𝐴 ∈ 𝑦 ∧ ((cls‘𝐽)‘𝑦) ⊆ (𝑋 ∖ 𝐶)))) → ∃𝑥 ∈ 𝐽 (𝐶 ⊆ 𝑥 ∧ 𝐴 ∈ 𝑦 ∧ (𝑥 ∩ 𝑦) = ∅))
36		simpl 476	. . . 4 ⊢ ((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴 ∈ 𝑋 ∧ ¬ 𝐴 ∈ 𝐶)) → 𝐽 ∈ Reg)
37		simpr1 1254	. . . . 5 ⊢ ((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴 ∈ 𝑋 ∧ ¬ 𝐴 ∈ 𝐶)) → 𝐶 ∈ (Clsd‘𝐽))
38	4	cldopn 21206	. . . . 5 ⊢ (𝐶 ∈ (Clsd‘𝐽) → (𝑋 ∖ 𝐶) ∈ 𝐽)
39	37, 38	syl 17	. . . 4 ⊢ ((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴 ∈ 𝑋 ∧ ¬ 𝐴 ∈ 𝐶)) → (𝑋 ∖ 𝐶) ∈ 𝐽)
40		simpr2 1256	. . . . 5 ⊢ ((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴 ∈ 𝑋 ∧ ¬ 𝐴 ∈ 𝐶)) → 𝐴 ∈ 𝑋)
41		simpr3 1258	. . . . 5 ⊢ ((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴 ∈ 𝑋 ∧ ¬ 𝐴 ∈ 𝐶)) → ¬ 𝐴 ∈ 𝐶)
42	40, 41	eldifd 3809	. . . 4 ⊢ ((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴 ∈ 𝑋 ∧ ¬ 𝐴 ∈ 𝐶)) → 𝐴 ∈ (𝑋 ∖ 𝐶))
43		regsep 21509	. . . 4 ⊢ ((𝐽 ∈ Reg ∧ (𝑋 ∖ 𝐶) ∈ 𝐽 ∧ 𝐴 ∈ (𝑋 ∖ 𝐶)) → ∃𝑦 ∈ 𝐽 (𝐴 ∈ 𝑦 ∧ ((cls‘𝐽)‘𝑦) ⊆ (𝑋 ∖ 𝐶)))
44	36, 39, 42, 43	syl3anc 1496	. . 3 ⊢ ((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴 ∈ 𝑋 ∧ ¬ 𝐴 ∈ 𝐶)) → ∃𝑦 ∈ 𝐽 (𝐴 ∈ 𝑦 ∧ ((cls‘𝐽)‘𝑦) ⊆ (𝑋 ∖ 𝐶)))
45	35, 44	reximddv 3226	. 2 ⊢ ((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴 ∈ 𝑋 ∧ ¬ 𝐴 ∈ 𝐶)) → ∃𝑦 ∈ 𝐽 ∃𝑥 ∈ 𝐽 (𝐶 ⊆ 𝑥 ∧ 𝐴 ∈ 𝑦 ∧ (𝑥 ∩ 𝑦) = ∅))
46		rexcom 3309	. 2 ⊢ (∃𝑦 ∈ 𝐽 ∃𝑥 ∈ 𝐽 (𝐶 ⊆ 𝑥 ∧ 𝐴 ∈ 𝑦 ∧ (𝑥 ∩ 𝑦) = ∅) ↔ ∃𝑥 ∈ 𝐽 ∃𝑦 ∈ 𝐽 (𝐶 ⊆ 𝑥 ∧ 𝐴 ∈ 𝑦 ∧ (𝑥 ∩ 𝑦) = ∅))
47	45, 46	sylib 210	1 ⊢ ((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴 ∈ 𝑋 ∧ ¬ 𝐴 ∈ 𝐶)) → ∃𝑥 ∈ 𝐽 ∃𝑦 ∈ 𝐽 (𝐶 ⊆ 𝑥 ∧ 𝐴 ∈ 𝑦 ∧ (𝑥 ∩ 𝑦) = ∅))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 198   ∧ wa 386   ∧ w3a 1113   = wceq 1658   ∈ wcel 2166  ∃wrex 3118   ∖ cdif 3795   ∩ cin 3797   ⊆ wss 3798  ∅c0 4144  ∪ cuni 4658  ‘cfv 6123  Topctop 21068  Clsdccld 21191  clsccl 21193  Regcreg 21484

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1896  ax-4 1910  ax-5 2011  ax-6 2077  ax-7 2114  ax-8 2168  ax-9 2175  ax-10 2194  ax-11 2209  ax-12 2222  ax-13 2391  ax-ext 2803  ax-rep 4994  ax-sep 5005  ax-nul 5013  ax-pow 5065  ax-pr 5127  ax-un 7209

This theorem depends on definitions:  df-bi 199  df-an 387  df-or 881  df-3an 1115  df-tru 1662  df-ex 1881  df-nf 1885  df-sb 2070  df-mo 2605  df-eu 2640  df-clab 2812  df-cleq 2818  df-clel 2821  df-nfc 2958  df-ne 3000  df-ral 3122  df-rex 3123  df-reu 3124  df-rab 3126  df-v 3416  df-sbc 3663  df-csb 3758  df-dif 3801  df-un 3803  df-in 3805  df-ss 3812  df-nul 4145  df-if 4307  df-pw 4380  df-sn 4398  df-pr 4400  df-op 4404  df-uni 4659  df-int 4698  df-iun 4742  df-iin 4743  df-br 4874  df-opab 4936  df-mpt 4953  df-id 5250  df-xp 5348  df-rel 5349  df-cnv 5350  df-co 5351  df-dm 5352  df-rn 5353  df-res 5354  df-ima 5355  df-iota 6086  df-fun 6125  df-fn 6126  df-f 6127  df-f1 6128  df-fo 6129  df-f1o 6130  df-fv 6131  df-top 21069  df-cld 21194  df-cls 21196  df-reg 21491

This theorem is referenced by:  isreg2  21552