How to verify that a heuristic is consistent?
Another option rather then verifying it for each couple node-child is to use some problem specific properties and prove it this way.

Iff it is known that the triangle inequality stands for the distance between the nodes in the specific problem, then the heuristic is consistent. The triangle inequality is part of definition of a metric. So if the distance in the problem space is some well known metric you can state that the heuristic is consistent. Example for that is the distance metric in the Euclidean geometry.