Theorem t1sncld 23551

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 23546	. . 3 ⊢ (𝐽 ∈ Fre ↔ (𝐽 ∈ Top ∧ ∀𝑥 ∈ 𝑋 {𝑥} ∈ (Clsd‘𝐽)))
3		sneq 4594	. . . . 5 ⊢ (𝑥 = 𝐴 → {𝑥} = {𝐴})
4	3	eleq1d 2845	. . . 4 ⊢ (𝑥 = 𝐴 → ({𝑥} ∈ (Clsd‘𝐽) ↔ {𝐴} ∈ (Clsd‘𝐽)))
5	4	rspccv 3573	. . 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 2145  ∀wral 3076  {csn 4584  ∪ cuni 4867  ‘cfv 6533  Topctop 23118  Clsdccld 23241  Frect1 23532

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 2147  ax-9 2155  ax-ext 2732

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 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-rab 3413  df-v 3452  df-dif 3902  df-un 3904  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-iota 6489  df-fv 6541  df-t1 23539

This theorem is used by:  cnt1  23575  lpcls  23589  sncld  23596  dnsconst  23603  t1connperf  23661  r0cld  23964  tgpt1  24344  sibfinima  34850  sibfof  34851