Consider the following premises. S(d) -> ~R(e). forall z: S(z) <-> Q(z). forall y: R(y). Can we infer Q(d) from them? If possible, name the inference rules being used at each step.
 From forall y: R(y) we can infer R(e) via universal instantiation. From forall z: S(z) <-> Q(z) we can infer S(d) <-> Q(d) via universal instantiation. From S(d) -> ~R(e), R(e) we can infer ~S(d) via modus tollens. Finally, from S(d) <-> Q(d), ~S(d) we can infer ~Q(d) via biconditional elimination, which contradicts Q(d). Therefore, the answer is no.