| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > 0top | Structured version Visualization version GIF version | ||
| Description: The singleton of the empty set is the only topology possible for an empty underlying set. (Contributed by NM, 9-Sep-2006.) |
| Ref | Expression |
|---|---|
| 0top | ⊢ (𝐽 ∈ Top → (∪ 𝐽 = ∅ ↔ 𝐽 = {∅})) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | olc 882 | . . 3 ⊢ (𝐽 = {∅} → (𝐽 = ∅ ∨ 𝐽 = {∅})) | |
| 2 | 0opn 23116 | . . . . . 6 ⊢ (𝐽 ∈ Top → ∅ ∈ 𝐽) | |
| 3 | n0i 4293 | . . . . . 6 ⊢ (∅ ∈ 𝐽 → ¬ 𝐽 = ∅) | |
| 4 | 2, 3 | syl 18 | . . . . 5 ⊢ (𝐽 ∈ Top → ¬ 𝐽 = ∅) |
| 5 | 4 | pm2.21d 122 | . . . 4 ⊢ (𝐽 ∈ Top → (𝐽 = ∅ → 𝐽 = {∅})) |
| 6 | idd 25 | . . . 4 ⊢ (𝐽 ∈ Top → (𝐽 = {∅} → 𝐽 = {∅})) | |
| 7 | 5, 6 | jaod 873 | . . 3 ⊢ (𝐽 ∈ Top → ((𝐽 = ∅ ∨ 𝐽 = {∅}) → 𝐽 = {∅})) |
| 8 | 1, 7 | impbid2 229 | . 2 ⊢ (𝐽 ∈ Top → (𝐽 = {∅} ↔ (𝐽 = ∅ ∨ 𝐽 = {∅}))) |
| 9 | uni0b 4901 | . . 3 ⊢ (∪ 𝐽 = ∅ ↔ 𝐽 ⊆ {∅}) | |
| 10 | sssn 4794 | . . 3 ⊢ (𝐽 ⊆ {∅} ↔ (𝐽 = ∅ ∨ 𝐽 = {∅})) | |
| 11 | 9, 10 | bitr2i 279 | . 2 ⊢ ((𝐽 = ∅ ∨ 𝐽 = {∅}) ↔ ∪ 𝐽 = ∅) |
| 12 | 8, 11 | bitr2di 291 | 1 ⊢ (𝐽 ∈ Top → (∪ 𝐽 = ∅ ↔ 𝐽 = {∅})) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∨ wo 861 = wceq 1570 ∈ wcel 2146 ⊆ wss 3906 ∅c0 4286 {csn 4591 ∪ cuni 4874 Topctop 23105 |
| 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 2148 ax-9 2156 ax-11 2195 ax-ext 2737 ax-sep 5259 |
| 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 2744 df-cleq 2757 df-clel 2840 df-ral 3082 df-rex 3092 df-rab 3419 df-v 3459 df-dif 3909 df-in 3913 df-ss 3923 df-nul 4287 df-pw 4566 df-sn 4592 df-uni 4875 df-top 23106 |
| This theorem is used by: locfinref 34300 |
| Copyright terms: Public domain | W3C validator |