Metamath Proof Explorer


Theorem leltstrd

Description: Surreal less-than is transitive. (Contributed by Scott Fenton, 8-Dec-2021)

Ref Expression
Hypotheses ltstrd.1 ( 𝜑𝐴 No )
ltstrd.2 ( 𝜑𝐵 No )
ltstrd.3 ( 𝜑𝐶 No )
leltstrd.4 ( 𝜑𝐴 ≤s 𝐵 )
leltstrd.5 ( 𝜑𝐵 <s 𝐶 )
Assertion leltstrd ( 𝜑𝐴 <s 𝐶 )

Proof

Step Hyp Ref Expression
1 ltstrd.1 ( 𝜑𝐴 No )
2 ltstrd.2 ( 𝜑𝐵 No )
3 ltstrd.3 ( 𝜑𝐶 No )
4 leltstrd.4 ( 𝜑𝐴 ≤s 𝐵 )
5 leltstrd.5 ( 𝜑𝐵 <s 𝐶 )
6 leltstr ( ( 𝐴 No 𝐵 No 𝐶 No ) → ( ( 𝐴 ≤s 𝐵𝐵 <s 𝐶 ) → 𝐴 <s 𝐶 ) )
7 1 2 3 6 syl3anc ( 𝜑 → ( ( 𝐴 ≤s 𝐵𝐵 <s 𝐶 ) → 𝐴 <s 𝐶 ) )
8 4 5 7 mp2and ( 𝜑𝐴 <s 𝐶 )