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