MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  onelssi Structured version   Visualization version   GIF version

Theorem onelssi 6505
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
StepHypRef Expression
1 on.1 . 2 𝐴 ∈ On
2 onelss 6431 . 2 (𝐴 ∈ On → (𝐵 ∈ 𝐴 → 𝐵 ⊆ 𝐴))
31, 2ax-mp 5 1 (𝐵 ∈ 𝐴 → 𝐵 ⊆ 𝐴)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∈ wcel 2147   ⊆ wss 3900  Oncon0 6388
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735
This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ral 3081  df-v 3456  df-ss 3901  df-uni 4873  df-tr 5219  df-po 5566  df-so 5567  df-fr 5611  df-we 5613  df-ord 6391  df-on 6392
This theorem is used by:  onelini  6508  oneluni  6509  oawordeulem  8600  cardsdomelir  10091  carddom2  10095  cardaleph  10207  alephsing  10393  domtriomlem  10559  axdc3lem  10567  inar1  10899  nodense  28106
  Copyright terms: Public domain W3C validator