Page "Transfinite induction" Paragraph 11

As in the case of induction, we may treat different types of ordinals separately: another formulation of transfinite recursion is that given a set g < sub > 1 </ sub >, and class functions G < sub > 2 </ sub >, G < sub > 3 </ sub >, there exists a unique function F: Ord → V such that