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