Equivalence of Definitions of Consistent Set of Formulas

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

Let $\mathscr P$ be a proof system for $\mathcal L_0$.

Let $\mathcal F$ be a collection of logical formulas.