From Undecidability.L Require Export L Datatypes.LNat Datatypes.LBool Functions.Encoding Computability.Seval.
Definition cChoice := constructive_indefinite_ground_description_nat_Acc.

Lemma lcomp_comp Y {Ry:registered Y} (u:term) (g: term -> Y):
(forall x (y:Y), enc y = x -> y = g x) ->
(exists y:Y, u == enc y) -> {y:Y| u == enc y}.