Coinduction is a method of proof which relies on the fact that any two states of the terminal coalgebra for an endofunctor must be equal if they are indistinguishable under repeated operations of . That is, there are no proper coalgebra quotient objects.
Coinduction is dual to induction. It generalises to corecursion.