 When the lemma has been proved, we look at what it says about a sentence. Since the sentence has no free variables, the lemma tells us that it is equivalent to a boolean combination of statements saying that \(A\) has a given finite number of elements. So if we know how many elements \(A\) has, we can immediately calculate whether the sentence is ‘correct in the domain \(A\)’.