ɔːltˈɜːnətˌɪvli, ɡˈɜːdəl ʃˈoʊd ðæt ɡˈɪvən ðɪ ˈæksɪəm ʌv kənstɹˌʌktəbˈɪlᵻɾi wˈʌn kæn ɹˈaɪt dˌaʊn ɐn ɛksplˈɪsɪt ðˌoʊ sˈʌmwʌt kˈɑːmplᵻkˌeɪɾᵻd tʃˈɔɪs fˈʌŋkʃən tˈaʊ ɪnðə lˈæŋɡwɪdʒ ʌv zˌiːˌɛfsˈiː, sˌoʊ ɪn sˌʌm sˈɛns ðɪ ˈæksɪəm ʌv kənstɹˌʌktəbˈɪlᵻɾi ɪmplˈaɪz ɡlˈoʊbəl tʃˈɔɪs ɪn fˈækt, zˌiːˌɛfsˈiː pɹˈuːvz ðæt ɪnðə lˈæŋɡwɪdʒ ɛkstˈɛndᵻd baɪ ðə jˈunɚɹi fˈʌŋkʃən sˈɪmbəl tˈaʊ, ðɪ ˈæksɪəm ʌv kənstɹˌʌktəbˈɪlᵻɾi ɪmplˈaɪz ðæt ɪf tˈaʊ ɪz sˈɛd ɛksplˈɪsɪtli dᵻfˈaɪnəbəl fˈʌŋkʃən, ðˈɛn ðɪs tˈaʊ ɪz ɐ ɡlˈoʊbəl tʃˈɔɪs fˈʌŋkʃən.
Alternatively, Gödel showed that given the axiom of constructibility one can write down an explicit (though somewhat complicated) choice function τ in the language of ZFC, so in some sense the axiom of constructibility implies global choice (in fact, [ZFC proves that] in the language extended by the unary function symbol τ, the axiom of constructibility implies that if τ is said explicitly definable function, then this τ is a global choice function.