Why can't we sort N numbers in comparison sorting algorithm faster than O(n log n) time?

Question

I was looking into binary, binomial and Fibonacci heap sort and I found out that takes O(n log n) time to sort. It would be great if someone can give me a reason as to why i