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