Metamath Proof Explorer


Theorem slenltd

Description: Surreal less-than or equal in terms of less-than. Deduction version. (Contributed by Scott Fenton, 25-Feb-2026)

Ref Expression
Hypotheses sled.1 ( 𝜑𝐴 No )
sled.2 ( 𝜑𝐵 No )
Assertion slenltd ( 𝜑 → ( 𝐴 ≤s 𝐵 ↔ ¬ 𝐵 <s 𝐴 ) )

Proof

Step Hyp Ref Expression
1 sled.1 ( 𝜑𝐴 No )
2 sled.2 ( 𝜑𝐵 No )
3 slenlt ( ( 𝐴 No 𝐵 No ) → ( 𝐴 ≤s 𝐵 ↔ ¬ 𝐵 <s 𝐴 ) )
4 1 2 3 syl2anc ( 𝜑 → ( 𝐴 ≤s 𝐵 ↔ ¬ 𝐵 <s 𝐴 ) )