proposition: Lemma lt_tail0: forall c, nf c -> c <> zero -> tail c < c.
proof: Proof. induction c. destruct 2;auto with T2. simpl. generalize IHc3; case c3. auto with T2. intros. apply psi_relevance. inversion_clear H. 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