Prove or find a counter example: Every two infinite countable , well ordered sets are similar.
There's a theorem that says that there is a unique function of similarity between two similar well ordered sets, so I guess I would have to define that function. I tried indexing the elements of both sets from 0,1,2,.. and so on and defining the function of similarity by assigning the minimum of one set to the other and so on so that the indexes match ( where the minimum would have the index 0). I think that is a bijective function. I can't think of a counter example.