Theorem onssi 4551

Description: An ordinal number is a subset of On. (Contributed by NM, 11-Aug-1994.)

Hypothesis

Ref	Expression
onssi.1	⊢ 𝐴 ∈ On

Assertion

Ref	Expression
onssi	⊢ 𝐴 ⊆ On

Proof of Theorem onssi

Step	Hyp	Ref	Expression
1		onssi.1	. 2 ⊢ 𝐴 ∈ On
2		onss 4529	. 2 ⊢ (𝐴 ∈ On → 𝐴 ⊆ On)
3	1, 2	ax-mp 5	1 ⊢ 𝐴 ⊆ On

Syntax hints:   ∈ wcel 2167   ⊆ wss 3157  Oncon0 4398

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 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-ext 2178

This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1475  df-sb 1777  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ral 2480  df-rex 2481  df-v 2765  df-in 3163  df-ss 3170  df-uni 3840  df-tr 4132  df-iord 4401  df-on 4403

This theorem is referenced by: (None)