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

Theorem elong 4476
Description: An ordinal number is an ordinal set. (Contributed by NM, 5-Jun-1994.)
Assertion
Ref Expression
elong  |-  ( A  e.  V  ->  ( A  e.  On  <->  Ord  A ) )

Proof of Theorem elong
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 ordeq 4475 . 2  |-  ( x  =  A  ->  ( Ord  x  <->  Ord  A ) )
2 df-on 4471 . 2  |-  On  =  { x  |  Ord  x }
31, 2elab2g 2954 1  |-  ( A  e.  V  ->  ( A  e.  On  <->  Ord  A ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 105    e. wcel 2202   Ord word 4465   Oncon0 4466
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 2213
This theorem depends on definitions:  df-bi 117  df-tru 1401  df-nf 1510  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ral 2516  df-rex 2517  df-v 2805  df-in 3207  df-ss 3214  df-uni 3899  df-tr 4193  df-iord 4469  df-on 4471
This theorem is referenced by:  elon  4477  eloni  4478  elon2  4479  ordelon  4486  onin  4489  limelon  4502  ssonuni  4592  onsuc  4605  onsucb  4607  onintonm  4621  onprc  4656  omelon2  4712  bj-nnelon  16675
  Copyright terms: Public domain W3C validator