proposition: Theorem list_enum_by_measure_fin_t : list_enum_t.
proof: Proof. Proof using Hm. exists (fun n => proj1_sig (Hm n)). intros x; exists (S (m x)). apply (proj2_sig (Hm _)); auto. Qed.
imports: List Arith Bool Lia Eqdep_dec Undecidability.Synthetic.Definitions Undecidability.Synthetic.ReducibilityFacts Undecidability.Synthetic.InformativeDefinitions Undecidability.Synthetic.InformativeReducibilityFacts Undecidability.Shared.Libs.DLW.Utils(utils_tac utils_list utils_nat finite) Undecidability.Shared.Libs.DLW.Vec(pos vec) Undecidability.FOL.TRAKHTENBROT(notations utils fol_ops decidable)