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

Theorem 0cld 22981
Description: The empty set is closed. Part of Theorem 6.1(1) of [Munkres] p. 93. (Contributed by NM, 4-Oct-2006.)
Assertion
Ref Expression
0cld (𝐽 ∈ Top → ∅ ∈ (Clsd‘𝐽))

Proof of Theorem 0cld
StepHypRef Expression
1 dif0 4319 . . 3 ( 𝐽 ∖ ∅) = 𝐽
21topopn 22849 . 2 (𝐽 ∈ Top → ( 𝐽 ∖ ∅) ∈ 𝐽)
3 0ss 4341 . . 3 ∅ ⊆ 𝐽
4 eqid 2737 . . . 4 𝐽 = 𝐽
54iscld2 22971 . . 3 ((𝐽 ∈ Top ∧ ∅ ⊆ 𝐽) → (∅ ∈ (Clsd‘𝐽) ↔ ( 𝐽 ∖ ∅) ∈ 𝐽))
63, 5mpan2 692 . 2 (𝐽 ∈ Top → (∅ ∈ (Clsd‘𝐽) ↔ ( 𝐽 ∖ ∅) ∈ 𝐽))
72, 6mpbird 257 1 (𝐽 ∈ Top → ∅ ∈ (Clsd‘𝐽))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wcel 2114  cdif 3887  wss 3890  c0 4274   cuni 4851  cfv 6490  Topctop 22836  Clsdccld 22959
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5231  ax-pow 5300  ax-pr 5368
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ral 3053  df-rex 3063  df-rab 3391  df-v 3432  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-br 5087  df-opab 5149  df-mpt 5168  df-id 5517  df-xp 5628  df-rel 5629  df-cnv 5630  df-co 5631  df-dm 5632  df-iota 6446  df-fun 6492  df-fv 6498  df-top 22837  df-cld 22962
This theorem is referenced by:  cls0  23023  indiscld  23034  iscldtop  23038  iccordt  23157  isconn2  23357  tgptsmscld  24094  mblfinlem2  37970  mblfinlem3  37971  ismblfin  37973
  Copyright terms: Public domain W3C validator