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

Theorem 0top 23149
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 881 . . 3 (𝐽 = {∅} → (𝐽 = ∅ ∨ 𝐽 = {∅}))
2 0opn 23070 . . . . . 6 (𝐽 ∈ Top → ∅ ∈ 𝐽)
3 n0i 4293 . . . . . 6 (∅ ∈ 𝐽 → ¬ 𝐽 = ∅)
42, 3syl 18 . . . . 5 (𝐽 ∈ Top → ¬ 𝐽 = ∅)
54pm2.21d 122 . . . 4 (𝐽 ∈ Top → (𝐽 = ∅ → 𝐽 = {∅}))
6 idd 25 . . . 4 (𝐽 ∈ Top → (𝐽 = {∅} → 𝐽 = {∅}))
75, 6jaod 872 . . 3 (𝐽 ∈ Top → ((𝐽 = ∅ ∨ 𝐽 = {∅}) → 𝐽 = {∅}))
81, 7impbid2 229 . 2 (𝐽 ∈ Top → (𝐽 = {∅} ↔ (𝐽 = ∅ ∨ 𝐽 = {∅})))
9 uni0b 4899 . . 3 ( 𝐽 = ∅ ↔ 𝐽 ⊆ {∅})
10 sssn 4792 . . 3 (𝐽 ⊆ {∅} ↔ (𝐽 = ∅ ∨ 𝐽 = {∅}))
119, 10bitr2i 279 . 2 ((𝐽 = ∅ ∨ 𝐽 = {∅}) ↔ 𝐽 = ∅)
128, 11bitr2di 291 1 (𝐽 ∈ Top → ( 𝐽 = ∅ ↔ 𝐽 = {∅}))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3  wi 4  wb 209  wo 860   = wceq 1570  wcel 2143  wss 3905  c0 4286  {csn 4589   cuni 4872  Topctop 23059
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-11 2192  ax-ext 2735  ax-sep 5257
This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-sb 2097  df-clab 2742  df-cleq 2755  df-clel 2838  df-ral 3080  df-rex 3090  df-rab 3417  df-v 3457  df-dif 3908  df-in 3912  df-ss 3922  df-nul 4287  df-pw 4564  df-sn 4590  df-uni 4873  df-top 23060
This theorem is used by:  locfinref  34240
  Copyright terms: Public domain W3C validator