Translate the following inference to logic notation: For all x, if x_6 plays squash, then x_6 is happy. There is at least one x for which x_6 is a musician. For all x, if x_6 were happy, then x_6 is playing squash. For all x, if x_6 were a musician, then x_6 is happy. Therefore there is at least one x for which x_6 is happy.
forall x: P(x) -> Q(x). exists x: R(x). forall x: Q(x) -> P(x). forall x: R(x) -> Q(x). Therefore exists x: Q(x).