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

Theorem onn0 6398
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 6387 . 2 ∅ ∈ On
21ne0ii 4307 1 On ≠ ∅
Colors of variables: wff setvar class
Syntax hints:  wne 2925  c0 4296  Oncon0 6332
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-ext 2701  ax-nul 5261
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-sb 2066  df-clab 2708  df-cleq 2721  df-clel 2803  df-ne 2926  df-ral 3045  df-rex 3054  df-rab 3406  df-v 3449  df-dif 3917  df-un 3919  df-ss 3931  df-nul 4297  df-if 4489  df-pw 4565  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4872  df-br 5108  df-tr 5215  df-po 5546  df-so 5547  df-fr 5591  df-we 5593  df-ord 6335  df-on 6336
This theorem is referenced by:  limon  7811
  Copyright terms: Public domain W3C validator