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

Theorem elon 2984
Description: An ordinal number is an ordinal set.
Hypothesis
Ref Expression
elon.1 |- A e. V
Assertion
Ref Expression
elon |- (A e. On <-> Ord A)

Proof of Theorem elon
StepHypRef Expression
1 elon.1 . 2 |- A e. V
2 elong 2983 . 2 |- (A e. V -> (A e. On <-> Ord A))
31, 2ax-mp 7 1 |- (A e. On <-> Ord A)
Colors of variables: wff set class
Syntax hints:   <-> wb 144   e. wcel 994  Vcvv 1857  Ord word 2974  Oncon0 2975
This theorem is referenced by:  tron 2998  onfr 3014  0elon 3026  ssorduni 3147  dfom2 3220  omsson 3223  rdglim2 4250  isfinite2 4692  r1ord 4801
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 998  ax-gen 999  ax-8 1000  ax-10 1002  ax-12 1004  ax-17 1007  ax-4 1009  ax-5o 1011  ax-6o 1014  ax-9o 1159  ax-10o 1177  ax-16 1247  ax-11o 1255  ax-ext 1500
This theorem depends on definitions:  df-bi 145  df-or 222  df-an 223  df-3an 783  df-ex 1017  df-sb 1209  df-clab 1506  df-cleq 1511  df-clel 1514  df-ral 1695  df-rex 1696  df-v 1858  df-dif 2101  df-un 2102  df-in 2103  df-ss 2105  df-nul 2333  df-sn 2470  df-pr 2471  df-op 2474  df-uni 2570  df-br 2693  df-tr 2755  df-po 2918  df-so 2929  df-fr 2947  df-we 2962  df-ord 2978  df-on 2979
Copyright terms: Public domain