Metamath Proof Explorer


Theorem onsltd

Description: Less-than is the same as birthday comparison over surreal ordinals. Deduction version. (Contributed by Scott Fenton, 25-Feb-2026)

Ref Expression
Hypotheses onsltd.1 ( 𝜑𝐴 ∈ Ons )
onsltd.2 ( 𝜑𝐵 ∈ Ons )
Assertion onsltd ( 𝜑 → ( 𝐴 <s 𝐵 ↔ ( bday 𝐴 ) ∈ ( bday 𝐵 ) ) )

Proof

Step Hyp Ref Expression
1 onsltd.1 ( 𝜑𝐴 ∈ Ons )
2 onsltd.2 ( 𝜑𝐵 ∈ Ons )
3 onslt ( ( 𝐴 ∈ Ons𝐵 ∈ Ons ) → ( 𝐴 <s 𝐵 ↔ ( bday 𝐴 ) ∈ ( bday 𝐵 ) ) )
4 1 2 3 syl2anc ( 𝜑 → ( 𝐴 <s 𝐵 ↔ ( bday 𝐴 ) ∈ ( bday 𝐵 ) ) )