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

Theorem 0opn 22869
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 4878 . 2 ∅ = ∅
2 0ss 4340 . . 3 ∅ ⊆ 𝐽
3 uniopn 22862 . . 3 ((𝐽 ∈ Top ∧ ∅ ⊆ 𝐽) → ∅ ∈ 𝐽)
42, 3mpan2 692 . 2 (𝐽 ∈ Top → ∅ ∈ 𝐽)
51, 4eqeltrrid 2841 1 (𝐽 ∈ Top → ∅ ∈ 𝐽)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wcel 2114  wss 3889  c0 4273   cuni 4850  Topctop 22858
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 2708  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 2715  df-cleq 2728  df-clel 2811  df-ral 3052  df-rex 3062  df-rab 3390  df-v 3431  df-dif 3892  df-in 3896  df-ss 3906  df-nul 4274  df-pw 4543  df-uni 4851  df-top 22859
This theorem is referenced by:  0ntop  22870  topgele  22895  tgclb  22935  0top  22948  en1top  22949  en2top  22950  topcld  23000  clsval2  23015  ntr0  23046  opnnei  23085  0nei  23093  restrcl  23122  rest0  23134  ordtrest2lem  23168  iocpnfordt  23180  icomnfordt  23181  cnindis  23257  isconn2  23379  kqtop  23710  mopn0  24463  locfinref  33985  ordtrest2NEWlem  34066  sxbrsigalem3  34416  cnambfre  37989
  Copyright terms: Public domain W3C validator