fact: Definition ForallT {X} (p : X -> Type) := fix ForallT {n} (v : t X n) := match v with | nil _ => (unit : Type) | cons _ x _ v => (p x * ForallT v)%type end.
imports: Undecidability.Synthetic(Definitions DecidabilityFacts EnumerabilityFacts ListEnumerabilityFacts ReducibilityFacts) Undecidability(Shared.ListAutomation) Undecidability(Shared.Libs.PSL.Vectors.Vectors)