# Counterexample

From CS2800 wiki

To disprove that a predicate holds for all , you only need to choose a specific (called a counterexample) and show that is false. Put another way, the logical negation of "for all , " is "there exists an such that is false".