proposition: Theorem reduction : MM2_HALTING ⪯ CM1_HALT.
proof: Proof. exists (fun '(P, a0, b0) => exist _ _ (Argument.M_capped P a0 b0)). intros [[P a0] b0]. constructor. - apply Argument.transport. - apply Argument.reflection. Qed.
imports: ZArith List PeanoNat Lia Relations.Relation_Operators Relations.Operators_Properties Undecidability.MinskyMachines.MM2 Undecidability.CounterMachines.Util.CM1_facts Undecidability.MinskyMachines.Util.MM2_facts ssreflect ssrbool ssrfun Undecidability.Synthetic.Definitions Undecidability.Synthetic.ReducibilityFacts Undecidability.MinskyMachines.MM2 Undecidability.CounterMachines.CM1