Translate the following inference to logic notation: For all x, if x_3 plays tennis, then x_3 is an artist. There is at least one x for which if x_3 makes tea, then x_3 is playing tennis. For all x, if x_3 were an artist, then x_3 is making tea. Therefore there is at least one x for which if x_3 were an artist, then x_3 is making tea.
forall x: P(x) -> Q(x). exists x: R(x) -> P(x). forall x: Q(x) -> R(x). Therefore exists x: Q(x) -> R(x).