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