fact: Definition fin_t X (P : X -> Prop) := { l | forall x, P x <-> In x l }.
imports: List Arith Lia Eqdep_dec Bool Undecidability.Shared.Libs.DLW.Utils(utils_tac utils_list utils_nat) Undecidability.Shared.Libs.DLW.Vec(pos vec)