We prove that all diagram groups (in the sense of Guba and Sapir) are left-orderable. The proof is in two steps: firstly, it is proved that all diagram groups inject in a certain braid group on infinitely many strings, and secondly, this group is then shown to be left-orderable.