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

Theorem onn0 6408
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 6397 . 2 ∅ ∈ On
21ne0ii 4296 1 On ≠ ∅
Colors of variables: wff setvar class
Syntax hints:  wne 2956  c0 4285  Oncon0 6342
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-ext 2733  ax-nul 5255
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-sb 2090  df-clab 2740  df-cleq 2753  df-clel 2836  df-ne 2957  df-ral 3076  df-rex 3086  df-rab 3414  df-v 3455  df-dif 3907  df-un 3909  df-ss 3921  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4582  df-pr 4584  df-op 4588  df-uni 4865  df-br 5100  df-tr 5207  df-po 5553  df-so 5554  df-fr 5598  df-we 5600  df-ord 6345  df-on 6346
This theorem is referenced by:  limon  7812
  Copyright terms: Public domain W3C validator