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

Theorem ordon 4608
Description: The class of all ordinal numbers is ordinal. Proposition 7.12 of [TakeutiZaring] p. 38, but without using the Axiom of Regularity. (Contributed by NM, 17-May-1994.)
Assertion
Ref Expression
ordon  |-  Ord  On

Proof of Theorem ordon
StepHypRef Expression
1 tron 4503 . 2  |-  Tr  On
2 df-on 4489 . . . . 5  |-  On  =  { x  |  Ord  x }
32abeq2i 2343 . . . 4  |-  ( x  e.  On  <->  Ord  x )
4 ordtr 4499 . . . 4  |-  ( Ord  x  ->  Tr  x
)
53, 4sylbi 121 . . 3  |-  ( x  e.  On  ->  Tr  x )
65rgen 2595 . 2  |-  A. x  e.  On  Tr  x
7 dford3 4488 . 2  |-  ( Ord 
On 
<->  ( Tr  On  /\  A. x  e.  On  Tr  x ) )
81, 6, 7mpbir2an 951 1  |-  Ord  On
Colors of variables: wff set class
Syntax hints:    e. wcel 2203   A.wral 2520   Tr wtr 4208   Ord word 4483   Oncon0 4484
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-ext 2214
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ral 2525  df-rex 2526  df-v 2815  df-in 3217  df-ss 3224  df-uni 3915  df-tr 4209  df-iord 4487  df-on 4489
This theorem is referenced by:  ssorduni  4609  limon  4635  onprc  4674  tfri1dALT  6582  rdgon  6617
  Copyright terms: Public domain W3C validator