Consider the following premises. Q_10(a_5) -> r. forall x_10: W_2(x_10) -> Q_10(x_10). forall x_10: Q_10(x_10) -> W_2(x_10). Can we infer W_2(a_5) -> r from them? If possible, name the inference rules being used at each step.
 From forall x_10: W_2(x_10) -> Q_10(x_10), forall x_10: Q_10(x_10) -> W_2(x_10) we can infer forall x_10: W_2(x_10) <-> Q_10(x_10) via universal biconditional introduction. From forall x_10: W_2(x_10) <-> Q_10(x_10) we can infer forall x_10: W_2(x_10) -> Q_10(x_10) via universal biconditional elimination. From forall x_10: W_2(x_10) -> Q_10(x_10) we can infer W_2(a_5) -> Q_10(a_5) via universal instantiation. Finally, from W_2(a_5) -> Q_10(a_5), Q_10(a_5) -> r we can infer W_2(a_5) -> r via transitivity. Therefore, the answer is yes.