See this question Prove that for any two sets $A$ and $B$, $A\notin B$ or $B\notin A$
I am having some doubt in it
Let two sets A and B be such that
A ={ B } and B = { A } . Then both contain each other . What is wrong here ?
Principal of regularity says atleast one element is disjoint from A and A contains a set which contains A . So different objects and I guess disjoint .
Also if we keep using principal of substituting here then sets
A = { B }
A = { { A } }
A = { { { B } } }
.
.
I think these all sets are different because they contains different objects but then they all are equal to A .