Theorem onss 4417

Description: An ordinal number is a subset of the class of ordinal numbers. (Contributed by NM, 5-Jun-1994.)

Assertion

Ref	Expression
onss	|- ( A e. On -> A C_ On )

Proof of Theorem onss

Step	Hyp	Ref	Expression
1		eloni 4305	. 2 |- ( A e. On -> Ord A )
2		ordsson 4416	. 2 |- ( Ord A -> A C_ On )
3	1, 2	syl 14	1 |- ( A e. On -> A C_ On )

Syntax hints:   -> wi 4   e. wcel 1481   C_ wss 3076   Ord word 4292   Oncon0 4293

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 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1483  ax-10 1484  ax-11 1485  ax-i12 1486  ax-bndl 1487  ax-4 1488  ax-17 1507  ax-i9 1511  ax-ial 1515  ax-i5r 1516  ax-ext 2122

This theorem depends on definitions:  df-bi 116  df-3an 965  df-tru 1335  df-nf 1438  df-sb 1737  df-clab 2127  df-cleq 2133  df-clel 2136  df-nfc 2271  df-ral 2422  df-rex 2423  df-v 2691  df-in 3082  df-ss 3089  df-uni 3745  df-tr 4035  df-iord 4296  df-on 4298

This theorem is referenced by:  onuni  4418  onssi  4439  tfrexlem  6239  tfri3  6272  rdgivallem  6286  bj-omssonALT  13332