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

Theorem omon 3138
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 3136 . 2 |- Ord om
2 ordeleqon 2985 . 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 954   e. wcel 956  Ord word 2942  Oncon0 2943  omcom 3126
This theorem is referenced by:  omelon 4609
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 960  ax-gen 961  ax-8 962  ax-10 964  ax-11 965  ax-12 966  ax-13 967  ax-14 968  ax-17 969  ax-4 971  ax-5o 973  ax-6o 976  ax-9o 1121  ax-10o 1138  ax-16 1208  ax-11o 1216  ax-ext 1457  ax-sep 2698  ax-pow 2737  ax-pr 2774  ax-un 2861
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-3or 775  df-3an 776  df-ex 979  df-sb 1170  df-eu 1380  df-mo 1381  df-clab 1462  df-cleq 1467  df-clel 1470  df-ne 1584  df-ral 1646  df-rex 1647  df-v 1808  df-dif 2045  df-un 2046  df-in 2047  df-ss 2049  df-nul 2277  df-pw 2398  df-sn 2408  df-pr 2409  df-tp 2411  df-op 2412  df-uni 2499  df-br 2615  df-opab 2662  df-tr 2676  df-eprel 2827  df-po 2835  df-so 2845  df-fr 2912  df-we 2929  df-ord 2946  df-on 2947  df-lim 2948  df-om 3127
Copyright terms: Public domain