The proof above shows that for each recursively enumerable set of axioms there is a recursive set of axioms with the same deductive closure.
This proof highlights that for any given collection of recursively enumerable axioms, it is feasible to obtain a corresponding set of recursive axioms that encompasses exactly the same logical outcomes.