Translate the following inference to logic notation: For all x, if x_5 were happy, then x_5 is sad. There is at least one x for which if x_5 were a server, then x_5 is happy. For all x, if x_5 were a police officer, then x_5 is making tea. For all x, if x_5 were sad, then x_5 is a police officer. Therefore there is at least one x for which if x_5 were a server, then x_5 is making tea.
forall x: P(x) -> Q(x). exists x: R(x) -> P(x). forall x: S(x) -> T(x). forall x: Q(x) -> S(x). Therefore exists x: R(x) -> T(x).