Checking regularity of the fibres can often be done using the pumping lemma for regular languages.
Confirming the coherence of the fibres frequently involves utilizing the pumping lemma for regular languages.