Consistency proof

In mathematics, a theory is called consistent, if does not contain any contradictions. In the context of predicate logic it is impossible to deduce both $\phi$ as well as $\mathrm{\neg }\phi$ from $\mathrm{\Phi }$