proposition: Lemma finSucc_help' (n : nat) (i1 i2 : Fin.t n) : Fin.FS i1 <> Fin.FS i2 -> i1 <> i2.
proof: Proof. now intros H1 ->. Qed.
imports: Undecidability.TM.Basic.Mono Undecidability.TM.Combinators.Combinators Undecidability.TM.Code.Code Undecidability.TM.Single.EncodeTapes Undecidability.TM.Compound(TMTac MoveToSymbol Multi Shift)