fact: Definition Forall2 {X Y} (p : X -> Y -> Prop) := fix Forall2 {n} (v1 : t X n) (v2 : t Y n) := match v1 in Vector.t _ n return t Y n -> Prop with | nil _ => fun _ => True | cons _ x _ v1 => fun v2 => p x (hd v2) /\ Forall2 v1 (tl v2) end v2.
imports: Undecidability.SOL.SOL Undecidability.Shared.Dec Undecidability.Shared.Libs.PSL(Vectors) Undecidability.Synthetic(Definitions DecidabilityFacts EnumerabilityFacts ListEnumerabilityFacts ReducibilityFacts) EqdepFacts Eqdep_dec