Consider the following premises. For all x_9, if x_9 plays tennis, then x_9 is happy. For all x_9, if x_9 were happy, then x_9 is playing tennis. For all x_9, x_9 is bored if and only if x_9 is happy. There is at least one x_9 for which x_9 is not bored. Can we infer the following from them? There is at least one x_9 for which x_9 will not play tennis.
 From the fact that for all x_9, if x_9 plays tennis, then x_9 is happy, and that for all x_9, if x_9 were happy, then x_9 is playing tennis we can infer that for all x_9, x_9 will play tennis if and only if x_9 is happy. From the fact that for all x_9, x_9 is bored if and only if x_9 is happy, and that there is at least one x_9 for which x_9 is not bored we can infer that there is at least one x_9 for which x_9 is not happy. Finally, from the fact that for all x_9, x_9 will play tennis if and only if x_9 is happy, and that there is at least one x_9 for which x_9 is not happy we can infer that there is at least one x_9 for which x_9 will not play tennis. Therefore, the answer is yes.