Theorem regsep 23395

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.

Step	Hyp	Ref	Expression
1		isreg 23393	. . . 4 ⊢ (𝐽 ∈ Reg ↔ (𝐽 ∈ Top ∧ ∀𝑦 ∈ 𝐽 ∀𝑧 ∈ 𝑦 ∃𝑥 ∈ 𝐽 (𝑧 ∈ 𝑥 ∧ ((cls‘𝐽)‘𝑥) ⊆ 𝑦)))
2		sseq2 3963	. . . . . . . 8 ⊢ (𝑦 = 𝑈 → (((cls‘𝐽)‘𝑥) ⊆ 𝑦 ↔ ((cls‘𝐽)‘𝑥) ⊆ 𝑈))
3	2	anbi2d 639	. . . . . . 7 ⊢ (𝑦 = 𝑈 → ((𝑧 ∈ 𝑥 ∧ ((cls‘𝐽)‘𝑥) ⊆ 𝑦) ↔ (𝑧 ∈ 𝑥 ∧ ((cls‘𝐽)‘𝑥) ⊆ 𝑈)))
4	3	rexbidv 3187	. . . . . 6 ⊢ (𝑦 = 𝑈 → (∃𝑥 ∈ 𝐽 (𝑧 ∈ 𝑥 ∧ ((cls‘𝐽)‘𝑥) ⊆ 𝑦) ↔ ∃𝑥 ∈ 𝐽 (𝑧 ∈ 𝑥 ∧ ((cls‘𝐽)‘𝑥) ⊆ 𝑈)))
5	4	raleqbi1dv 3331	. . . . 5 ⊢ (𝑦 = 𝑈 → (∀𝑧 ∈ 𝑦 ∃𝑥 ∈ 𝐽 (𝑧 ∈ 𝑥 ∧ ((cls‘𝐽)‘𝑥) ⊆ 𝑦) ↔ ∀𝑧 ∈ 𝑈 ∃𝑥 ∈ 𝐽 (𝑧 ∈ 𝑥 ∧ ((cls‘𝐽)‘𝑥) ⊆ 𝑈)))
6	5	rspccv 3579	. . . 4 ⊢ (∀𝑦 ∈ 𝐽 ∀𝑧 ∈ 𝑦 ∃𝑥 ∈ 𝐽 (𝑧 ∈ 𝑥 ∧ ((cls‘𝐽)‘𝑥) ⊆ 𝑦) → (𝑈 ∈ 𝐽 → ∀𝑧 ∈ 𝑈 ∃𝑥 ∈ 𝐽 (𝑧 ∈ 𝑥 ∧ ((cls‘𝐽)‘𝑥) ⊆ 𝑈)))
7	1, 6	simplbiim 512	. . 3 ⊢ (𝐽 ∈ Reg → (𝑈 ∈ 𝐽 → ∀𝑧 ∈ 𝑈 ∃𝑥 ∈ 𝐽 (𝑧 ∈ 𝑥 ∧ ((cls‘𝐽)‘𝑥) ⊆ 𝑈)))
8		eleq1 2851	. . . . . 6 ⊢ (𝑧 = 𝐴 → (𝑧 ∈ 𝑥 ↔ 𝐴 ∈ 𝑥))
9	8	anbi1d 640	. . . . 5 ⊢ (𝑧 = 𝐴 → ((𝑧 ∈ 𝑥 ∧ ((cls‘𝐽)‘𝑥) ⊆ 𝑈) ↔ (𝐴 ∈ 𝑥 ∧ ((cls‘𝐽)‘𝑥) ⊆ 𝑈)))
10	9	rexbidv 3187	. . . 4 ⊢ (𝑧 = 𝐴 → (∃𝑥 ∈ 𝐽 (𝑧 ∈ 𝑥 ∧ ((cls‘𝐽)‘𝑥) ⊆ 𝑈) ↔ ∃𝑥 ∈ 𝐽 (𝐴 ∈ 𝑥 ∧ ((cls‘𝐽)‘𝑥) ⊆ 𝑈)))
11	10	rspccv 3579	. . 3 ⊢ (∀𝑧 ∈ 𝑈 ∃𝑥 ∈ 𝐽 (𝑧 ∈ 𝑥 ∧ ((cls‘𝐽)‘𝑥) ⊆ 𝑈) → (𝐴 ∈ 𝑈 → ∃𝑥 ∈ 𝐽 (𝐴 ∈ 𝑥 ∧ ((cls‘𝐽)‘𝑥) ⊆ 𝑈)))
12	7, 11	syl6 35	. 2 ⊢ (𝐽 ∈ Reg → (𝑈 ∈ 𝐽 → (𝐴 ∈ 𝑈 → ∃𝑥 ∈ 𝐽 (𝐴 ∈ 𝑥 ∧ ((cls‘𝐽)‘𝑥) ⊆ 𝑈))))
13	12	3imp 1124	1 ⊢ ((𝐽 ∈ Reg ∧ 𝑈 ∈ 𝐽 ∧ 𝐴 ∈ 𝑈) → ∃𝑥 ∈ 𝐽 (𝐴 ∈ 𝑥 ∧ ((cls‘𝐽)‘𝑥) ⊆ 𝑈))

Syntax hints:   → wi 4   ∧ wa 399   ∧ w3a 1099   = wceq 1561   ∈ wcel 2143  ∀wral 3077  ∃wrex 3087   ⊆ wss 3905  ‘cfv 6522  Topctop 22954  clsccl 23079  Regcreg 23370

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1816  ax-4 1830  ax-5 1931  ax-6 1988  ax-7 2029  ax-8 2145  ax-9 2153  ax-ext 2735

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1101  df-tru 1564  df-fal 1574  df-ex 1801  df-sb 2092  df-clab 2742  df-cleq 2755  df-clel 2838  df-ral 3078  df-rex 3088  df-rab 3416  df-v 3457  df-dif 3908  df-un 3910  df-ss 3922  df-nul 4287  df-if 4482  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-br 5102  df-iota 6478  df-fv 6530  df-reg 23377

This theorem is referenced by:  regsep2  23437  regr1lem  23800  kqreglem1  23802  kqreglem2  23803  reghmph  23854  cnextcn  24128