proposition: Fact finite_t_pos n : finite_t (pos n).
proof: Proof. exists (pos_list n); apply pos_list_prop. Qed.
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)