proposition: Lemma finMin_opt_None (n : nat) : finMin_opt n = None -> n = 0.
proof: Proof. destruct n; cbn; congruence. 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)