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

Theorem onn0 6250
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 6239 . 2 ∅ ∈ On
21ne0ii 4303 1 On ≠ ∅
Colors of variables: wff setvar class
Syntax hints:  wne 3016  c0 4291  Oncon0 6186
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2156  ax-12 2172  ax-ext 2793  ax-nul 5203
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-ral 3143  df-rex 3144  df-rab 3147  df-v 3497  df-dif 3939  df-in 3943  df-ss 3952  df-nul 4292  df-pw 4541  df-uni 4833  df-tr 5166  df-po 5469  df-so 5470  df-fr 5509  df-we 5511  df-ord 6189  df-on 6190
This theorem is referenced by:  limon  7545
  Copyright terms: Public domain W3C validator