fact: Definition Forall {X} (p : X -> Prop) := fix Forall {n} (v : t X n) := match v with | nil _ => True | cons _ x _ v => p x /\ Forall v end.
imports: Undecidability.SOL.SOL Undecidability.Shared.Dec Undecidability.Shared.Libs.PSL(Vectors) Undecidability.Synthetic(Definitions DecidabilityFacts EnumerabilityFacts ListEnumerabilityFacts ReducibilityFacts) EqdepFacts Eqdep_dec