Definition 33: We may treat membership statements as binary predicates, i.e. we use the predicate symbol \in and let the defining statement be (x \in y) for variables x and y . We will call this the membership predicate.
A theoretical quest.
Definition 33: We may treat membership statements as binary predicates, i.e. we use the predicate symbol \in and let the defining statement be (x \in y) for variables x and y . We will call this the membership predicate.