proposition: Lemma step_comp (c : mconfig sig (state (projT1 pM)) n) : haltConf c = false -> step (projT1 pM) c = step WhileTM c.
proof: Proof. intros HHalt. unfold haltConf in HHalt. destruct c as [q t]. cbn in *. cbv [step]. cbn. rewrite HHalt. reflexivity. Qed.
imports: Undecidability(TM.Util.TM_facts) Undecidability.Shared.Libs.PSL.FiniteTypes.DepPairs EqdepFacts