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

Theorem 0top 21567
Description: The singleton of the empty set is the only topology possible for an empty underlying set. (Contributed by NM, 9-Sep-2006.)
Assertion
Ref Expression
0top (𝐽 ∈ Top → ( 𝐽 = ∅ ↔ 𝐽 = {∅}))

Proof of Theorem 0top
StepHypRef Expression
1 olc 865 . . 3 (𝐽 = {∅} → (𝐽 = ∅ ∨ 𝐽 = {∅}))
2 0opn 21488 . . . . . 6 (𝐽 ∈ Top → ∅ ∈ 𝐽)
3 n0i 4272 . . . . . 6 (∅ ∈ 𝐽 → ¬ 𝐽 = ∅)
42, 3syl 17 . . . . 5 (𝐽 ∈ Top → ¬ 𝐽 = ∅)
54pm2.21d 121 . . . 4 (𝐽 ∈ Top → (𝐽 = ∅ → 𝐽 = {∅}))
6 idd 24 . . . 4 (𝐽 ∈ Top → (𝐽 = {∅} → 𝐽 = {∅}))
75, 6jaod 856 . . 3 (𝐽 ∈ Top → ((𝐽 = ∅ ∨ 𝐽 = {∅}) → 𝐽 = {∅}))
81, 7impbid2 229 . 2 (𝐽 ∈ Top → (𝐽 = {∅} ↔ (𝐽 = ∅ ∨ 𝐽 = {∅})))
9 uni0b 4837 . . 3 ( 𝐽 = ∅ ↔ 𝐽 ⊆ {∅})
10 sssn 4732 . . 3 (𝐽 ⊆ {∅} ↔ (𝐽 = ∅ ∨ 𝐽 = {∅}))
119, 10bitr2i 279 . 2 ((𝐽 = ∅ ∨ 𝐽 = {∅}) ↔ 𝐽 = ∅)
128, 11syl6rbb 291 1 (𝐽 ∈ Top → ( 𝐽 = ∅ ↔ 𝐽 = {∅}))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 209  wo 844   = wceq 1538  wcel 2115  wss 3910  c0 4266  {csn 4540   cuni 4811  Topctop 21477
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 1971  ax-7 2016  ax-8 2117  ax-9 2125  ax-10 2146  ax-11 2162  ax-12 2178  ax-ext 2793  ax-sep 5176
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2071  df-clab 2800  df-cleq 2814  df-clel 2892  df-nfc 2960  df-ral 3131  df-rex 3132  df-rab 3135  df-v 3473  df-dif 3913  df-in 3917  df-ss 3927  df-nul 4267  df-pw 4514  df-sn 4541  df-uni 4812  df-top 21478
This theorem is referenced by:  locfinref  31116
  Copyright terms: Public domain W3C validator