Language
A
is in NP if there is a polynomial-time evidence checker for
A
.