Consider the following premises. exists x: W(x) -> W_3(x). forall x: ~Q(x). forall x: W_3(x) -> W(x). forall x: W(x) <-> Q(x). Can we infer forall x: ~Q(x) from them? If possible, name the inference rules being used at each step.
That is one of the premises. Therefore, the answer is yes.