Theorem ordsson 4637

Description: Any ordinal class is a subclass of the class of ordinal numbers. Corollary 7.15 of [TakeutiZaring] p. 38. (Contributed by NM, 18-May-1994.)

Assertion

Ref	Expression
ordsson	⊢ (Ord 𝐴 → 𝐴 ⊆ On)

Proof of Theorem ordsson

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		ordelon 4526	. . 3 ⊢ ((Ord 𝐴 ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ On)
2	1	ex 115	. 2 ⊢ (Ord 𝐴 → (𝑥 ∈ 𝐴 → 𝑥 ∈ On))
3	2	ssrdv 3254	1 ⊢ (Ord 𝐴 → 𝐴 ⊆ On)

Syntax hints:   → wi 4   ∈ wcel 2209   ⊆ wss 3220  Ord word 4505  Oncon0 4506

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 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-ext 2220

This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-in 3226  df-ss 3233  df-uni 3934  df-tr 4228  df-iord 4509  df-on 4511

This theorem is referenced by:  onss  4638  orduni  4640  iordsmo  6562  tfrlemi14d  6598  tfr1onlemssrecs  6604  tfri1dALT  6616  tfrcllemssrecs  6617  ordiso2  7369