Rule of Simplification/Proof Rule/Tableau Form

Proof Rule
Let $\phi \land \psi$ be a well-formed formula in a tableau proof whose main connective is the conjunction operator.

The Rule of Simplification is invoked for $\phi \land \psi$ in either of the two forms:


 * Form 1:


 * Form 2: