proposition: Lemma le_one_cons : forall a b n c, one <= cons a b n c.
proof: Proof. unfold one. intros. apply le_trans with [a,b];auto with T2. case a; case b; auto 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