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