Translate the following inference to logic notation: For all x, x_7 will make tea or x_7 is not poor. For all x, x_7 will not play squash. For all x, if x_7 makes tea, then x_7 is poor. For all x, x_7 will play squash if and only if x_7 will make tea. Therefore for all x, x_7 is not poor.
forall x: P(x) or ~Q(x). forall x: ~R(x). forall x: P(x) -> Q(x). forall x: R(x) <-> P(x). Therefore forall x: ~Q(x).