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

Theorem onn0 6377
Description: The class of all ordinal numbers is not empty. (Contributed by NM, 17-Sep-1995.)
Assertion
Ref Expression
onn0 On ≠ ∅

Proof of Theorem onn0
StepHypRef Expression
1 0elon 6366 . 2 ∅ ∈ On
21ne0ii 4293 1 On ≠ ∅
Colors of variables: wff setvar class
Syntax hints:  wne 2929  c0 4282  Oncon0 6311
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-ext 2705  ax-nul 5246
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-sb 2068  df-clab 2712  df-cleq 2725  df-clel 2808  df-ne 2930  df-ral 3049  df-rex 3058  df-rab 3397  df-v 3439  df-dif 3901  df-un 3903  df-ss 3915  df-nul 4283  df-if 4475  df-pw 4551  df-sn 4576  df-pr 4578  df-op 4582  df-uni 4859  df-br 5094  df-tr 5201  df-po 5527  df-so 5528  df-fr 5572  df-we 5574  df-ord 6314  df-on 6315
This theorem is referenced by:  limon  7772
  Copyright terms: Public domain W3C validator