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

Theorem omon 7076
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 7074 . 2  |-  Ord  om
2 ordeleqon 6988 . 2  |-  ( Ord 
om 
<->  ( om  e.  On  \/  om  =  On ) )
31, 2mpbi 220 1  |-  ( om  e.  On  \/  om  =  On )
Colors of variables: wff setvar class
Syntax hints:    \/ wo 383    = wceq 1483    e. wcel 1990   Ord word 5722   Oncon0 5723   omcom 7065
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pr 4906  ax-un 6949
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1038  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-ral 2917  df-rex 2918  df-rab 2921  df-v 3202  df-sbc 3436  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-pss 3590  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-tp 4182  df-op 4184  df-uni 4437  df-br 4654  df-opab 4713  df-tr 4753  df-eprel 5029  df-po 5035  df-so 5036  df-fr 5073  df-we 5075  df-ord 5726  df-on 5727  df-lim 5728  df-suc 5729  df-om 7066
This theorem is referenced by:  omelon2  7077  infensuc  8138  elhf2  32282
  Copyright terms: Public domain W3C validator