Reductio ad Absurdum/Proof Rule/Tableau Form

Proof Rule
Let $\phi$ be a well-formed formula in a tableau proof.

The is invoked for $\neg \phi \vdash \bot$ in the following manner: