proposition: Lemma lem_lelst_trans {A} {dto : DecTotalOrder A} : forall l x y, LeLst y l -> leb x y -> LeLst x l.
proof: Proof. induction 1; sauto. Qed.
imports: Hammer(Tactics) Hammer(Reflect) Arith Lia Sorting.Permutation Program