ðˈɛn, ɪf wiː mˈæp bˈuːliən ˈɑːpɚɹˌeɪɾɚz ˌɪntʊ sˈɛt ˈɑːpɚɹˌeɪɾɚz, ðə "tɹænslˈeɪɾᵻd" əbˌʌv tˈɛkst ɑːɹ vˈælɪd ˈɔːlsoʊ fɔːɹ sˈɛts: ðɛɹˌɑːɹ mˈɛni "mˈɪnɪməl kəmplˈiːt sˈɛt ʌv sˈɛtθˈiəɹi ˈɑːpɚɹˌeɪɾɚz" ðæt kæn dʒˈɛnɚɹˌeɪt ˌɛni ˈʌðɚ sˈɛt ɹᵻlˈeɪʃənz.
Then, if we map boolean operators into set operators, the "translated" above text are valid also for sets: there are many "minimal complete set of set-theory operators" that can generate any other set relations.