proposition: Lemma compare_Eq : forall (alpha beta : T2), compare alpha beta = Eq -> alpha = beta.
proof: Proof. intros alpha beta; destruct (compare_correct alpha beta); trivial; discriminate. Qed.
imports: Coq(Arith List Lia Compare_dec Relations Wellfounded RelationClasses) hydras(Epsilon0) hydras(More_Arith Restriction) hydras(ON_Generic) hydras(rpo.term rpo.rpo) hydras(T2) hydras(Compat815)