Unsatisfiability Theorem

A set of assumptions H\mathcal{H} entails AA if and only if H∪{¬A}\mathcal{H} \cup\{\neg A\} is unsatisfiable, which means no Assignment will satisfy it.

This means:
Entailment can be tested via Satisfiability!
y