proposition: Lemma lt_inv_nb : forall a n n' b b', cons a n b < cons a n' b' -> (n<n')%nat \/ n=n' /\ b < b'.
proof: Proof. inversion_clear 1; auto with T1. elim (lt_irr (a:=a)); auto. Qed.
imports: Arith Omega Compare_dec Relations Wellfounded Tools More_nat Wf_nat AccP not_decreasing ArithRing term rpo List