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

Theorem omon 6941
Description: The class of natural numbers ω 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 (ω ∈ On ∨ ω = On)

Proof of Theorem omon
StepHypRef Expression
1 ordom 6939 . 2 Ord ω
2 ordeleqon 6853 . 2 (Ord ω ↔ (ω ∈ On ∨ ω = On))
31, 2mpbi 218 1 (ω ∈ On ∨ ω = On)
Colors of variables: wff setvar class
Syntax hints:  wo 381   = wceq 1474  wcel 1975  Ord word 5621  Oncon0 5622  ωcom 6930
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1711  ax-4 1726  ax-5 1825  ax-6 1873  ax-7 1920  ax-8 1977  ax-9 1984  ax-10 2004  ax-11 2019  ax-12 2031  ax-13 2228  ax-ext 2585  ax-sep 4699  ax-nul 4708  ax-pr 4824  ax-un 6820
This theorem depends on definitions:  df-bi 195  df-or 383  df-an 384  df-3or 1031  df-3an 1032  df-tru 1477  df-ex 1695  df-nf 1700  df-sb 1866  df-eu 2457  df-mo 2458  df-clab 2592  df-cleq 2598  df-clel 2601  df-nfc 2735  df-ne 2777  df-ral 2896  df-rex 2897  df-rab 2900  df-v 3170  df-sbc 3398  df-dif 3538  df-un 3540  df-in 3542  df-ss 3549  df-pss 3551  df-nul 3870  df-if 4032  df-sn 4121  df-pr 4123  df-tp 4125  df-op 4127  df-uni 4363  df-br 4574  df-opab 4634  df-tr 4671  df-eprel 4935  df-po 4945  df-so 4946  df-fr 4983  df-we 4985  df-ord 5625  df-on 5626  df-lim 5627  df-suc 5628  df-om 6931
This theorem is referenced by:  omelon2  6942  infensuc  7996  elhf2  31254
  Copyright terms: Public domain W3C validator