In the proof of Hartog's theorem, you reach a point where you just proved that the class of all well-orders of the set X (using the separation axiom schema). Now you have to prove that each the class of all order-types (isomorphic ordinals) of each of these well-orders is also a set, and it's here that you use replacement, by constructing a first-order formula that expresses the isomorphism of each (Y,<), where Y is a subset of X and "<" is a well-order in Y, to an ordinal.
This is the key step in Hartog's proof, the one that allows him to sidestep AC, so I think the "highlighting" is a careful, step-by-step explanation of how the replacement schema is used.