proposition: Lemma map_empty : forall A B C (IB:Inhab B) (f:A->B->C), map_ f ((\{} : map A B)) = empty.
proof: Proof. Proof using. auto. Qed.
imports: TLC(LibTactics LibLogic LibReflect LibOption LibRelation LibLogic LibOperation LibEpsilon LibMonoid LibSet)