syntactic compactness theorem for first order logic

Let $L$ be a first-order language, and $\mathrm{\Delta }\subseteq L$ be a set of sentences. If $\mathrm{\Delta }$ is inconsistent, then some finite $\mathrm{\Gamma }\subseteq \mathrm{\Delta }$ is inconsistent.