Consider the following premises. forall x_16: R_16(x_16) and S_16(x_16). R_16(j) <-> t_4. Can we infer ~t_4 from them? If possible, name the inference rules being used at each step.
 From forall x_16: R_16(x_16) and S_16(x_16) we can infer R_16(j) and S_16(j) via universal instantiation. From R_16(j) and S_16(j) we can infer R_16(j) via simplification. From R_16(j) <-> t_4 we can infer R_16(j) -> t_4 via biconditional elimination. Finally, from R_16(j) -> t_4, R_16(j) we can infer t_4 via modus ponens, which contradicts ~t_4. Therefore, the answer is no.