proposition: Lemma enumerable__T_list_enumerable {X} : enumerable__T X -> list_enumerable__T X.
proof: Proof. intros [f Hf]. eexists. unfold list_enumerator. intros x. rewrite <- enumerator_to_list_enumerator. eapply Hf. Qed.
imports: Undecidability.Synthetic(DecidabilityFacts SemiDecidabilityFacts EnumerabilityFacts) Undecidability.Shared.Dec List