Theorem onelssd 36732

Description: An element of an ordinal number is a subset of the number. Deduction form. (Contributed by Scott Fenton, 31-Jul-2026.)

Hypotheses

Ref	Expression
onelssd.1	⊢ (𝜑 → 𝐴 ∈ On)
onelssd.2	⊢ (𝜑 → 𝐵 ∈ 𝐴)

Assertion

Ref	Expression
onelssd	⊢ (𝜑 → 𝐵 ⊆ 𝐴)

Proof of Theorem onelssd

Step	Hyp	Ref	Expression
1		onelssd.1	. 2 ⊢ (𝜑 → 𝐴 ∈ On)
2		onelssd.2	. 2 ⊢ (𝜑 → 𝐵 ∈ 𝐴)
3		onelss 6407	. 2 ⊢ (𝐴 ∈ On → (𝐵 ∈ 𝐴 → 𝐵 ⊆ 𝐴))
4	1, 2, 3	sylc 66	1 ⊢ (𝜑 → 𝐵 ⊆ 𝐴)

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

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 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-ext 2737

This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2744  df-cleq 2757  df-clel 2840  df-ral 3082  df-v 3459  df-ss 3923  df-uni 4875  df-tr 5221  df-po 5571  df-so 5572  df-fr 5616  df-we 5618  df-ord 6367  df-on 6368

This theorem is used by:  nadddilem3  36753