proposition: Lemma cmp_lt_trans x y z : cmp x y = Lt -> cmp y z = Lt -> cmp x z = Lt.
proof: Proof. destruct x; destruct y; destruct z; simpl; try (refl||discr). apply Ty_CmpTransLeibniz.cmp_lt_trans. Qed.
imports: CoLoR(LogicUtil OrdUtil LSimple RelUtil) Coq(Structures.Equalities Lia) Coq(Compare_dec)