Suppose x is set, and let p(x) denote the set of all subsets of x (this is sometimes called the powerset of x). for any subsets a, b ⊆ x, the inclusion a ⊆ b either holds or it does not. thus, ⊆ is a binary relation on p(x). prove that ⊆ is a partial order.