Theorem onelond 36730

Description: An element of an ordinal number is an ordinal number. Theorem 2.2(iii) of [BellMachover] p. 469. Lemma 1.3 of [Schloeder] p. 1. Deduction form. (Contributed by Scott Fenton, 31-Jul-2026.)

Hypotheses

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

Assertion

Ref	Expression
onelond	⊢ (𝜑 → 𝐵 ∈ On)

Proof of Theorem onelond

Step	Hyp	Ref	Expression
1		onelond.1	. 2 ⊢ (𝜑 → 𝐴 ∈ On)
2		onelond.2	. 2 ⊢ (𝜑 → 𝐵 ∈ 𝐴)
3		onelon 6389	. 2 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ 𝐴) → 𝐵 ∈ On)
4	1, 2, 3	syl2anc 596	1 ⊢ (𝜑 → 𝐵 ∈ On)

This proof depends on syntax axioms:   → wi 4   ∈ wcel 2146  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  ax-sep 5259  ax-pr 5406

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2744  df-cleq 2757  df-clel 2840  df-ne 2961  df-ral 3082  df-rab 3419  df-v 3459  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-br 5112  df-opab 5176  df-tr 5221  df-eprel 5563  df-po 5571  df-so 5572  df-fr 5616  df-we 5618  df-ord 6367  df-on 6368

This theorem is used by:  nadddilem1  36751  nadddilem2  36752  nadddilem3  36753  nadddilem4  36754