MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  omon Unicode version

Theorem omon 4683
Description: The class of natural numbers  om is either an ordinal number (if we accept the Axiom of Infinity) or the proper class of all ordinal numbers (if we deny the Axiom of Infinity). Remark in [TakeutiZaring] p. 43. (Contributed by NM, 10-May-1998.)
Assertion
Ref Expression
omon  |-  ( om  e.  On  \/  om  =  On )

Proof of Theorem omon
StepHypRef Expression
1 ordom 4681 . 2  |-  Ord  om
2 ordeleqon 4596 . 2  |-  ( Ord 
om 
<->  ( om  e.  On  \/  om  =  On ) )
31, 2mpbi 199 1  |-  ( om  e.  On  \/  om  =  On )
Colors of variables: wff set class
Syntax hints:    \/ wo 357    = wceq 1632    e. wcel 1696   Ord word 4407   Oncon0 4408   omcom 4672
This theorem is referenced by:  omelon2  4684  infensuc  7055  elhf2  24877
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1536  ax-5 1547  ax-17 1606  ax-9 1644  ax-8 1661  ax-13 1698  ax-14 1700  ax-6 1715  ax-7 1720  ax-11 1727  ax-12 1878  ax-ext 2277  ax-sep 4157  ax-nul 4165  ax-pr 4230  ax-un 4528
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3or 935  df-3an 936  df-tru 1310  df-ex 1532  df-nf 1535  df-sb 1639  df-eu 2160  df-mo 2161  df-clab 2283  df-cleq 2289  df-clel 2292  df-nfc 2421  df-ne 2461  df-ral 2561  df-rex 2562  df-rab 2565  df-v 2803  df-sbc 3005  df-dif 3168  df-un 3170  df-in 3172  df-ss 3179  df-pss 3181  df-nul 3469  df-if 3579  df-sn 3659  df-pr 3660  df-tp 3661  df-op 3662  df-uni 3844  df-br 4040  df-opab 4094  df-tr 4130  df-eprel 4321  df-po 4330  df-so 4331  df-fr 4368  df-we 4370  df-ord 4411  df-on 4412  df-lim 4413  df-suc 4414  df-om 4673
  Copyright terms: Public domain W3C validator