HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem onne0 3039
Description: The class of all ordinal numbers in not empty.
Assertion
Ref Expression
onne0 |- On =/= (/)

Proof of Theorem onne0
StepHypRef Expression
1 0elon 3028 . 2 |- (/) e. On
2 ne0i 2289 . 2 |- ((/) e. On -> On =/= (/))
31, 2ax-mp 7 1 |- On =/= (/)
Colors of variables: wff set class
Syntax hints:   e. wcel 960   =/= wne 1588  (/)c0 2283  Oncon0 2954
This theorem is referenced by:  limon 3100
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 964  ax-gen 965  ax-8 966  ax-10 968  ax-11 969  ax-12 970  ax-14 972  ax-17 973  ax-4 975  ax-5o 977  ax-6o 980  ax-9o 1125  ax-10o 1142  ax-16 1212  ax-11o 1220  ax-ext 1462  ax-nul 2715
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-3an 779  df-ex 983  df-sb 1174  df-eu 1384  df-mo 1385  df-clab 1467  df-cleq 1472  df-clel 1475  df-ne 1590  df-ral 1652  df-rex 1653  df-v 1815  df-dif 2052  df-un 2053  df-in 2054  df-ss 2056  df-nul 2284  df-pw 2406  df-sn 2416  df-pr 2417  df-op 2420  df-uni 2508  df-br 2625  df-tr 2686  df-po 2846  df-so 2856  df-fr 2923  df-we 2940  df-ord 2957  df-on 2958
Copyright terms: Public domain