proposition: Fact finite_t_finite X : finite_t X -> finite X.
proof: Proof. intros (l & ?); exists l; auto. 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)