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

Theorem 0ellim 3031
Description: A limit ordinal contains the empty set.
Assertion
Ref Expression
0ellim |- (Lim A -> (/) e. A)

Proof of Theorem 0ellim
StepHypRef Expression
1 nlim0 3027 . . . 4 |- -. Lim (/)
2 limeq 2960 . . . 4 |- (A = (/) -> (Lim A <-> Lim (/)))
31, 2mtbiri 717 . . 3 |- (A = (/) -> -. Lim A)
43necon2ai 1611 . 2 |- (Lim A -> A =/= (/))
5 limord 3028 . . 3 |- (Lim A -> Ord A)
6 ord0eln0 3023 . . 3 |- (Ord A -> ((/) e. A <-> A =/= (/)))
75, 6syl 10 . 2 |- (Lim A -> ((/) e. A <-> A =/= (/)))
84, 7mpbird 196 1 |- (Lim A -> (/) e. A)
Colors of variables: wff set class
Syntax hints:   -> wi 3   <-> wb 146   = wceq 956   e. wcel 958   =/= wne 1585  (/)c0 2280  Ord word 2947  Lim wlim 2949
This theorem is referenced by:  limuni3 3123  peano1 3149  oe1m 4179  oalimcl 4194  oaass 4195  oarec 4196  omlimcl 4209  odi 4210  oen0 4213  oewordri 4219  oelim2 4222  limensuci 4506  rankxplim2 4713  rankxplim3 4714
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-11 967  ax-12 968  ax-13 969  ax-14 970  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  ax-sep 2703  ax-pow 2742  ax-pr 2779
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-3or 776  df-3an 777  df-ex 981  df-sb 1172  df-eu 1382  df-mo 1383  df-clab 1464  df-cleq 1469  df-clel 1472  df-ne 1587  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-pw 2402  df-sn 2412  df-pr 2413  df-op 2416  df-uni 2504  df-br 2620  df-opab 2667  df-tr 2681  df-eprel 2832  df-po 2840  df-so 2850  df-fr 2917  df-we 2934  df-ord 2951  df-lim 2953
Copyright terms: Public domain