proposition: Lemma drop_nil : forall n, drop n (@nil A) = nil.
proof: Proof. Proof using. intros. destruct n; auto. Qed.
imports: Coq.Classes.Morphisms TLC(LibTactics LibLogic LibReflect LibOperation LibProd LibOption LibNat LibInt LibWf LibMonoid LibRelation)