fact: Definition DoActions_Step_T (i : Fin.t n) : tRel sigSim 1 := fun tin k => (exists tps1 tps2 tp, (length tps1 =? fin_to_nat i) = true /\ (length tps1 + (1 + length tps2) =? n) = true /\ atCons tin[@Fin0] tps1 tps2 tp /\ DoActions_Step_steps_cons i tps1 tps2 tp <= k) \/ (exists tps, atNil tin[@Fin0] tps /\ DoActions_Step_steps_nil <= k).
imports: Undecidability.TM.Basic.Mono Undecidability.TM.Combinators.Combinators Undecidability.TM.Code.Code Undecidability.TM.Single.EncodeTapes Undecidability.TM.Compound(TMTac MoveToSymbol Multi Shift)