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

Theorem elong 2951
Description: An ordinal number is an ordinal set.
Assertion
Ref Expression
elong |- (A e. B -> (A e. On <-> Ord A))

Proof of Theorem elong
StepHypRef Expression
1 ordeq 2950 . 2 |- (x = A -> (Ord x <-> Ord A))
2 df-on 2947 . 2 |- On = {x | Ord x}
31, 2elab2g 1896 1 |- (A e. B -> (A e. On <-> Ord A))
Colors of variables: wff set class
Syntax hints:   -> wi 3   <-> wb 146   e. wcel 956  Ord word 2942  Oncon0 2943
This theorem is referenced by:  elon 2952  eloni 2953  elon2 2954  ordelon 2966  onin 2973  onprc 2984  ssonunit 2989  limelon 3027  ordsssuc2 3054  suceloni 3057  ordsuc 3060  onzsl 3112  oaabs 4242  ondomon 4836
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-12 966  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
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-3an 776  df-ex 979  df-sb 1170  df-clab 1462  df-cleq 1467  df-clel 1470  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-sn 2408  df-pr 2409  df-op 2412  df-uni 2499  df-br 2615  df-tr 2676  df-po 2835  df-so 2845  df-fr 2912  df-we 2929  df-ord 2946  df-on 2947
Copyright terms: Public domain