proposition: Lemma compare_reflect alpha beta : match compare alpha beta with | Lt => alpha t2< beta | Eq => alpha = beta | Gt => beta t2< alpha end.
proof: Proof. unfold compare,compare_T2. intros; case (lt_eq_lt_dec alpha beta);auto. destruct s;auto with T2. 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)