this seems the most simple and logical proofTrebla said:|A|≤ |B|
|B| ≤ |C|
So, |A| ≤ |B| ≤ |C|
hence |A| ≤ |C|
If this is the case, would the proof be any different from the proofs given by the posts above?Affinity said:|A| ≤ |B| could mean "there exist an injection from set A into set B"
Oh so it is different, can you please show me the proof ? Because I have absolutely no idea.Affinity said:would be slightly different.. by the way, where did you get that question from