proposition: Fact hfs_trans_tuple_inv n v : @hfs_tuple n v ∈ t -> forall p, vec_pos v p ∈ t.
proof: Proof. Proof using Hp. induction v as [ | n x v IHv ]; simpl hfs_tuple; intros H p; invert pos p; apply hfs_trans_opair_inv, proj2, hfs_trans_pair_inv in H; destruct H; auto. Qed.
imports: List Arith Lia Max Wellfounded Setoid Eqdep_dec Bool Undecidability.Shared.Libs.DLW.Utils(utils_tac utils_list finite) Undecidability.Shared.Libs.DLW.Vec(pos vec) Undecidability.Shared.Libs.DLW.Wf(wf_finite wf_chains) Undecidability.FOL.TRAKHTENBROT(notations fol_ops membership btree)