Consider the following premises. u -> q. forall x: T(x) -> U(x). q <-> T(c). ~U(c). Can we infer u from them? If possible, name the inference rules being used at each step.
 From forall x: T(x) -> U(x) we can infer T(c) -> U(c) via universal instantiation. From T(c) -> U(c), ~U(c) we can infer ~T(c) via modus tollens. From q <-> T(c), ~T(c) we can infer ~q via biconditional elimination. Finally, from u -> q, ~q we can infer ~u via modus tollens, which contradicts u. Therefore, the answer is no.