Empty LBA why all the configurations must be all equal


While trying to prove the Empty LBA one of the rules says that for having a computational story you have the 3 rules : and one of the 3 rules says that Ci has to produce Ci+1 and all the configurations must be equal like 001#001….001 and I don’t get why. Can anyone help me please ?