Theorem t1sncld 23513

Description: In a T₁ space, singletons are closed. (Contributed by Jeff Hankins, 1-Feb-2010.)

Hypothesis

Ref	Expression
ist0.1	⊢ 𝑋 = ∪ 𝐽

Assertion

Ref	Expression
t1sncld	⊢ ((𝐽 ∈ Fre ∧ 𝐴 ∈ 𝑋) → {𝐴} ∈ (Clsd‘𝐽))

Proof of Theorem t1sncld

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		ist0.1	. . . 4 ⊢ 𝑋 = ∪ 𝐽
2	1	ist1 23508	. . 3 ⊢ (𝐽 ∈ Fre ↔ (𝐽 ∈ Top ∧ ∀𝑥 ∈ 𝑋 {𝑥} ∈ (Clsd‘𝐽)))
3		sneq 4601	. . . . 5 ⊢ (𝑥 = 𝐴 → {𝑥} = {𝐴})
4	3	eleq1d 2850	. . . 4 ⊢ (𝑥 = 𝐴 → ({𝑥} ∈ (Clsd‘𝐽) ↔ {𝐴} ∈ (Clsd‘𝐽)))
5	4	rspccv 3580	. . 3 ⊢ (∀𝑥 ∈ 𝑋 {𝑥} ∈ (Clsd‘𝐽) → (𝐴 ∈ 𝑋 → {𝐴} ∈ (Clsd‘𝐽)))
6	2, 5	simplbiim 514	. 2 ⊢ (𝐽 ∈ Fre → (𝐴 ∈ 𝑋 → {𝐴} ∈ (Clsd‘𝐽)))
7	6	imp 412	1 ⊢ ((𝐽 ∈ Fre ∧ 𝐴 ∈ 𝑋) → {𝐴} ∈ (Clsd‘𝐽))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2146  ∀wral 3081  {csn 4591  ∪ cuni 4874  ‘cfv 6540  Topctop 23080  Clsdccld 23203  Frect1 23494

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-ext 2737

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2744  df-cleq 2757  df-clel 2840  df-ral 3082  df-rab 3419  df-v 3459  df-dif 3909  df-un 3911  df-ss 3923  df-nul 4287  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-br 5112  df-iota 6496  df-fv 6548  df-t1 23501

This theorem is used by:  cnt1  23537  lpcls  23551  sncld  23558  dnsconst  23565  t1connperf  23623  r0cld  23926  tgpt1  24306  sibfinima  34770  sibfof  34771