Definition 2.30 defines a partition of a set S as a set {A1, A2, . . . , Ak} of sets such that (i) A1, A2, . . . , Ak are all nonempty; (ii) A1∪ A2∪ ∪ Ak = S; and (iii) for any distinct i, j ∈ {1, . . . , k}, the sets Ai and Aj are disjoint. Formalize this definition using nested quantifiers and basic set notation.
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here