As a consideration from the post "Prove by "elementary methods": The plane cannot be covered by finitely-many copies of the letter "Y"", on the basis of the remark made in previous post by the user Moishe Cohen, is it still possible to apply elementary methods to prove weaker results, namely:
The plane cannot be covered by countably many copies of the letter Y.
As in the previous post, by "letter Y", it is meant that letter Y consists of 3 closed segments that have common point.
In other words, how to extend the idea from the case where there are finitely-many copies of the letter Y, however still using only elementary methods?
Advices/hints/solutions very appreciated!!!