Consider the following premises. Q(a) -> T(a). forall y_2: T(y_2) <-> Q(y_2). forall y_2: T(y_2) -> Q(y_2). Can we infer ~(T(a) <-> Q(a)) from them? If possible, name the inference rules being used at each step.
That contradicts the premises. Therefore the answer is no.