fact: Definition insert {X : Type} (i : nat) (f : nat -> X) (x : X) (n : nat) := match Compare_dec.lt_eq_lt_dec n i with inleft (left _) => f n | inleft (right _) => x | inright _ => f (Nat.pred n) end.
imports: PeanoNat Lia Vector Undecidability.SOL(SOL PA2) Undecidability.Shared.Libs.PSL(Vectors) Undecidability.SOL.Util(Syntax Subst Tarski) Undecidability.Synthetic(Definitions DecidabilityFacts EnumerabilityFacts ListEnumerabilityFacts ReducibilityFacts) Undecidability.Shared.Dec