Soundness and Completeness of Semantic Tableaus/Corollary 1

Corollary to Soundness and Completeness of Semantic Tableaus
Let $\mathbf A$ be a WFF of propositional logic.

Let $T$ be a completed semantic tableau for $\mathbf A$.

Then $\mathbf A$ is satisfiable iff $T$ is open.

Proof
$\mathbf A$ is satisfiable iff it is not unsatisfiable.

By the Soundness and Completeness of Semantic Tableaus, $\mathbf A$ is satisfiable iff $T$ is not closed.

Since $T$ is completed, this is the case iff $T$ is open.