proposition: Lemma compare_rw_lt : forall alpha beta, alpha < beta -> compare alpha beta = Lt.
proof: Proof. intros; generalize (compare_reflect alpha beta). case (compare alpha beta). intro;subst beta;case (lt_irr H);auto with T2. auto . intro; case (lt_irr (alpha:=alpha)). eapply transitivity;eauto with 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