Theorem t1sncld 23650

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 23645	. . 3 ⊢ (𝐽 ∈ Fre ↔ (𝐽 ∈ Top ∧ ∀𝑥 ∈ 𝑋 {𝑥} ∈ (Clsd‘𝐽)))
3		sneq 4590	. . . . 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 1569   ∈ wcel 2144  ∀wral 3076  {csn 4584  ∪ cuni 4866  ‘cfv 6539  Topctop 23217  Clsdccld 23340  Frect1 23631

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-rab 3413  df-v 3452  df-ss 3896  df-dif 4047  df-un 4151  df-nul 4279  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-iota 6494  df-fv 6547  df-t1 23638

This theorem is used by:  cnt1  23674  lpcls  23688  sncld  23695  dnsconst  23702  t1connperf  23760  r0cld  24063  tgpt1  24443  sibfinima  35018  sibfof  35019