Consider the following premises. Q_13(c) or ~r. Q(c) or r. forall x_13: Q(x_13) <-> Q_13(x_13). Can we infer Q_13(c) from them? If possible, name the inference rules being used at each step.
 From forall x_13: Q(x_13) <-> Q_13(x_13) we can infer forall x_13: Q(x_13) -> Q_13(x_13) via universal biconditional elimination. From forall x_13: Q(x_13) -> Q_13(x_13) we can infer Q(c) -> Q_13(c) via universal instantiation. From Q_13(c) or ~r we can infer r -> Q_13(c) via rewriting. Finally, from Q(c) -> Q_13(c), r -> Q_13(c), Q(c) or r we can infer Q_13(c) via disjunction elimination. Therefore, the answer is yes.