We study the accessibility properties of trivial cofibrations and weak
equivalences in a combinatorial model category and prove an estimate for the
accessibility rank of weak equivalences. In particular, we show that the class
of weak equivalences between simplicial sets is finitely accessible.Comment: The main result is improved and its proof is simplified. To appear in
  Theory and Applications of Categories. 15 page

Raptis, G.