Theorem elong 4351

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.

Step	Hyp	Ref	Expression
1		ordeq 4350	. 2 |- ( x = A -> ( Ord x <-> Ord A ) )
2		df-on 4346	. 2 |- On = { x | Ord x }
3	1, 2	elab2g 2873	1 |- ( A e. V -> ( A e. On <-> Ord A ) )

Syntax hints:   -> wi 4   <-> wb 104   e. wcel 2136   Ord word 4340   Oncon0 4341

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-ext 2147

This theorem depends on definitions:  df-bi 116  df-tru 1346  df-nf 1449  df-sb 1751  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-ral 2449  df-rex 2450  df-v 2728  df-in 3122  df-ss 3129  df-uni 3790  df-tr 4081  df-iord 4344  df-on 4346

This theorem is referenced by:  elon  4352  eloni  4353  elon2  4354  ordelon  4361  onin  4364  limelon  4377  ssonuni  4465  suceloni  4478  sucelon  4480  onintonm  4494  onprc  4529  omelon2  4585  bj-nnelon  13841