proposition: Lemma half_spec_odd n : half ((n + n + 1) * 2 ^ 0) = (n, false).
proof: Proof. have := half_spec ((n + n + 1) * 2 ^ 0). case: (half _) => m [] /= *; congr pair; lia. Qed.
imports: Undecidability(MinskyMachines.MM MinskyMachines.MMA) Undecidability.Shared.Libs.DLW(Vec.pos Vec.vec Code.sss) PeanoNat List Lia Wf_nat ssreflect ssrbool ssrfun