It is shown that every Escher-diagram must contain a path through infinitely many horizontal and vertical splitting points. (It would be a nice exercise to formalize this using e.g. Coq.)