proposition: Lemma compare_eq_iff (a b : T1) : compare a b = Eq <-> a = b.
proof: Proof. split; intro H. - pose proof (compare_reflect a b). now rewrite H in *. - subst. apply compare_refl. 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)