proposition: Lemma Nth_nil_inv : forall n x, Nth n nil x -> False.
proof: Proof. Proof using. introv H. inverts H. Qed.
imports: Coq.Classes.Morphisms TLC(LibTactics LibLogic LibReflect LibOperation LibProd LibOption LibNat LibInt LibWf LibMonoid LibRelation)