 Completeness theorem for propositional logic

For a set of formulae $\Gamma$ and a formula $\phi$,Together with the soundness theorem for propositional logic, this says that semantic consequence and syntactic provability coincide. Equivalently, every consistent set of formulae has a satisfying Boolean valuation.