Go backward to Subset and Equality
Go up to Top
Go forward to Set Quantifier
We prove x = y, i.e., by definition of `=', forall z: z in x <=> z in y. Take arbitrary z. We have to prove z in x <=> z in y.
(1) forall z in x: z in y; (2) forall z in y: z in x.
A well-structured argument based on definitions and given knowledge.