proposition: Lemma compare_correct (alpha beta: T1): CompSpec eq lt alpha beta (compare alpha beta).
proof: Proof. unfold lt. generalize (compare_reflect alpha beta). destruct (compare alpha beta); now constructor. Qed.
imports: Coq(Arith Max Bool Lia Compare_dec Relations Ensembles Wellfounded Bool RelationClasses Operators_Properties ArithRing Logic.Eqdep_dec) hydras(More_Arith Restriction DecPreOrder) hydras(OrdNotations)