proposition: Lemma indom_map : forall A B C (IB:Inhab B) (f:A->B->C) M x, x \indom M -> x \indom (map_ f M).
proof: Proof. Proof using. introv IB H. rewrite* indom_map_eq. Qed.
imports: TLC(LibTactics LibLogic LibReflect LibOption LibRelation LibLogic LibOperation LibEpsilon LibMonoid LibSet)