proposition: Lemma move_connect_ppeg n p1 p2 : `c[p1, n] `-->*_r `c[p2].
proof: Proof. case: (p1 =P p2) => [->|/eqP p1Dp2] //. apply/connectP; exists (ppeg p1 p2); first by apply: path_ppeg. by rewrite last_ppeg. Qed.
imports: mathcomp(all_ssreflect) hanoi(extra gdist ghanoi ghanoi3)