Completing a combinatorial proof of the rigidity of Sturmian words generated by morphisms

In [7], Séébold (1998) announced that Sturmian words generated by morphisms are all rigid. There was a gap in the proof. This gap is corrected here to complete a combinatorial proof of this result.