proposition: Fact mma_empty_progress v st : st = (p,v) -> v#>x = 0 -> (i,EMPTYₐ) // (i,v) -+> st.
proof: Proof. intros -> H. unfold mma_isempty, mma_jump; simpl app. mma sss DEC zero with x (3+i); rew vec. mma sss INC with x. mma sss DEC S with x p (0); rew vec. mma sss stop; f_equal. apply vec_pos_ext; intros y; dest y x; lia. Qed.
imports: List Arith Lia Undecidability.Shared.Libs.DLW(utils list_bool gcd pos vec subcode sss) Undecidability.MinskyMachines.MMA(mma_defs)