Consider the following premises. p <-> r_2. r_2 -> Q_1(j_1). forall y_3: ~Q_1(y_3). Can we infer ~p from them? If possible, name the inference rules being used at each step.
 From forall y_3: ~Q_1(y_3) we can infer ~Q_1(j_1) via universal instantiation. From r_2 -> Q_1(j_1), ~Q_1(j_1) we can infer ~r_2 via modus tollens. Finally, from p <-> r_2, ~r_2 we can infer ~p via biconditional elimination. Therefore, the answer is yes.