Definition (Dense Boolean SubAlgebra): Let $A$ be a Boolean algebra and $B\subseteq A$ a Boolean subalgebra. We say that $B$ is dense in $A$ if for every $a\in A$ there exist $b\in B$ such that $b \leq a$.
I have found here (https://planetmath.org/booleansubalgebra) stated the following claim (with proof?):
Claim: $B$ is dense in $A$ iff for every $a_1\leq a_2\in A$, there exists $b\in B$ such that $a_1 \leq b \leq a_2$.
The direction $(\Leftarrow)$ is clear, taking $a_1=0$ and $a_2=a$. For $(\Rightarrow)$ the proposed proof is the following:
Proof (?) of ($\Rightarrow$) : Assume $a_1\leq a_2$. Since $B$ is dense in $A$ by hp., we can find $r\in B$ such that $r\leq a_2$. We conclude by picking $b= r\vee a_1$ so that $a_1 \leq b \leq a_2$ as desired.
The problem I see with this proof is that the candidate $b= r\vee a_1$ is not guaranteed to be in $B$ since $a_1$ is not in $B$.
QUESTION: Is the property stated in the link actually true?
- ) If yes, is the proof above correct and am I missing something obvious?
- ) If no, what is the correct(ed) property that they might have had in their mind?