proposition: Lemma finite_incl : forall A B (M N : map A B), M \c N -> finite N -> finite M.
proof: Proof. Proof using. introv HI HM. unfold finite. lets HD: dom_incl HI. applys* finite_incl. Qed.
imports: TLC(LibTactics LibLogic LibReflect LibOption LibRelation LibLogic LibOperation LibEpsilon LibMonoid LibSet)