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

Theorem elong 4516
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 4515 . 2  |-  ( x  =  A  ->  ( Ord  x  <->  Ord  A ) )
2 df-on 4511 . 2  |-  On  =  { x  |  Ord  x }
31, 2elab2g 2973 1  |-  ( A  e.  V  ->  ( A  e.  On  <->  Ord  A ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 105    e. wcel 2209   Ord word 4505   Oncon0 4506
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 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-ext 2220
This theorem depends on definitions:  df-bi 117  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-in 3226  df-ss 3233  df-uni 3934  df-tr 4228  df-iord 4509  df-on 4511
This theorem is referenced by:  elon  4517  eloni  4518  elon2  4519  ordelon  4526  onin  4529  limelon  4542  ssonuni  4633  onsuc  4646  onsucb  4648  onintonm  4662  onprc  4697  omelon2  4753  bj-nnelon  16902
  Copyright terms: Public domain W3C validator