proposition: Lemma finMin_opt_Some (n : nat) i : finMin_opt n = Some i -> exists n', n = S n'.
proof: Proof. destruct n; cbn; intros H; inv H; eauto. 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)