proposition: Lemma sleR x y ks : x <=[y :: ks] y = (y == x).
proof: Proof. by rewrite sleNgt sltL negbK. Qed.
imports: Coq(ssreflect ssrbool ssrfun) mathcomp(ssrnat eqtype seq path interval order) pcm(options prelude ordtype seqext)