fact: Fixpoint mb_is_tuple t n (v : vec X n) := match v with | vec_nil => forall z, z ∉ t | x##v => exists t', t ≋ ⦅x,t'⦆ /\ t' ≋ ⦉v⦊ end where "t ≋ ⦉ v ⦊" := (mb_is_tuple t v).
imports: List Arith Nat Lia Max Wellfounded Coq.Setoids.Setoid Undecidability.Shared.Libs.DLW.Utils(utils_tac utils_list finite) Undecidability.Shared.Libs.DLW.Vec(pos vec) Undecidability.FOL.TRAKHTENBROT(notations fol_ops fo_sig fo_terms fo_logic)