To reduce error-prone work of implementing hybrid system designs in Event-B by hand, we revisit the refinement methodology to systematically identify, categorize and modularize software operators from system events. Then, by defining a verified translation, we can obtain a semantically equivalent correspondent in the B language for each modularized Event-B software operator. Thus, we can reuse the primitives of B (which are superset of Event-B) for refining system events down to implementations, and reuse the predicate transformers defined on the B primitives to reason about the correctness of refinements. The verified translation also ensures that the behaviors of the implementations obtained via refinements in B do not divert from the corresponding system events specified in Event-B. We evaluate our proposal on two case studies, and discuss the lessons learned.