Consider the following premises. P_14(d) -> Q_14(d). ~P_14(d). forall x_14: P_14(x_14) or ~Q_14(x_14). Can we infer ~Q_14(d) from them? If possible, name the inference rules being used at each step.
 From forall x_14: P_14(x_14) or ~Q_14(x_14) we can infer forall x_14: Q_14(x_14) -> P_14(x_14) via universal rewriting. From forall x_14: Q_14(x_14) -> P_14(x_14) we can infer Q_14(d) -> P_14(d) via universal instantiation. From P_14(d) -> Q_14(d), Q_14(d) -> P_14(d) we can infer P_14(d) <-> Q_14(d) via biconditional introduction. From P_14(d) <-> Q_14(d) we can infer Q_14(d) -> P_14(d) via biconditional elimination. Finally, from Q_14(d) -> P_14(d), ~P_14(d) we can infer ~Q_14(d) via modus tollens. Therefore, the answer is yes.