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

Theorem omon 3133
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.
Assertion
Ref Expression
omon |- (om e. On \/ om = On)

Proof of Theorem omon
StepHypRef Expression
1 ordom 3131 . 2 |- Ord om
2 ordeleqon 2980 . 2 |- (Ord om <-> (om e. On \/ om = On))
31, 2mpbi 189 1 |- (om e. On \/ om = On)
Colors of variables: wff set class
Syntax hints:   \/ wo 222   = wceq 953   e. wcel 955  Ord word 2937  Oncon0 2938  omcom 3121
This theorem is referenced by:  omelon 4601
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 959  ax-gen 960  ax-8 961  ax-10 963  ax-11 964  ax-12 965  ax-13 966  ax-14 967  ax-17 968  ax-4 970  ax-5o 972  ax-6o 975  ax-9o 1119  ax-10o 1136  ax-16 1206  ax-11o 1213  ax-ext 1452  ax-sep 2693  ax-pow 2732  ax-pr 2769  ax-un 2857
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-3or 774  df-3an 775  df-ex 978  df-sb 1168  df-eu 1375  df-mo 1376  df-clab 1457  df-cleq 1462  df-clel 1465  df-ne 1579  df-ral 1641  df-rex 1642  df-v 1803  df-dif 2039  df-un 2040  df-in 2041  df-ss 2043  df-nul 2271  df-pw 2392  df-sn 2402  df-pr 2403  df-tp 2405  df-op 2406  df-uni 2494  df-br 2610  df-opab 2657  df-tr 2671  df-eprel 2821  df-po 2831  df-so 2841  df-fr 2907  df-we 2924  df-ord 2941  df-on 2942  df-lim 2943  df-om 3122
Copyright terms: Public domain