proposition: Lemma compare_refl : forall alpha : T1, compare alpha alpha = Eq.
proof: Proof. induction alpha; cbn; auto. rewrite IHalpha1, IHalpha2. now rewrite Nat.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)