proposition: Theorem lt_compatR : forall n p, (n <p)%nat -> finite n < finite p .
proof: Proof. destruct n;simpl. destruct p. inversion 1. simpl;auto with T2. destruct p. intros;lt_clean. simpl; auto with arith T2. Qed.
imports: EPSILON0 Arith List Omega Compare_dec Relations Wellfounded Max Tools More_nat AccP not_decreasing EPSILON0 More_nat Gamma0_prelude Gamma0_length term rpo