MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  regsep2 Structured version   Visualization version   GIF version

Theorem regsep2 22435
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
StepHypRef Expression
1 regtop 22392 . . . . . . 7 (𝐽 ∈ Reg → 𝐽 ∈ Top)
21ad2antrr 722 . . . . . 6 (((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴𝑋 ∧ ¬ 𝐴𝐶)) ∧ (𝑦𝐽 ∧ (𝐴𝑦 ∧ ((cls‘𝐽)‘𝑦) ⊆ (𝑋𝐶)))) → 𝐽 ∈ Top)
3 elssuni 4868 . . . . . . . 8 (𝑦𝐽𝑦 𝐽)
4 t1sep.1 . . . . . . . 8 𝑋 = 𝐽
53, 4sseqtrrdi 3968 . . . . . . 7 (𝑦𝐽𝑦𝑋)
65ad2antrl 724 . . . . . 6 (((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴𝑋 ∧ ¬ 𝐴𝐶)) ∧ (𝑦𝐽 ∧ (𝐴𝑦 ∧ ((cls‘𝐽)‘𝑦) ⊆ (𝑋𝐶)))) → 𝑦𝑋)
74clscld 22106 . . . . . 6 ((𝐽 ∈ Top ∧ 𝑦𝑋) → ((cls‘𝐽)‘𝑦) ∈ (Clsd‘𝐽))
82, 6, 7syl2anc 583 . . . . 5 (((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴𝑋 ∧ ¬ 𝐴𝐶)) ∧ (𝑦𝐽 ∧ (𝐴𝑦 ∧ ((cls‘𝐽)‘𝑦) ⊆ (𝑋𝐶)))) → ((cls‘𝐽)‘𝑦) ∈ (Clsd‘𝐽))
94cldopn 22090 . . . . 5 (((cls‘𝐽)‘𝑦) ∈ (Clsd‘𝐽) → (𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∈ 𝐽)
108, 9syl 17 . . . 4 (((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴𝑋 ∧ ¬ 𝐴𝐶)) ∧ (𝑦𝐽 ∧ (𝐴𝑦 ∧ ((cls‘𝐽)‘𝑦) ⊆ (𝑋𝐶)))) → (𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∈ 𝐽)
11 simprrr 778 . . . . 5 (((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴𝑋 ∧ ¬ 𝐴𝐶)) ∧ (𝑦𝐽 ∧ (𝐴𝑦 ∧ ((cls‘𝐽)‘𝑦) ⊆ (𝑋𝐶)))) → ((cls‘𝐽)‘𝑦) ⊆ (𝑋𝐶))
124clsss3 22118 . . . . . . 7 ((𝐽 ∈ Top ∧ 𝑦𝑋) → ((cls‘𝐽)‘𝑦) ⊆ 𝑋)
132, 6, 12syl2anc 583 . . . . . 6 (((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴𝑋 ∧ ¬ 𝐴𝐶)) ∧ (𝑦𝐽 ∧ (𝐴𝑦 ∧ ((cls‘𝐽)‘𝑦) ⊆ (𝑋𝐶)))) → ((cls‘𝐽)‘𝑦) ⊆ 𝑋)
14 simplr1 1213 . . . . . . 7 (((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴𝑋 ∧ ¬ 𝐴𝐶)) ∧ (𝑦𝐽 ∧ (𝐴𝑦 ∧ ((cls‘𝐽)‘𝑦) ⊆ (𝑋𝐶)))) → 𝐶 ∈ (Clsd‘𝐽))
154cldss 22088 . . . . . . 7 (𝐶 ∈ (Clsd‘𝐽) → 𝐶𝑋)
1614, 15syl 17 . . . . . 6 (((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴𝑋 ∧ ¬ 𝐴𝐶)) ∧ (𝑦𝐽 ∧ (𝐴𝑦 ∧ ((cls‘𝐽)‘𝑦) ⊆ (𝑋𝐶)))) → 𝐶𝑋)
17 ssconb 4068 . . . . . 6 ((((cls‘𝐽)‘𝑦) ⊆ 𝑋𝐶𝑋) → (((cls‘𝐽)‘𝑦) ⊆ (𝑋𝐶) ↔ 𝐶 ⊆ (𝑋 ∖ ((cls‘𝐽)‘𝑦))))
1813, 16, 17syl2anc 583 . . . . 5 (((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴𝑋 ∧ ¬ 𝐴𝐶)) ∧ (𝑦𝐽 ∧ (𝐴𝑦 ∧ ((cls‘𝐽)‘𝑦) ⊆ (𝑋𝐶)))) → (((cls‘𝐽)‘𝑦) ⊆ (𝑋𝐶) ↔ 𝐶 ⊆ (𝑋 ∖ ((cls‘𝐽)‘𝑦))))
1911, 18mpbid 231 . . . 4 (((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴𝑋 ∧ ¬ 𝐴𝐶)) ∧ (𝑦𝐽 ∧ (𝐴𝑦 ∧ ((cls‘𝐽)‘𝑦) ⊆ (𝑋𝐶)))) → 𝐶 ⊆ (𝑋 ∖ ((cls‘𝐽)‘𝑦)))
20 simprrl 777 . . . 4 (((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴𝑋 ∧ ¬ 𝐴𝐶)) ∧ (𝑦𝐽 ∧ (𝐴𝑦 ∧ ((cls‘𝐽)‘𝑦) ⊆ (𝑋𝐶)))) → 𝐴𝑦)
214sscls 22115 . . . . . . 7 ((𝐽 ∈ Top ∧ 𝑦𝑋) → 𝑦 ⊆ ((cls‘𝐽)‘𝑦))
222, 6, 21syl2anc 583 . . . . . 6 (((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴𝑋 ∧ ¬ 𝐴𝐶)) ∧ (𝑦𝐽 ∧ (𝐴𝑦 ∧ ((cls‘𝐽)‘𝑦) ⊆ (𝑋𝐶)))) → 𝑦 ⊆ ((cls‘𝐽)‘𝑦))
23 sslin 4165 . . . . . 6 (𝑦 ⊆ ((cls‘𝐽)‘𝑦) → ((𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∩ 𝑦) ⊆ ((𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∩ ((cls‘𝐽)‘𝑦)))
2422, 23syl 17 . . . . 5 (((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴𝑋 ∧ ¬ 𝐴𝐶)) ∧ (𝑦𝐽 ∧ (𝐴𝑦 ∧ ((cls‘𝐽)‘𝑦) ⊆ (𝑋𝐶)))) → ((𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∩ 𝑦) ⊆ ((𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∩ ((cls‘𝐽)‘𝑦)))
25 disjdifr 4403 . . . . 5 ((𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∩ ((cls‘𝐽)‘𝑦)) = ∅
26 sseq0 4330 . . . . 5 ((((𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∩ 𝑦) ⊆ ((𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∩ ((cls‘𝐽)‘𝑦)) ∧ ((𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∩ ((cls‘𝐽)‘𝑦)) = ∅) → ((𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∩ 𝑦) = ∅)
2724, 25, 26sylancl 585 . . . 4 (((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴𝑋 ∧ ¬ 𝐴𝐶)) ∧ (𝑦𝐽 ∧ (𝐴𝑦 ∧ ((cls‘𝐽)‘𝑦) ⊆ (𝑋𝐶)))) → ((𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∩ 𝑦) = ∅)
28 sseq2 3943 . . . . . 6 (𝑥 = (𝑋 ∖ ((cls‘𝐽)‘𝑦)) → (𝐶𝑥𝐶 ⊆ (𝑋 ∖ ((cls‘𝐽)‘𝑦))))
29 ineq1 4136 . . . . . . 7 (𝑥 = (𝑋 ∖ ((cls‘𝐽)‘𝑦)) → (𝑥𝑦) = ((𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∩ 𝑦))
3029eqeq1d 2740 . . . . . 6 (𝑥 = (𝑋 ∖ ((cls‘𝐽)‘𝑦)) → ((𝑥𝑦) = ∅ ↔ ((𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∩ 𝑦) = ∅))
3128, 303anbi13d 1436 . . . . 5 (𝑥 = (𝑋 ∖ ((cls‘𝐽)‘𝑦)) → ((𝐶𝑥𝐴𝑦 ∧ (𝑥𝑦) = ∅) ↔ (𝐶 ⊆ (𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∧ 𝐴𝑦 ∧ ((𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∩ 𝑦) = ∅)))
3231rspcev 3552 . . . 4 (((𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∈ 𝐽 ∧ (𝐶 ⊆ (𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∧ 𝐴𝑦 ∧ ((𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∩ 𝑦) = ∅)) → ∃𝑥𝐽 (𝐶𝑥𝐴𝑦 ∧ (𝑥𝑦) = ∅))
3310, 19, 20, 27, 32syl13anc 1370 . . 3 (((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴𝑋 ∧ ¬ 𝐴𝐶)) ∧ (𝑦𝐽 ∧ (𝐴𝑦 ∧ ((cls‘𝐽)‘𝑦) ⊆ (𝑋𝐶)))) → ∃𝑥𝐽 (𝐶𝑥𝐴𝑦 ∧ (𝑥𝑦) = ∅))
34 simpl 482 . . . 4 ((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴𝑋 ∧ ¬ 𝐴𝐶)) → 𝐽 ∈ Reg)
35 simpr1 1192 . . . . 5 ((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴𝑋 ∧ ¬ 𝐴𝐶)) → 𝐶 ∈ (Clsd‘𝐽))
364cldopn 22090 . . . . 5 (𝐶 ∈ (Clsd‘𝐽) → (𝑋𝐶) ∈ 𝐽)
3735, 36syl 17 . . . 4 ((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴𝑋 ∧ ¬ 𝐴𝐶)) → (𝑋𝐶) ∈ 𝐽)
38 simpr2 1193 . . . . 5 ((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴𝑋 ∧ ¬ 𝐴𝐶)) → 𝐴𝑋)
39 simpr3 1194 . . . . 5 ((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴𝑋 ∧ ¬ 𝐴𝐶)) → ¬ 𝐴𝐶)
4038, 39eldifd 3894 . . . 4 ((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴𝑋 ∧ ¬ 𝐴𝐶)) → 𝐴 ∈ (𝑋𝐶))
41 regsep 22393 . . . 4 ((𝐽 ∈ Reg ∧ (𝑋𝐶) ∈ 𝐽𝐴 ∈ (𝑋𝐶)) → ∃𝑦𝐽 (𝐴𝑦 ∧ ((cls‘𝐽)‘𝑦) ⊆ (𝑋𝐶)))
4234, 37, 40, 41syl3anc 1369 . . 3 ((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴𝑋 ∧ ¬ 𝐴𝐶)) → ∃𝑦𝐽 (𝐴𝑦 ∧ ((cls‘𝐽)‘𝑦) ⊆ (𝑋𝐶)))
4333, 42reximddv 3203 . 2 ((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴𝑋 ∧ ¬ 𝐴𝐶)) → ∃𝑦𝐽𝑥𝐽 (𝐶𝑥𝐴𝑦 ∧ (𝑥𝑦) = ∅))
44 rexcom 3281 . 2 (∃𝑦𝐽𝑥𝐽 (𝐶𝑥𝐴𝑦 ∧ (𝑥𝑦) = ∅) ↔ ∃𝑥𝐽𝑦𝐽 (𝐶𝑥𝐴𝑦 ∧ (𝑥𝑦) = ∅))
4543, 44sylib 217 1 ((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴𝑋 ∧ ¬ 𝐴𝐶)) → ∃𝑥𝐽𝑦𝐽 (𝐶𝑥𝐴𝑦 ∧ (𝑥𝑦) = ∅))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 205  wa 395  w3a 1085   = wceq 1539  wcel 2108  wrex 3064  cdif 3880  cin 3882  wss 3883  c0 4253   cuni 4836  cfv 6418  Topctop 21950  Clsdccld 22075  clsccl 22077  Regcreg 22368
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-rep 5205  ax-sep 5218  ax-nul 5225  ax-pow 5283  ax-pr 5347  ax-un 7566
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-ral 3068  df-rex 3069  df-reu 3070  df-rab 3072  df-v 3424  df-sbc 3712  df-csb 3829  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4254  df-if 4457  df-pw 4532  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4837  df-int 4877  df-iun 4923  df-iin 4924  df-br 5071  df-opab 5133  df-mpt 5154  df-id 5480  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-res 5592  df-ima 5593  df-iota 6376  df-fun 6420  df-fn 6421  df-f 6422  df-f1 6423  df-fo 6424  df-f1o 6425  df-fv 6426  df-top 21951  df-cld 22078  df-cls 22080  df-reg 22375
This theorem is referenced by:  isreg2  22436
  Copyright terms: Public domain W3C validator