Consider the following premises. For all x_10, x_10 is sad or x_10 will not make tea. For all x_10, x_10 is a scientist if and only if x_10 will play a game. For all x_10, if x_10 were sad, then x_10 is playing a game. Can we infer the following from them? If we can, name the inference rule being used: For all x_10, if x_10 makes tea, then x_10 is a scientist.
 From the fact that for all x_10, x_10 is sad or x_10 will not make tea we can infer that for all x_10, if x_10 makes tea, then x_10 is sad via universal rewriting. From the fact that for all x_10, if x_10 makes tea, then x_10 is sad, and that for all x_10, if x_10 were sad, then x_10 is playing a game we can infer that for all x_10, if x_10 makes tea, then x_10 is playing a game via universal transitivity. From the fact that for all x_10, x_10 is a scientist if and only if x_10 will play a game we can infer that for all x_10, if x_10 plays a game, then x_10 is a scientist via universal biconditional elimination. Finally, from the fact that for all x_10, if x_10 makes tea, then x_10 is playing a game, and that for all x_10, if x_10 plays a game, then x_10 is a scientist we can infer that for all x_10, if x_10 makes tea, then x_10 is a scientist via universal transitivity. Therefore, the answer is yes.