ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  limord Unicode version

Theorem limord 4380
Description: A limit ordinal is ordinal. (Contributed by NM, 4-May-1995.)
Assertion
Ref Expression
limord  |-  ( Lim 
A  ->  Ord  A )

Proof of Theorem limord
StepHypRef Expression
1 dflim2 4355 . 2  |-  ( Lim 
A  <->  ( Ord  A  /\  (/)  e.  A  /\  A  =  U. A ) )
21simp1bi 1007 1  |-  ( Lim 
A  ->  Ord  A )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1348    e. wcel 2141   (/)c0 3414   U.cuni 3796   Ord word 4347   Lim wlim 4349
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105
This theorem depends on definitions:  df-bi 116  df-3an 975  df-ilim 4354
This theorem is referenced by:  limelon  4384  nlimsucg  4550
  Copyright terms: Public domain W3C validator