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