MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  nlim0 Structured version   Unicode version

Theorem nlim0 5438
Description: The empty set is not a limit ordinal. (Contributed by NM, 24-Mar-1995.) (Proof shortened by Andrew Salmon, 25-Jul-2011.)
Assertion
Ref Expression
nlim0  |-  -.  Lim  (/)

Proof of Theorem nlim0
StepHypRef Expression
1 noel 3703 . . 3  |-  -.  (/)  e.  (/)
2 simp2 1006 . . 3  |-  ( ( Ord  (/)  /\  (/)  e.  (/)  /\  (/)  =  U. (/) )  ->  (/) 
e.  (/) )
31, 2mto 179 . 2  |-  -.  ( Ord  (/)  /\  (/)  e.  (/)  /\  (/)  =  U. (/) )
4 dflim2 5436 . 2  |-  ( Lim  (/) 
<->  ( Ord  (/)  /\  (/)  e.  (/)  /\  (/)  =  U. (/) ) )
53, 4mtbir 300 1  |-  -.  Lim  (/)
Colors of variables: wff setvar class
Syntax hints:   -. wn 3    /\ w3a 982    = wceq 1437    e. wcel 1872   (/)c0 3699   U.cuni 4157   Ord word 5379   Lim wlim 5381
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1663  ax-4 1676  ax-5 1752  ax-6 1798  ax-7 1843  ax-9 1876  ax-10 1891  ax-11 1896  ax-12 1909  ax-13 2058  ax-ext 2403  ax-sep 4484  ax-nul 4493  ax-pr 4598
This theorem depends on definitions:  df-bi 188  df-or 371  df-an 372  df-3or 983  df-3an 984  df-tru 1440  df-ex 1658  df-nf 1662  df-sb 1791  df-eu 2275  df-mo 2276  df-clab 2410  df-cleq 2416  df-clel 2419  df-nfc 2553  df-ne 2596  df-ral 2714  df-rex 2715  df-rab 2718  df-v 3019  df-sbc 3238  df-dif 3377  df-un 3379  df-in 3381  df-ss 3388  df-pss 3390  df-nul 3700  df-if 3850  df-pw 3921  df-sn 3937  df-pr 3939  df-op 3943  df-uni 4158  df-br 4362  df-opab 4421  df-tr 4457  df-eprel 4702  df-po 4712  df-so 4713  df-fr 4750  df-we 4752  df-ord 5383  df-lim 5385
This theorem is referenced by:  0ellim  5442  tz7.44lem1  7073  tz7.44-3  7076  cflim2  8639  rankcf  9148  dfrdg4  30662  limsucncmpi  31049
  Copyright terms: Public domain W3C validator