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

Theorem elon2 2965
Description: An ordinal number is an ordinal set.
Assertion
Ref Expression
elon2 |- (A e. On <-> (Ord A /\ A e. V))

Proof of Theorem elon2
StepHypRef Expression
1 eloni 2964 . . 3 |- (A e. On -> Ord A)
2 elisset 1820 . . 3 |- (A e. On -> A e. V)
31, 2jca 288 . 2 |- (A e. On -> (Ord A /\ A e. V))
4 elong 2962 . . 3 |- (A e. V -> (A e. On <-> Ord A))
54biimparc 421 . 2 |- ((Ord A /\ A e. V) -> A e. On)
63, 5impbi 157 1 |- (A e. On <-> (Ord A /\ A e. V))
Colors of variables: wff set class
Syntax hints:   <-> wb 146   /\ wa 223   e. wcel 960  Vcvv 1814  Ord word 2953  Oncon0 2954
This theorem is referenced by:  sucelon 3074
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