proposition: Lemma MoveToSymbol_Step_None t : current t = None -> MoveToSymbol_Step_Fun t = t.
proof: Proof. intros H1. unfold MoveToSymbol_Step_Fun. destruct t; cbn in *; inv H1; auto. Qed.
imports: Undecidability(TM.Util.Prelim) Undecidability(TM.Basic.Mono) Undecidability(TM.Combinators.Combinators) Undecidability(TM.Compound.TMTac) Undecidability(TM.Compound.Multi) Coq(FunInd) Coq(Recdef)