We prove by mathematical induction that all horses in the world are of the same colour.
Base case: There is a single horse. It has some coat colour. Because there are no other horses, all the horses have the same coat colour.
Induction step: We have \(n\) horses. We assume all of them have the same coat colour. Now we add an additional \((n+1)\)st horse. We don’t know what colour it has, but if we for now get rid of one horse from the group we had before, we suddenly have a group of \(n\) horses which includes the new one. Since we have our claim proven for \(n\), all of these horses have the same coat colour and therefore the new horse has the same coat colour as all the other ones. So every group of \(n+1\) horses has the same colour.
The third step: due to mathematical induction rule, all the horses in the world have the same coat colour. THUS WE HAVE PROVED THAT ALL HORSES IN THE WORLD ARE OF THE SAME COLOUR!