Metamath Proof Explorer


Theorem ontr2d

Description: Transitive law for ordinal numbers. Exercise 3 of TakeutiZaring p. 40. Deduction form. (Contributed by Scott Fenton, 31-Jul-2026)

Ref Expression
Hypotheses ontr2d.1 ⊢ φ → A ∈ On
ontr2d.2 ⊢ φ → C ∈ On
ontr2d.3 ⊢ φ → A ⊆ B
ontr2d.4 ⊢ φ → B ∈ C
Assertion ontr2d ⊢ φ → A ∈ C

Proof

Step Hyp Ref Expression
1 ontr2d.1 ⊢ φ → A ∈ On
2 ontr2d.2 ⊢ φ → C ∈ On
3 ontr2d.3 ⊢ φ → A ⊆ B
4 ontr2d.4 ⊢ φ → B ∈ C
5 ontr2 ⊢ A ∈ On ∧ C ∈ On → A ⊆ B ∧ B ∈ C → A ∈ C
6 1 2 5 syl2anc ⊢ φ → A ⊆ B ∧ B ∈ C → A ∈ C
7 3 4 6 mp2and ⊢ φ → A ∈ C