A Heyting algebra is a distributive bounded lattice equipped with a special operation "$\to$" obeying $(c\land a)\leq b \iff c\leq (a\to b)$. These algebras are of interest since they serve as models of intuitionist logic. A complete Heyting algebra is a Heyting algebra which is complete as a lattice. My question is whether every Heyting algebra can be embedded into a complete Heyting algebra, while preserving finite joins, meets, and the "$\to$" operation.
This seems like a basic question about Heyting algebras, but I couldn't find any sources. One would think the completion of Heyting algebras would be common knowledge, were it true. Maybe there's an obvious (dis)proof I just haven't thought of?
I've already tried the obvious: the Dedekind-Macneille completion lets us embed any Heyting algebra into a complete, bounded, distributive lattice. In the completion, we can define $(a\to b) := \bigvee\{c : (c\land a)\leq b\}$, and I was able to prove that the "$\to$" operation is respected by the embedding. Unfortunately, I was not able to show that the completion is a Heyting algebra, as I couldn't prove the axiom $c\leq (a\to b) \iff (c\land a)\leq b$ holds in the completion.
I tried a slightly different completion, but had a similar problem where I couldn't prove it's a Heyting algebra. I think there's a way to get a completed Heyting algebra using a larger completion than Dedekind-Macneille, but it would be nice to know whether this is already a solved problem.