Programming languages often combine features that are well understood on their own. However, the combination can still break properties that each feature enjoys separately. Type inference is especially sensitive to this. Modern languages such as Scala, TypeScript, and Flow combine implicit and explicit higher-rank polymorphism, subtyping, bounded quantification, and intersection and union types. Type inference for this combination is challenging. The core problem is the interaction of first-class \emph{type applications} with subtyping. Making type application impredicative makes \emph{stability under substitution} delicate, which would further break checking subsumption. Prior work recovers stability by adding a global, ad-hoc restriction on vacuous quantifiers, but the restriction does not compose. In a system with intersection types, it blocks a well-known encoding of bounded quantification and restricts expressive power. We show this restriction is avoidable by replacing it with a local, context-aware guard on a single subtyping rule, plus a companion bottom-like rule. Together they support impredicative type application and preserve stability, with no restriction on vacuous quantifiers. The design scales to a family of three systems, covering bounded quantification and intersection and union types. The intersection and union system validates the standard encoding of bounded quantification into intersections, covering both subtyping and typing. To our knowledge, this is the first mechanized result of this kind for implicit bounded quantification. All systems are formalized in the Rocq proof assistant. For the base system we also mechanize a sound, complete, and decidable worklist inference algorithm, whose changes are local and expected to carry over to the two extensions.