(A note on notation: To reduce the number of parentheses, I write

with a period after

when the scope of

extends as far to the right as possible.)

Point (a) can be checked directly. There are only ten different pairs

(if we ignore symmetric pairs because it is clear that the relation

is symmetric). One can check all ten pairs and make sure that the equivalence holds.

Alternatively, it is obvious that

. We can prove the converse using the contrapositive:

. Here for every pair of distinct elements (there are only six of those taking symmetry into account) one has to find an element belonging to one set but not to the other.

For (b), first write the set {0,{1},2} expanding the definitions of 0, 1, and 2. All three elements are different, so if we evaluated

on

in the universe of all sets, the formula would be true. That is, for different

and

there would be a witness of the difference, i.e., a set

belonging to one but not to the other. However, our universe is very poor, and the witnesses we found above may not be in our universe. That's why the formula may not be true in this small universe.

In any case, it is easy again to check every pair of distinct elements x and y (now there are only three of them) and see if

is true. Remember that

ranges over the same 3-element universe.