Theorem elon 4477

Description: An ordinal number is an ordinal set. (Contributed by NM, 5-Jun-1994.)

Hypothesis

Ref	Expression
elon.1	|- A e. _V

Assertion

Ref	Expression
elon	|- ( A e. On <-> Ord A )

Proof of Theorem elon

Step	Hyp	Ref	Expression
1		elon.1	. 2 |- A e. _V
2		elong 4476	. 2 |- ( A e. _V -> ( A e. On <-> Ord A ) )
3	1, 2	ax-mp 5	1 |- ( A e. On <-> Ord A )

Syntax hints:   <-> wb 105   e. wcel 2202   _Vcvv 2803   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:  tron  4485  0elon  4495  ordtriexmidlem  4623  ontr2exmid  4629  ordtri2or2exmidlem  4630  onsucelsucexmidlem  4633  exmidonfinlem  7464  bj-omelon  16677