Theorem onelssi 6477

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 6403	. 2 ⊢ (𝐴 ∈ On → (𝐵 ∈ 𝐴 → 𝐵 ⊆ 𝐴))
3	1, 2	ax-mp 5	1 ⊢ (𝐵 ∈ 𝐴 → 𝐵 ⊆ 𝐴)

This proof depends on syntax axioms:   → wi 4   ∈ wcel 2143   ⊆ wss 3905  Oncon0 6360

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-ext 2735

This proof depends on definitions:  df-bi 210  df-an 401  df-tru 1573  df-ex 1810  df-sb 2097  df-clab 2742  df-cleq 2755  df-clel 2838  df-ral 3080  df-v 3457  df-ss 3922  df-uni 4873  df-tr 5219  df-po 5569  df-so 5570  df-fr 5614  df-we 5616  df-ord 6363  df-on 6364

This theorem is used by:  onelini  6480  oneluni  6481  oawordeulem  8535  cardsdomelir  9964  carddom2  9968  cardaleph  10078  alephsing  10264  domtriomlem  10430  axdc3lem  10438  inar1  10764  nodense  27865