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

Theorem elong 2962
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 2961 . 2 |- (x = A -> (Ord x <-> Ord A))
2 df-on 2958 . 2 |- On = {x | Ord x}
31, 2elab2g 1903 1 |- (A e. B -> (A e. On <-> Ord A))
Colors of variables: wff set class
Syntax hints:   -> wi 3   <-> wb 146   e. wcel 960  Ord word 2953  Oncon0 2954
This theorem is referenced by:  elon 2963  eloni 2964  elon2 2965  ordelon 2977  onin 2984  onprc 2995  ssonunit 3000  limelon 3038  ordsssuc2 3065  suceloni 3068  ordsuc 3071  onzsl 3123  oaabs 4258  ondomon 4867
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 964  ax-gen 965  ax-8 966  ax-10 968  ax-12 970  ax-17 973  ax-4 975  ax-5o 977  ax-6o 980  ax-9o 1125  ax-10o 1142  ax-16 1212  ax-11o 1220  ax-ext 1462
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-3an 779  df-ex 983  df-sb 1174  df-clab 1467  df-cleq 1472  df-clel 1475  df-ral 1652  df-rex 1653  df-v 1815  df-dif 2052  df-un 2053  df-in 2054  df-ss 2056  df-nul 2284  df-sn 2416  df-pr 2417  df-op 2420  df-uni 2508  df-br 2625  df-tr 2686  df-po 2846  df-so 2856  df-fr 2923  df-we 2940  df-ord 2957  df-on 2958
Copyright terms: Public domain