fact: Variable (X : Type) (P Q : X -> Prop) (HX : finite_t X) (HQ : fin_t Q) (Pdec : forall x, { P x } + { ~ P x }).
imports: List Arith Lia Undecidability.Shared.Libs.DLW.Utils(utils_tac utils_list utils_nat fin_base) Undecidability.Shared.Libs.DLW.Vec(pos vec)