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

Theorem regsep 21944
Description: In a regular space, every neighborhood of a point contains a closed subneighborhood. (Contributed by Mario Carneiro, 25-Aug-2015.)
Assertion
Ref Expression
regsep ((𝐽 ∈ Reg ∧ 𝑈𝐽𝐴𝑈) → ∃𝑥𝐽 (𝐴𝑥 ∧ ((cls‘𝐽)‘𝑥) ⊆ 𝑈))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐽   𝑥,𝑈

Proof of Theorem regsep
Dummy variables 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 isreg 21942 . . . 4 (𝐽 ∈ Reg ↔ (𝐽 ∈ Top ∧ ∀𝑦𝐽𝑧𝑦𝑥𝐽 (𝑧𝑥 ∧ ((cls‘𝐽)‘𝑥) ⊆ 𝑦)))
2 sseq2 3995 . . . . . . . 8 (𝑦 = 𝑈 → (((cls‘𝐽)‘𝑥) ⊆ 𝑦 ↔ ((cls‘𝐽)‘𝑥) ⊆ 𝑈))
32anbi2d 630 . . . . . . 7 (𝑦 = 𝑈 → ((𝑧𝑥 ∧ ((cls‘𝐽)‘𝑥) ⊆ 𝑦) ↔ (𝑧𝑥 ∧ ((cls‘𝐽)‘𝑥) ⊆ 𝑈)))
43rexbidv 3299 . . . . . 6 (𝑦 = 𝑈 → (∃𝑥𝐽 (𝑧𝑥 ∧ ((cls‘𝐽)‘𝑥) ⊆ 𝑦) ↔ ∃𝑥𝐽 (𝑧𝑥 ∧ ((cls‘𝐽)‘𝑥) ⊆ 𝑈)))
54raleqbi1dv 3405 . . . . 5 (𝑦 = 𝑈 → (∀𝑧𝑦𝑥𝐽 (𝑧𝑥 ∧ ((cls‘𝐽)‘𝑥) ⊆ 𝑦) ↔ ∀𝑧𝑈𝑥𝐽 (𝑧𝑥 ∧ ((cls‘𝐽)‘𝑥) ⊆ 𝑈)))
65rspccv 3622 . . . 4 (∀𝑦𝐽𝑧𝑦𝑥𝐽 (𝑧𝑥 ∧ ((cls‘𝐽)‘𝑥) ⊆ 𝑦) → (𝑈𝐽 → ∀𝑧𝑈𝑥𝐽 (𝑧𝑥 ∧ ((cls‘𝐽)‘𝑥) ⊆ 𝑈)))
71, 6simplbiim 507 . . 3 (𝐽 ∈ Reg → (𝑈𝐽 → ∀𝑧𝑈𝑥𝐽 (𝑧𝑥 ∧ ((cls‘𝐽)‘𝑥) ⊆ 𝑈)))
8 eleq1 2902 . . . . . 6 (𝑧 = 𝐴 → (𝑧𝑥𝐴𝑥))
98anbi1d 631 . . . . 5 (𝑧 = 𝐴 → ((𝑧𝑥 ∧ ((cls‘𝐽)‘𝑥) ⊆ 𝑈) ↔ (𝐴𝑥 ∧ ((cls‘𝐽)‘𝑥) ⊆ 𝑈)))
109rexbidv 3299 . . . 4 (𝑧 = 𝐴 → (∃𝑥𝐽 (𝑧𝑥 ∧ ((cls‘𝐽)‘𝑥) ⊆ 𝑈) ↔ ∃𝑥𝐽 (𝐴𝑥 ∧ ((cls‘𝐽)‘𝑥) ⊆ 𝑈)))
1110rspccv 3622 . . 3 (∀𝑧𝑈𝑥𝐽 (𝑧𝑥 ∧ ((cls‘𝐽)‘𝑥) ⊆ 𝑈) → (𝐴𝑈 → ∃𝑥𝐽 (𝐴𝑥 ∧ ((cls‘𝐽)‘𝑥) ⊆ 𝑈)))
127, 11syl6 35 . 2 (𝐽 ∈ Reg → (𝑈𝐽 → (𝐴𝑈 → ∃𝑥𝐽 (𝐴𝑥 ∧ ((cls‘𝐽)‘𝑥) ⊆ 𝑈))))
13123imp 1107 1 ((𝐽 ∈ Reg ∧ 𝑈𝐽𝐴𝑈) → ∃𝑥𝐽 (𝐴𝑥 ∧ ((cls‘𝐽)‘𝑥) ⊆ 𝑈))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 398  w3a 1083   = wceq 1537  wcel 2114  wral 3140  wrex 3141  wss 3938  cfv 6357  Topctop 21503  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
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-clab 2802  df-cleq 2816  df-clel 2895  df-nfc 2965  df-ral 3145  df-rex 3146  df-rab 3149  df-v 3498  df-dif 3941  df-un 3943  df-in 3945  df-ss 3954  df-nul 4294  df-if 4470  df-sn 4570  df-pr 4572  df-op 4576  df-uni 4841  df-br 5069  df-iota 6316  df-fv 6365  df-reg 21926
This theorem is referenced by:  regsep2  21986  regr1lem  22349  kqreglem1  22351  kqreglem2  22352  reghmph  22403  cnextcn  22677
  Copyright terms: Public domain W3C validator