Completeness of the bounded Boolean powers of orthomodular lattices (Q1913870)

The bounded Boolean power \(L[B]^*\) of an orthomodular lattice \(L\) (this is a bounded lattice with an orthocomplementation \('\) satisfying the orthomodular law \(x\leq y \Rightarrow x \vee (y \wedge x') = y)\) by a Boolean algebra \(B\) is defined as the set of all mappings \(f\) from \(L\) to \(B\) such that \(f(L)\) is finite, \(\bigvee f(L) = 1\) and \(f(x) \wedge f(y) = 0\) for all pairs \(x,y\) of distinct elements of \(L\). If for \(f,g \in L[B]^*\) one defines \(f \leq g\) iff \(\bigvee \{f(x) \wedge g(y) \mid x,y \in L,\;x \leq y\} = 1\) and \(f'(x) : = f(x')\) for all \(x \in L\) then \((L [B]^*, \leq,')\) is an orthomodular lattice. It is proved that this lattice is complete iff one of \(L\) and \(B\) is finite and other is complete.