proposition: Lemma enumeratorT_recalg n : {f & enumerator__T f (recalg n) }.
proof: Proof. eexists. eapply enumerator__T_to_list. apply enum_recalg. Defined.
imports: Arith Lia List Bool Eqdep_dec EqdepFacts Undecidability.Shared.Libs.DLW(utils_tac utils_nat utils_list finite pos vec) Undecidability.Synthetic(Definitions DecidabilityFacts EnumerabilityFacts ListEnumerabilityFacts ReducibilityFacts) Undecidability(Shared.ListAutomation Shared.Dec) Undecidability.MuRec.Util.recalg