Many popular ontology languages are based on (subsets of) first-order predicate logic, with classes represented by unary predicates and properties by binary predicates. Specifically, the Semantic Web ontology language OWL DL is based on the Description Logic SHOIN. F-Logic is an ontology language which is also based on first-order logic, but classes and properties are modeled as terms rather than predicates. Our goal is to enable interoperation between predicate-based and FLogic-based ontology languages. To this end, we define an intuitive translation from predicate-based ontologies to F-Logic ontologies and show that this translation preserves entailment for large classes of ontology languages, including most of OWL DL. Specifically, we define the class of equality-safe (E-safe) formulas, show that the Description Logic SHIQ is E-safe, and show that the translation preserves validity of E-safe formulas. We use these results to close the open problem of layering F-Logic programming on ...