proposition: Theorem lt_compatR (n p : nat): (n <p)%nat -> fin n t2< fin p.
proof: Proof. destruct n; cbn. - destruct p. + inversion 1. + cbn; auto with T2. - destruct p. + intros;lt_clean. + simpl; auto with arith 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)