Consider the following premises. W(h) -> s_2. forall x: Q(x). s_2 <-> Q(h). Can we infer ~s_2 from them? If possible, name the inference rules being used at each step.
 From forall x: Q(x) we can infer forall x: Q(x) or W(x) via universal addition. From forall x: Q(x) or W(x) we can infer Q(h) or W(h) via universal instantiation. From s_2 <-> Q(h) we can infer Q(h) -> s_2 via biconditional elimination. Finally, from Q(h) -> s_2, W(h) -> s_2, Q(h) or W(h) we can infer s_2 via disjunction elimination, which contradicts ~s_2. Therefore, the answer is no.