Consider the following premises. forall y: T(y) -> U(y). T(g) or q. forall y: U(y) -> T(y). ~U(g). Can we infer q from them?
 From forall y: U(y) -> T(y), forall y: T(y) -> U(y) we can infer forall y: U(y) <-> T(y). From forall y: U(y) <-> T(y) we can infer U(g) <-> T(g). From U(g) <-> T(g), ~U(g) we can infer ~T(g). Finally, from T(g) or q, ~T(g) we can infer q. Therefore, the answer is yes.