Consider the following premises. forall x_8: Q_1(x_8). forall x_8: P_5(x_8) or P_8(x_8). forall x_8: P_8(x_8) <-> T_3(x_8). forall x_8: P_5(x_8) -> T_3(x_8). Can we infer forall x_8: T_3(x_8) from them? If possible, name the inference rules being used at each step.
 From forall x_8: P_8(x_8) <-> T_3(x_8) we can infer forall x_8: P_8(x_8) -> T_3(x_8) via universal biconditional elimination. Finally, from forall x_8: P_5(x_8) -> T_3(x_8), forall x_8: P_8(x_8) -> T_3(x_8), forall x_8: P_5(x_8) or P_8(x_8) we can infer forall x_8: T_3(x_8) via universal disjunction elimination. Therefore, the answer is yes.