Translate the following inference to logic notation: For all x, if x_7 were poor, then x_7 is playing squash. There is at least one x for which x_7 is happy or x_7 will not play squash. For all x, x_7 is poor. Therefore there is at least one x for which x_7 is happy.
forall x: P(x) -> Q(x). exists x: R(x) or ~Q(x). forall x: P(x). Therefore exists x: R(x).