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

Theorem regsep2 23341
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 23298 . . . . . . 7 (𝐽 ∈ Reg → 𝐽 ∈ Top)
21ad2antrr 727 . . . . . 6 (((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴𝑋 ∧ ¬ 𝐴𝐶)) ∧ (𝑦𝐽 ∧ (𝐴𝑦 ∧ ((cls‘𝐽)‘𝑦) ⊆ (𝑋𝐶)))) → 𝐽 ∈ Top)
3 elssuni 4882 . . . . . . . 8 (𝑦𝐽𝑦 𝐽)
4 t1sep.1 . . . . . . . 8 𝑋 = 𝐽
53, 4sseqtrrdi 3964 . . . . . . 7 (𝑦𝐽𝑦𝑋)
65ad2antrl 729 . . . . . 6 (((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴𝑋 ∧ ¬ 𝐴𝐶)) ∧ (𝑦𝐽 ∧ (𝐴𝑦 ∧ ((cls‘𝐽)‘𝑦) ⊆ (𝑋𝐶)))) → 𝑦𝑋)
74clscld 23012 . . . . . 6 ((𝐽 ∈ Top ∧ 𝑦𝑋) → ((cls‘𝐽)‘𝑦) ∈ (Clsd‘𝐽))
82, 6, 7syl2anc 585 . . . . 5 (((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴𝑋 ∧ ¬ 𝐴𝐶)) ∧ (𝑦𝐽 ∧ (𝐴𝑦 ∧ ((cls‘𝐽)‘𝑦) ⊆ (𝑋𝐶)))) → ((cls‘𝐽)‘𝑦) ∈ (Clsd‘𝐽))
94cldopn 22996 . . . . 5 (((cls‘𝐽)‘𝑦) ∈ (Clsd‘𝐽) → (𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∈ 𝐽)
108, 9syl 17 . . . 4 (((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴𝑋 ∧ ¬ 𝐴𝐶)) ∧ (𝑦𝐽 ∧ (𝐴𝑦 ∧ ((cls‘𝐽)‘𝑦) ⊆ (𝑋𝐶)))) → (𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∈ 𝐽)
11 simprrr 782 . . . . 5 (((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴𝑋 ∧ ¬ 𝐴𝐶)) ∧ (𝑦𝐽 ∧ (𝐴𝑦 ∧ ((cls‘𝐽)‘𝑦) ⊆ (𝑋𝐶)))) → ((cls‘𝐽)‘𝑦) ⊆ (𝑋𝐶))
124clsss3 23024 . . . . . . 7 ((𝐽 ∈ Top ∧ 𝑦𝑋) → ((cls‘𝐽)‘𝑦) ⊆ 𝑋)
132, 6, 12syl2anc 585 . . . . . 6 (((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴𝑋 ∧ ¬ 𝐴𝐶)) ∧ (𝑦𝐽 ∧ (𝐴𝑦 ∧ ((cls‘𝐽)‘𝑦) ⊆ (𝑋𝐶)))) → ((cls‘𝐽)‘𝑦) ⊆ 𝑋)
14 simplr1 1217 . . . . . . 7 (((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴𝑋 ∧ ¬ 𝐴𝐶)) ∧ (𝑦𝐽 ∧ (𝐴𝑦 ∧ ((cls‘𝐽)‘𝑦) ⊆ (𝑋𝐶)))) → 𝐶 ∈ (Clsd‘𝐽))
154cldss 22994 . . . . . . 7 (𝐶 ∈ (Clsd‘𝐽) → 𝐶𝑋)
1614, 15syl 17 . . . . . 6 (((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴𝑋 ∧ ¬ 𝐴𝐶)) ∧ (𝑦𝐽 ∧ (𝐴𝑦 ∧ ((cls‘𝐽)‘𝑦) ⊆ (𝑋𝐶)))) → 𝐶𝑋)
17 ssconb 4083 . . . . . 6 ((((cls‘𝐽)‘𝑦) ⊆ 𝑋𝐶𝑋) → (((cls‘𝐽)‘𝑦) ⊆ (𝑋𝐶) ↔ 𝐶 ⊆ (𝑋 ∖ ((cls‘𝐽)‘𝑦))))
1813, 16, 17syl2anc 585 . . . . 5 (((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴𝑋 ∧ ¬ 𝐴𝐶)) ∧ (𝑦𝐽 ∧ (𝐴𝑦 ∧ ((cls‘𝐽)‘𝑦) ⊆ (𝑋𝐶)))) → (((cls‘𝐽)‘𝑦) ⊆ (𝑋𝐶) ↔ 𝐶 ⊆ (𝑋 ∖ ((cls‘𝐽)‘𝑦))))
1911, 18mpbid 232 . . . 4 (((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴𝑋 ∧ ¬ 𝐴𝐶)) ∧ (𝑦𝐽 ∧ (𝐴𝑦 ∧ ((cls‘𝐽)‘𝑦) ⊆ (𝑋𝐶)))) → 𝐶 ⊆ (𝑋 ∖ ((cls‘𝐽)‘𝑦)))
20 simprrl 781 . . . 4 (((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴𝑋 ∧ ¬ 𝐴𝐶)) ∧ (𝑦𝐽 ∧ (𝐴𝑦 ∧ ((cls‘𝐽)‘𝑦) ⊆ (𝑋𝐶)))) → 𝐴𝑦)
214sscls 23021 . . . . . . 7 ((𝐽 ∈ Top ∧ 𝑦𝑋) → 𝑦 ⊆ ((cls‘𝐽)‘𝑦))
222, 6, 21syl2anc 585 . . . . . 6 (((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴𝑋 ∧ ¬ 𝐴𝐶)) ∧ (𝑦𝐽 ∧ (𝐴𝑦 ∧ ((cls‘𝐽)‘𝑦) ⊆ (𝑋𝐶)))) → 𝑦 ⊆ ((cls‘𝐽)‘𝑦))
23 sslin 4184 . . . . . 6 (𝑦 ⊆ ((cls‘𝐽)‘𝑦) → ((𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∩ 𝑦) ⊆ ((𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∩ ((cls‘𝐽)‘𝑦)))
2422, 23syl 17 . . . . 5 (((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴𝑋 ∧ ¬ 𝐴𝐶)) ∧ (𝑦𝐽 ∧ (𝐴𝑦 ∧ ((cls‘𝐽)‘𝑦) ⊆ (𝑋𝐶)))) → ((𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∩ 𝑦) ⊆ ((𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∩ ((cls‘𝐽)‘𝑦)))
25 disjdifr 4414 . . . . 5 ((𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∩ ((cls‘𝐽)‘𝑦)) = ∅
26 sseq0 4344 . . . . 5 ((((𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∩ 𝑦) ⊆ ((𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∩ ((cls‘𝐽)‘𝑦)) ∧ ((𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∩ ((cls‘𝐽)‘𝑦)) = ∅) → ((𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∩ 𝑦) = ∅)
2724, 25, 26sylancl 587 . . . 4 (((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴𝑋 ∧ ¬ 𝐴𝐶)) ∧ (𝑦𝐽 ∧ (𝐴𝑦 ∧ ((cls‘𝐽)‘𝑦) ⊆ (𝑋𝐶)))) → ((𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∩ 𝑦) = ∅)
28 sseq2 3949 . . . . . 6 (𝑥 = (𝑋 ∖ ((cls‘𝐽)‘𝑦)) → (𝐶𝑥𝐶 ⊆ (𝑋 ∖ ((cls‘𝐽)‘𝑦))))
29 ineq1 4154 . . . . . . 7 (𝑥 = (𝑋 ∖ ((cls‘𝐽)‘𝑦)) → (𝑥𝑦) = ((𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∩ 𝑦))
3029eqeq1d 2739 . . . . . 6 (𝑥 = (𝑋 ∖ ((cls‘𝐽)‘𝑦)) → ((𝑥𝑦) = ∅ ↔ ((𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∩ 𝑦) = ∅))
3128, 303anbi13d 1441 . . . . 5 (𝑥 = (𝑋 ∖ ((cls‘𝐽)‘𝑦)) → ((𝐶𝑥𝐴𝑦 ∧ (𝑥𝑦) = ∅) ↔ (𝐶 ⊆ (𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∧ 𝐴𝑦 ∧ ((𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∩ 𝑦) = ∅)))
3231rspcev 3565 . . . 4 (((𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∈ 𝐽 ∧ (𝐶 ⊆ (𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∧ 𝐴𝑦 ∧ ((𝑋 ∖ ((cls‘𝐽)‘𝑦)) ∩ 𝑦) = ∅)) → ∃𝑥𝐽 (𝐶𝑥𝐴𝑦 ∧ (𝑥𝑦) = ∅))
3310, 19, 20, 27, 32syl13anc 1375 . . 3 (((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴𝑋 ∧ ¬ 𝐴𝐶)) ∧ (𝑦𝐽 ∧ (𝐴𝑦 ∧ ((cls‘𝐽)‘𝑦) ⊆ (𝑋𝐶)))) → ∃𝑥𝐽 (𝐶𝑥𝐴𝑦 ∧ (𝑥𝑦) = ∅))
34 simpl 482 . . . 4 ((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴𝑋 ∧ ¬ 𝐴𝐶)) → 𝐽 ∈ Reg)
35 simpr1 1196 . . . . 5 ((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴𝑋 ∧ ¬ 𝐴𝐶)) → 𝐶 ∈ (Clsd‘𝐽))
364cldopn 22996 . . . . 5 (𝐶 ∈ (Clsd‘𝐽) → (𝑋𝐶) ∈ 𝐽)
3735, 36syl 17 . . . 4 ((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴𝑋 ∧ ¬ 𝐴𝐶)) → (𝑋𝐶) ∈ 𝐽)
38 simpr2 1197 . . . . 5 ((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴𝑋 ∧ ¬ 𝐴𝐶)) → 𝐴𝑋)
39 simpr3 1198 . . . . 5 ((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴𝑋 ∧ ¬ 𝐴𝐶)) → ¬ 𝐴𝐶)
4038, 39eldifd 3901 . . . 4 ((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴𝑋 ∧ ¬ 𝐴𝐶)) → 𝐴 ∈ (𝑋𝐶))
41 regsep 23299 . . . 4 ((𝐽 ∈ Reg ∧ (𝑋𝐶) ∈ 𝐽𝐴 ∈ (𝑋𝐶)) → ∃𝑦𝐽 (𝐴𝑦 ∧ ((cls‘𝐽)‘𝑦) ⊆ (𝑋𝐶)))
4234, 37, 40, 41syl3anc 1374 . . 3 ((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴𝑋 ∧ ¬ 𝐴𝐶)) → ∃𝑦𝐽 (𝐴𝑦 ∧ ((cls‘𝐽)‘𝑦) ⊆ (𝑋𝐶)))
4333, 42reximddv 3154 . 2 ((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴𝑋 ∧ ¬ 𝐴𝐶)) → ∃𝑦𝐽𝑥𝐽 (𝐶𝑥𝐴𝑦 ∧ (𝑥𝑦) = ∅))
44 rexcom 3267 . 2 (∃𝑦𝐽𝑥𝐽 (𝐶𝑥𝐴𝑦 ∧ (𝑥𝑦) = ∅) ↔ ∃𝑥𝐽𝑦𝐽 (𝐶𝑥𝐴𝑦 ∧ (𝑥𝑦) = ∅))
4543, 44sylib 218 1 ((𝐽 ∈ Reg ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐴𝑋 ∧ ¬ 𝐴𝐶)) → ∃𝑥𝐽𝑦𝐽 (𝐶𝑥𝐴𝑦 ∧ (𝑥𝑦) = ∅))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 206  wa 395  w3a 1087   = wceq 1542  wcel 2114  wrex 3062  cdif 3887  cin 3889  wss 3890  c0 4274   cuni 4851  cfv 6499  Topctop 22858  Clsdccld 22981  clsccl 22983  Regcreg 23274
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5213  ax-sep 5232  ax-nul 5242  ax-pow 5308  ax-pr 5376  ax-un 7689
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-reu 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-int 4891  df-iun 4936  df-iin 4937  df-br 5087  df-opab 5149  df-mpt 5168  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 6455  df-fun 6501  df-fn 6502  df-f 6503  df-f1 6504  df-fo 6505  df-f1o 6506  df-fv 6507  df-top 22859  df-cld 22984  df-cls 22986  df-reg 23281
This theorem is referenced by:  isreg2  23342
  Copyright terms: Public domain W3C validator