Theorem onelssi 6486

Description: A member of an ordinal number is a subset of it. (Contributed by NM, 11-Aug-1994.)

Hypothesis

Ref	Expression
on.1	⊢ 𝐴 ∈ On

Assertion

Ref	Expression
onelssi	⊢ (𝐵 ∈ 𝐴 → 𝐵 ⊆ 𝐴)

Proof of Theorem onelssi

Step	Hyp	Ref	Expression
1		on.1	. 2 ⊢ 𝐴 ∈ On
2		onelss 6412	. 2 ⊢ (𝐴 ∈ On → (𝐵 ∈ 𝐴 → 𝐵 ⊆ 𝐴))
3	1, 2	ax-mp 5	1 ⊢ (𝐵 ∈ 𝐴 → 𝐵 ⊆ 𝐴)

This proof depends on syntax axioms:   → wi 4   ∈ wcel 2146   ⊆ wss 3900  Oncon0 6369

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-ext 2735

This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1572  df-ex 1812  df-sb 2101  df-clab 2742  df-cleq 2755  df-clel 2839  df-ral 3081  df-v 3456  df-ss 3901  df-uni 4871  df-tr 5216  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-ord 6372  df-on 6373

This theorem is used by:  onelini  6489  oneluni  6490  oawordeulem  8576  cardsdomelir  10067  carddom2  10071  cardaleph  10181  alephsing  10367  domtriomlem  10533  axdc3lem  10541  inar1  10873  nodense  28064