Theorem elong 4496

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 4495	. 2 |- ( x = A -> ( Ord x <-> Ord A ) )
2		df-on 4491	. 2 |- On = { x | Ord x }
3	1, 2	elab2g 2966	1 |- ( A e. V -> ( A e. On <-> Ord A ) )

Syntax hints:   -> wi 4   <-> wb 105   e. wcel 2205   Ord word 4485   Oncon0 4486

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 2216

This theorem depends on definitions:  df-bi 117  df-tru 1401  df-nf 1510  df-sb 1812  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ral 2527  df-rex 2528  df-v 2817  df-in 3219  df-ss 3226  df-uni 3917  df-tr 4211  df-iord 4489  df-on 4491

This theorem is referenced by:  elon  4497  eloni  4498  elon2  4499  ordelon  4506  onin  4509  limelon  4522  ssonuni  4612  onsuc  4625  onsucb  4627  onintonm  4641  onprc  4676  omelon2  4732  bj-nnelon  16746