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