Consider the following premises. forall y: R(y) -> T_1(y). forall y: ~T_1(y). forall y: Q_3(y) -> R(y). forall y: T_1(y) -> R(y). forall y: R(y) -> Q_3(y). Can we infer forall y: ~Q_3(y) from them? If possible, name the inference rules being used at each step.
 From forall y: R(y) -> T_1(y), forall y: T_1(y) -> R(y) we can infer forall y: R(y) <-> T_1(y) via universal biconditional introduction. From forall y: R(y) -> Q_3(y), forall y: Q_3(y) -> R(y) we can infer forall y: R(y) <-> Q_3(y) via universal biconditional introduction. From forall y: R(y) <-> T_1(y), forall y: ~T_1(y) we can infer forall y: ~R(y) via universal biconditional elimination. Finally, from forall y: R(y) <-> Q_3(y), forall y: ~R(y) we can infer forall y: ~Q_3(y) via universal biconditional elimination. Therefore, the answer is yes.