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

Theorem elong 2956
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 2955 . 2 |- (x = A -> (Ord x <-> Ord A))
2 df-on 2952 . 2 |- On = {x | Ord x}
31, 2elab2g 1900 1 |- (A e. B -> (A e. On <-> Ord A))
Colors of variables: wff set class
Syntax hints:   -> wi 3   <-> wb 146   e. wcel 958  Ord word 2947  Oncon0 2948
This theorem is referenced by:  elon 2957  eloni 2958  elon2 2959  ordelon 2971  onin 2978  onprc 2989  ssonunit 2994  limelon 3032  ordsssuc2 3059  suceloni 3062  ordsuc 3065  onzsl 3117  oaabs 4252  ondomon 4856
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 962  ax-gen 963  ax-8 964  ax-10 966  ax-12 968  ax-17 971  ax-4 973  ax-5o 975  ax-6o 978  ax-9o 1123  ax-10o 1140  ax-16 1210  ax-11o 1218  ax-ext 1459
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-3an 777  df-ex 981  df-sb 1172  df-clab 1464  df-cleq 1469  df-clel 1472  df-ral 1649  df-rex 1650  df-v 1812  df-dif 2049  df-un 2050  df-in 2051  df-ss 2053  df-nul 2281  df-sn 2412  df-pr 2413  df-op 2416  df-uni 2504  df-br 2620  df-tr 2681  df-po 2840  df-so 2850  df-fr 2917  df-we 2934  df-ord 2951  df-on 2952
Copyright terms: Public domain