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

Theorem regsep2 23296
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 23253 . . . . . . 7 (𝐽 ∈ Reg → 𝐽 ∈ Top)
21ad2antrr 726 . . . . . 6 (((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴𝑋 ∧ ¬ 𝐴𝐶)) ∧ (𝑦𝐽 ∧ (𝐴𝑦 ∧ ((cls‘𝐽)‘𝑦) ⊆ (𝑋𝐶)))) → 𝐽 ∈ Top)
3 elssuni 4897 . . . . . . . 8 (𝑦𝐽𝑦 𝐽)
4 t1sep.1 . . . . . . . 8 𝑋 = 𝐽
53, 4sseqtrrdi 3985 . . . . . . 7 (𝑦𝐽𝑦𝑋)
65ad2antrl 728 . . . . . 6 (((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴𝑋 ∧ ¬ 𝐴𝐶)) ∧ (𝑦𝐽 ∧ (𝐴𝑦 ∧ ((cls‘𝐽)‘𝑦) ⊆ (𝑋𝐶)))) → 𝑦𝑋)
74clscld 22967 . . . . . 6 ((𝐽 ∈ Top ∧ 𝑦𝑋) → ((cls‘𝐽)‘𝑦) ∈ (Clsd‘𝐽))
82, 6, 7syl2anc 584 . . . . 5 (((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴𝑋 ∧ ¬ 𝐴𝐶)) ∧ (𝑦𝐽 ∧ (𝐴𝑦 ∧ ((cls‘𝐽)‘𝑦) ⊆ (𝑋𝐶)))) → ((cls‘𝐽)‘𝑦) ∈ (Clsd‘𝐽))
94cldopn 22951 . . . . 5 (((cls‘𝐽)‘𝑦) ∈ (Clsd‘𝐽) → (𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∈ 𝐽)
108, 9syl 17 . . . 4 (((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴𝑋 ∧ ¬ 𝐴𝐶)) ∧ (𝑦𝐽 ∧ (𝐴𝑦 ∧ ((cls‘𝐽)‘𝑦) ⊆ (𝑋𝐶)))) → (𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∈ 𝐽)
11 simprrr 781 . . . . 5 (((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴𝑋 ∧ ¬ 𝐴𝐶)) ∧ (𝑦𝐽 ∧ (𝐴𝑦 ∧ ((cls‘𝐽)‘𝑦) ⊆ (𝑋𝐶)))) → ((cls‘𝐽)‘𝑦) ⊆ (𝑋𝐶))
124clsss3 22979 . . . . . . 7 ((𝐽 ∈ Top ∧ 𝑦𝑋) → ((cls‘𝐽)‘𝑦) ⊆ 𝑋)
132, 6, 12syl2anc 584 . . . . . 6 (((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴𝑋 ∧ ¬ 𝐴𝐶)) ∧ (𝑦𝐽 ∧ (𝐴𝑦 ∧ ((cls‘𝐽)‘𝑦) ⊆ (𝑋𝐶)))) → ((cls‘𝐽)‘𝑦) ⊆ 𝑋)
14 simplr1 1216 . . . . . . 7 (((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴𝑋 ∧ ¬ 𝐴𝐶)) ∧ (𝑦𝐽 ∧ (𝐴𝑦 ∧ ((cls‘𝐽)‘𝑦) ⊆ (𝑋𝐶)))) → 𝐶 ∈ (Clsd‘𝐽))
154cldss 22949 . . . . . . 7 (𝐶 ∈ (Clsd‘𝐽) → 𝐶𝑋)
1614, 15syl 17 . . . . . 6 (((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴𝑋 ∧ ¬ 𝐴𝐶)) ∧ (𝑦𝐽 ∧ (𝐴𝑦 ∧ ((cls‘𝐽)‘𝑦) ⊆ (𝑋𝐶)))) → 𝐶𝑋)
17 ssconb 4101 . . . . . 6 ((((cls‘𝐽)‘𝑦) ⊆ 𝑋𝐶𝑋) → (((cls‘𝐽)‘𝑦) ⊆ (𝑋𝐶) ↔ 𝐶 ⊆ (𝑋 ∖ ((cls‘𝐽)‘𝑦))))
1813, 16, 17syl2anc 584 . . . . 5 (((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴𝑋 ∧ ¬ 𝐴𝐶)) ∧ (𝑦𝐽 ∧ (𝐴𝑦 ∧ ((cls‘𝐽)‘𝑦) ⊆ (𝑋𝐶)))) → (((cls‘𝐽)‘𝑦) ⊆ (𝑋𝐶) ↔ 𝐶 ⊆ (𝑋 ∖ ((cls‘𝐽)‘𝑦))))
1911, 18mpbid 232 . . . 4 (((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴𝑋 ∧ ¬ 𝐴𝐶)) ∧ (𝑦𝐽 ∧ (𝐴𝑦 ∧ ((cls‘𝐽)‘𝑦) ⊆ (𝑋𝐶)))) → 𝐶 ⊆ (𝑋 ∖ ((cls‘𝐽)‘𝑦)))
20 simprrl 780 . . . 4 (((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴𝑋 ∧ ¬ 𝐴𝐶)) ∧ (𝑦𝐽 ∧ (𝐴𝑦 ∧ ((cls‘𝐽)‘𝑦) ⊆ (𝑋𝐶)))) → 𝐴𝑦)
214sscls 22976 . . . . . . 7 ((𝐽 ∈ Top ∧ 𝑦𝑋) → 𝑦 ⊆ ((cls‘𝐽)‘𝑦))
222, 6, 21syl2anc 584 . . . . . 6 (((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴𝑋 ∧ ¬ 𝐴𝐶)) ∧ (𝑦𝐽 ∧ (𝐴𝑦 ∧ ((cls‘𝐽)‘𝑦) ⊆ (𝑋𝐶)))) → 𝑦 ⊆ ((cls‘𝐽)‘𝑦))
23 sslin 4202 . . . . . 6 (𝑦 ⊆ ((cls‘𝐽)‘𝑦) → ((𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∩ 𝑦) ⊆ ((𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∩ ((cls‘𝐽)‘𝑦)))
2422, 23syl 17 . . . . 5 (((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴𝑋 ∧ ¬ 𝐴𝐶)) ∧ (𝑦𝐽 ∧ (𝐴𝑦 ∧ ((cls‘𝐽)‘𝑦) ⊆ (𝑋𝐶)))) → ((𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∩ 𝑦) ⊆ ((𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∩ ((cls‘𝐽)‘𝑦)))
25 disjdifr 4432 . . . . 5 ((𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∩ ((cls‘𝐽)‘𝑦)) = ∅
26 sseq0 4362 . . . . 5 ((((𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∩ 𝑦) ⊆ ((𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∩ ((cls‘𝐽)‘𝑦)) ∧ ((𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∩ ((cls‘𝐽)‘𝑦)) = ∅) → ((𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∩ 𝑦) = ∅)
2724, 25, 26sylancl 586 . . . 4 (((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴𝑋 ∧ ¬ 𝐴𝐶)) ∧ (𝑦𝐽 ∧ (𝐴𝑦 ∧ ((cls‘𝐽)‘𝑦) ⊆ (𝑋𝐶)))) → ((𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∩ 𝑦) = ∅)
28 sseq2 3970 . . . . . 6 (𝑥 = (𝑋 ∖ ((cls‘𝐽)‘𝑦)) → (𝐶𝑥𝐶 ⊆ (𝑋 ∖ ((cls‘𝐽)‘𝑦))))
29 ineq1 4172 . . . . . . 7 (𝑥 = (𝑋 ∖ ((cls‘𝐽)‘𝑦)) → (𝑥𝑦) = ((𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∩ 𝑦))
3029eqeq1d 2731 . . . . . 6 (𝑥 = (𝑋 ∖ ((cls‘𝐽)‘𝑦)) → ((𝑥𝑦) = ∅ ↔ ((𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∩ 𝑦) = ∅))
3128, 303anbi13d 1440 . . . . 5 (𝑥 = (𝑋 ∖ ((cls‘𝐽)‘𝑦)) → ((𝐶𝑥𝐴𝑦 ∧ (𝑥𝑦) = ∅) ↔ (𝐶 ⊆ (𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∧ 𝐴𝑦 ∧ ((𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∩ 𝑦) = ∅)))
3231rspcev 3585 . . . 4 (((𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∈ 𝐽 ∧ (𝐶 ⊆ (𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∧ 𝐴𝑦 ∧ ((𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∩ 𝑦) = ∅)) → ∃𝑥𝐽 (𝐶𝑥𝐴𝑦 ∧ (𝑥𝑦) = ∅))
3310, 19, 20, 27, 32syl13anc 1374 . . 3 (((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴𝑋 ∧ ¬ 𝐴𝐶)) ∧ (𝑦𝐽 ∧ (𝐴𝑦 ∧ ((cls‘𝐽)‘𝑦) ⊆ (𝑋𝐶)))) → ∃𝑥𝐽 (𝐶𝑥𝐴𝑦 ∧ (𝑥𝑦) = ∅))
34 simpl 482 . . . 4 ((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴𝑋 ∧ ¬ 𝐴𝐶)) → 𝐽 ∈ Reg)
35 simpr1 1195 . . . . 5 ((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴𝑋 ∧ ¬ 𝐴𝐶)) → 𝐶 ∈ (Clsd‘𝐽))
364cldopn 22951 . . . . 5 (𝐶 ∈ (Clsd‘𝐽) → (𝑋𝐶) ∈ 𝐽)
3735, 36syl 17 . . . 4 ((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴𝑋 ∧ ¬ 𝐴𝐶)) → (𝑋𝐶) ∈ 𝐽)
38 simpr2 1196 . . . . 5 ((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴𝑋 ∧ ¬ 𝐴𝐶)) → 𝐴𝑋)
39 simpr3 1197 . . . . 5 ((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴𝑋 ∧ ¬ 𝐴𝐶)) → ¬ 𝐴𝐶)
4038, 39eldifd 3922 . . . 4 ((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴𝑋 ∧ ¬ 𝐴𝐶)) → 𝐴 ∈ (𝑋𝐶))
41 regsep 23254 . . . 4 ((𝐽 ∈ Reg ∧ (𝑋𝐶) ∈ 𝐽𝐴 ∈ (𝑋𝐶)) → ∃𝑦𝐽 (𝐴𝑦 ∧ ((cls‘𝐽)‘𝑦) ⊆ (𝑋𝐶)))
4234, 37, 40, 41syl3anc 1373 . . 3 ((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴𝑋 ∧ ¬ 𝐴𝐶)) → ∃𝑦𝐽 (𝐴𝑦 ∧ ((cls‘𝐽)‘𝑦) ⊆ (𝑋𝐶)))
4333, 42reximddv 3149 . 2 ((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴𝑋 ∧ ¬ 𝐴𝐶)) → ∃𝑦𝐽𝑥𝐽 (𝐶𝑥𝐴𝑦 ∧ (𝑥𝑦) = ∅))
44 rexcom 3264 . 2 (∃𝑦𝐽𝑥𝐽 (𝐶𝑥𝐴𝑦 ∧ (𝑥𝑦) = ∅) ↔ ∃𝑥𝐽𝑦𝐽 (𝐶𝑥𝐴𝑦 ∧ (𝑥𝑦) = ∅))
4543, 44sylib 218 1 ((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴𝑋 ∧ ¬ 𝐴𝐶)) → ∃𝑥𝐽𝑦𝐽 (𝐶𝑥𝐴𝑦 ∧ (𝑥𝑦) = ∅))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 206  wa 395  w3a 1086   = wceq 1540  wcel 2109  wrex 3053  cdif 3908  cin 3910  wss 3911  c0 4292   cuni 4867  cfv 6499  Topctop 22813  Clsdccld 22936  clsccl 22938  Regcreg 23229
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-rep 5229  ax-sep 5246  ax-nul 5256  ax-pow 5315  ax-pr 5382  ax-un 7691
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-reu 3352  df-rab 3403  df-v 3446  df-sbc 3751  df-csb 3860  df-dif 3914  df-un 3916  df-in 3918  df-ss 3928  df-nul 4293  df-if 4485  df-pw 4561  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4868  df-int 4907  df-iun 4953  df-iin 4954  df-br 5103  df-opab 5165  df-mpt 5184  df-id 5526  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-iota 6452  df-fun 6501  df-fn 6502  df-f 6503  df-f1 6504  df-fo 6505  df-f1o 6506  df-fv 6507  df-top 22814  df-cld 22939  df-cls 22941  df-reg 23236
This theorem is referenced by:  isreg2  23297
  Copyright terms: Public domain W3C validator