Consider the following premises. P_1(g_2) -> R_1(g_2). forall x_8: Q_8(x_8) -> P_1(x_8). forall x_8: R_1(x_8) -> Q_8(x_8). Can we infer R_1(g_2) -> P_1(g_2) from them? If possible, name the inference rules being used at each step.
 From forall x_8: R_1(x_8) -> Q_8(x_8), forall x_8: Q_8(x_8) -> P_1(x_8) we can infer forall x_8: R_1(x_8) -> P_1(x_8) via universal transitivity. Finally, from forall x_8: R_1(x_8) -> P_1(x_8) we can infer R_1(g_2) -> P_1(g_2) via universal instantiation. Therefore, the answer is yes.