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

Theorem nlimon 3205
Description: Two ways to express the class of non-limit ordinal numbers. Part of Definition 7.27 of [TakeutiZaring] p. 42, who use the symbol KI for this class.
Assertion
Ref Expression
nlimon |- {x e. On | (x = (/) \/ E.y e. On x = suc y)} = {x e. On | -. Lim x}
Distinct variable group:   x,y

Proof of Theorem nlimon
StepHypRef Expression
1 eloni 2985 . . 3 |- (x e. On -> Ord x)
2 dflim3 3201 . . . . 5 |- (Lim x <-> (Ord x /\ -. (x = (/) \/ E.y e. On x = suc y)))
32baib 689 . . . 4 |- (Ord x -> (Lim x <-> -. (x = (/) \/ E.y e. On x = suc y)))
43con2bid 529 . . 3 |- (Ord x -> ((x = (/) \/ E.y e. On x = suc y) <-> -. Lim x))
51, 4syl 10 . 2 |- (x e. On -> ((x = (/) \/ E.y e. On x = suc y) <-> -. Lim x))
65rabbii 1851 1 |- {x e. On | (x = (/) \/ E.y e. On x = suc y)} = {x e. On | -. Lim x}
Colors of variables: wff set class
Syntax hints:  -. wn 2   <-> wb 144   \/ wo 220   = wceq 992   e. wcel 994  E.wrex 1692  {crab 1694  (/)c0 2332  Ord word 2974  Oncon0 2975  Lim wlim 2976  suc csuc 2977
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-11 1003  ax-12 1004  ax-13 1005  ax-14 1006  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  ax-sep 2777  ax-nul 2784  ax-pow 2818  ax-pr 2855  ax-un 3089
This theorem depends on definitions:  df-bi 145  df-or 222  df-an 223  df-3or 782  df-3an 783  df-ex 1017  df-sb 1209  df-eu 1421  df-mo 1422  df-clab 1506  df-cleq 1511  df-clel 1514  df-ne 1630  df-ral 1695  df-rex 1696  df-rab 1698  df-v 1858  df-dif 2101  df-un 2102  df-in 2103  df-ss 2105  df-nul 2333  df-if 2416  df-pw 2459  df-sn 2470  df-pr 2471  df-tp 2473  df-op 2474  df-uni 2570  df-br 2693  df-opab 2741  df-tr 2755  df-eprel 2910  df-po 2918  df-so 2929  df-fr 2947  df-we 2962  df-ord 2978  df-on 2979  df-lim 2980  df-suc 2981
Copyright terms: Public domain