 Completeness of implication-free intuitionistic propositional logic for distributive lattices

An implication-free formula is provable exactly when every valuation into every bounded distributive lattice assigns it the top element.