Consider the following premises. For all x, if x makes tea, then x is running. For all x, if x were fast, then x is making tea. For all x, if x goes running, then x is fast. For all x, x will not make tea. Can we infer the following from them? If we can, name the inference rule being used: For all x, x is not fast.
 From the fact that for all x, if x makes tea, then x is running, and that for all x, if x goes running, then x is fast we can infer that for all x, if x makes tea, then x is fast via universal transitivity. From the fact that for all x, if x makes tea, then x is fast, and that for all x, if x were fast, then x is making tea we can infer that for all x, x will make tea if and only if x is fast via universal biconditional introduction. Finally, from the fact that for all x, x will make tea if and only if x is fast, and that for all x, x will not make tea we can infer that for all x, x is not fast via universal biconditional elimination. Therefore, the answer is yes.