Theorem onelss 4508

Description: An element of an ordinal number is a subset of the number. (Contributed by NM, 5-Jun-1994.) (Proof shortened by Andrew Salmon, 25-Jul-2011.)

Assertion

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

Proof of Theorem onelss

Step	Hyp	Ref	Expression
1		eloni 4496	. 2 |- ( A e. On -> Ord A )
2		ordelss 4500	. . 3 |- ( ( Ord A /\ B e. A ) -> B C_ A )
3	2	ex 115	. 2 |- ( Ord A -> ( B e. A -> B C_ A ) )
4	1, 3	syl 14	1 |- ( A e. On -> ( B e. A -> B C_ A ) )

Syntax hints:   -> wi 4   e. wcel 2203   C_ wss 3211   Ord word 4483   Oncon0 4484

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 2214

This theorem depends on definitions:  df-bi 117  df-tru 1401  df-nf 1510  df-sb 1812  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ral 2525  df-rex 2526  df-v 2815  df-in 3217  df-ss 3224  df-uni 3915  df-tr 4209  df-iord 4487  df-on 4489

This theorem is referenced by:  onelssi  4550  ssorduni  4609  onsucelsucr  4630  tfisi  4709  tfrlem9  6550  nntri2or2  6731  phpelm  7121  exmidontri2or  7553  nninfctlemfo  12736  ennnfonelemk  13151