proposition: Lemma length_make : forall n v, length (make n v) = n.
proof: Proof. Proof using. intros. induction n. { auto. } { rewrite make_succ. rewrite length_cons. math. } Qed.
imports: Coq.Classes.Morphisms TLC(LibTactics LibLogic LibReflect LibOperation LibProd LibOption LibNat LibInt LibWf LibMonoid LibRelation)