Let $\mathcal{B}$ a finite boolean algebra.
Only using the calculus rules about logic operators: and ($\land$), or ($\lor$) and not ($\neg$), how do I prove that every element $p \in \mathcal{B}$ is equal to a disjonction of atoms ?
Define an atom as an element $p_a \in \mathcal{B}$ such that for every other element $p \in \mathcal{B}$, either $p_a \land p = p_a$ or $p_a \land p = 0$. Denote $\mathcal{A}$ the set of atoms: $$\mathcal{A} = \{p_a \in \mathcal{B} \mid \forall p \in \mathcal{B}, p_a \land p = p_a \text{ or } 0\} $$ For an element $p \in \mathcal{B}$, I want to show that it is a combination of atoms, more precisely: $$\forall p \in \mathcal{B}, \quad p = \bigvee_{p_a \in E} p_a$$ where: $$E = \{p_a \in \mathcal{A} \mid p_a \land p = p_a\} $$ However, I'm not sure how to show that these two elements in $\mathcal{B}$ are equal only using $\land, \lor, \neg$.
Hints: