proposition: Lemma uniform_match_option {X Y Z : Type} (f : Y -> Z) (g : X -> Y) (ox : option X) y : (forall x, f (g x) = f y) -> f (match ox with Some x => g x | None => y end) = f y.
proof: Proof. intros H. destruct ox; congruence. Qed.
imports: Undecidability.TM.KOSBTM.KOSBTM Undecidability.Shared.Libs.PSL.Vectors.FinNotation Undecidability.Shared.Libs.PSL.Vectors.Vectors Undecidability.Shared.Libs.PSL.EqDec List Arith Lia Bool Undecidability.Shared.Libs.DLW(utils list_bool pos vec subcode sss) Undecidability.StackMachines.BSM(bsm_defs)