criterion for consistency of sets of formulas

Let $L$ be a first order language, and $\mathrm{\Delta }\subseteq L$ be a set of sentences. Then $\mathrm{\Delta }$ is consistent if and only if every finite subset of $\mathrm{\Delta }$ is consistent.