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

Theorem 0opn 22879
Description: The empty set is an open subset of any topology. (Contributed by Stefan Allan, 27-Feb-2006.)
Assertion
Ref Expression
0opn (𝐽 ∈ Top → ∅ ∈ 𝐽)

Proof of Theorem 0opn
StepHypRef Expression
1 uni0 4879 . 2 ∅ = ∅
2 0ss 4341 . . 3 ∅ ⊆ 𝐽
3 uniopn 22872 . . 3 ((𝐽 ∈ Top ∧ ∅ ⊆ 𝐽) → ∅ ∈ 𝐽)
42, 3mpan2 692 . 2 (𝐽 ∈ Top → ∅ ∈ 𝐽)
51, 4eqeltrrid 2842 1 (𝐽 ∈ Top → ∅ ∈ 𝐽)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wcel 2114  wss 3890  c0 4274   cuni 4851  Topctop 22868
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-ext 2709  ax-sep 5231
This theorem depends on definitions:  df-bi 207  df-an 396  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-ral 3053  df-rex 3063  df-rab 3391  df-v 3432  df-dif 3893  df-in 3897  df-ss 3907  df-nul 4275  df-pw 4544  df-uni 4852  df-top 22869
This theorem is referenced by:  0ntop  22880  topgele  22905  tgclb  22945  0top  22958  en1top  22959  en2top  22960  topcld  23010  clsval2  23025  ntr0  23056  opnnei  23095  0nei  23103  restrcl  23132  rest0  23144  ordtrest2lem  23178  iocpnfordt  23190  icomnfordt  23191  cnindis  23267  isconn2  23389  kqtop  23720  mopn0  24473  locfinref  34001  ordtrest2NEWlem  34082  sxbrsigalem3  34432  cnambfre  38003
  Copyright terms: Public domain W3C validator