| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > 0opn | Structured version Visualization version GIF version | ||
| Description: The empty set is an open subset of any topology. (Contributed by Stefan Allan, 27-Feb-2006.) |
| Ref | Expression |
|---|---|
| 0opn | ⊢ (𝐽 ∈ Top → ∅ ∈ 𝐽) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | uni0 4901 | . 2 ⊢ ∪ ∅ = ∅ | |
| 2 | 0ss 4353 | . . 3 ⊢ ∅ ⊆ 𝐽 | |
| 3 | uniopn 23270 | . . 3 ⊢ ((𝐽 ∈ Top ∧ ∅ ⊆ 𝐽) → ∪ ∅ ∈ 𝐽) | |
| 4 | 2, 3 | mpan2 704 | . 2 ⊢ (𝐽 ∈ Top → ∪ ∅ ∈ 𝐽) |
| 5 | 1, 4 | eqeltrrid 2869 | 1 ⊢ (𝐽 ∈ Top → ∅ ∈ 𝐽) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∈ wcel 2147 ⊆ wss 3900 ∅c0 4281 ∪ cuni 4872 Topctop 23266 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-ext 2735 ax-sep 5255 |
| This proof depends on definitions: df-bi 210 df-an 402 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2102 df-clab 2742 df-cleq 2755 df-clel 2839 df-ral 3081 df-rex 3091 df-rab 3417 df-v 3456 df-ss 3901 df-dif 4050 df-in 4094 df-nul 4282 df-pw 4562 df-uni 4873 df-top 23267 |
| This theorem is used by: 0ntop 23278 topgele 23303 tgclb 23343 0top 23356 en1top 23357 en2top 23358 topcld 23408 clsval2 23423 ntr0 23454 opnnei 23493 0nei 23501 restrcl 23530 rest0 23542 ordtrest2lem 23576 iocpnfordt 23588 icomnfordt 23589 cnindis 23665 isconn2 23787 kqtop 24119 mopn0 24872 locfinref 34584 ordtrest2NEWlem 34665 sxbrsigalem3 35015 cnambfre 38854 |
| Copyright terms: Public domain | W3C validator |