How can I prove that it is impossible to find a cheater in shamir secret sharing?
You could use the fact that having two of three pairs does not reveal any information about the secret (polynomial). Also see the Wikipedia article on Shamir's secret sharing: it provides you with a nice graphical answer to your question.