Consider the following premises. For all x_11, x_11 is a mechanic. For all x_11, x_11 is poor and x_11 will play squash. For all x_11, x_11 will make tea if and only if x_11 is poor. Can we infer the following from them? If we can, name the inference rule being used: For all x_11, x_11 will make tea and x_11 is a mechanic.
 From the fact that for all x_11, x_11 is poor and x_11 will play squash we can infer that for all x_11, x_11 is poor via universal simplification. From the fact that for all x_11, x_11 will make tea if and only if x_11 is poor we can infer that for all x_11, if x_11 were poor, then x_11 is making tea via universal biconditional elimination. From the fact that for all x_11, if x_11 were poor, then x_11 is making tea, and that for all x_11, x_11 is poor we can infer that for all x_11, x_11 will make tea via universal modus ponens. Finally, from the fact that for all x_11, x_11 will make tea, and that for all x_11, x_11 is a mechanic we can infer that for all x_11, x_11 will make tea and x_11 is a mechanic via universal conjunction. Therefore, the answer is yes.