Boolean Interpretation is Well-Defined

Theorem
Let $\mathcal L_0$ be the language of propositional logic.

Let $v: \mathcal L_0 \to \{T, F\}$ be a boolean interpretation.

Then $v$ is well-defined.