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

Theorem limelon 3036
Description: A limit ordinal class that is also a set is an ordinal number.
Assertion
Ref Expression
limelon |- ((A e. B /\ Lim A) -> A e. On)

Proof of Theorem limelon
StepHypRef Expression
1 elong 2983 . . 3 |- (A e. B -> (A e. On <-> Ord A))
2 limord 3032 . . 3 |- (Lim A -> Ord A)
31, 2syl5bir 208 . 2 |- (A e. B -> (Lim A -> A e. On))
43imp 348 1 |- ((A e. B /\ Lim A) -> A e. On)
Colors of variables: wff set class
Syntax hints:   -> wi 3   /\ wa 221   e. wcel 994  Ord word 2974  Oncon0 2975  Lim wlim 2976
This theorem is referenced by:  limuni3 3206  tfindsg2 3214  dfom2 3220  rdglim 4249  oalim 4303  omlim 4304  oelim 4305  oalimcl 4330  oaass 4331  omlimcl 4345  odi 4346  omass 4347  oen0 4349  oewordri 4355  oelim2 4358  r1pwcl 4833  alephordi 5024  cflim 5059
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  df-lim 2980
Copyright terms: Public domain