Translate the following inference to logic notation: For all x, if x_5 drinks water, then x_5 is a lawyer. For all x, if x_5 were a police officer, then x_5 is a lawyer. There is at least one x for which x_5 will drink water or x_5 is a nurse. For all x, if x_5 were a nurse, then x_5 is making tea. For all x, if x_5 makes tea, then x_5 is a police officer. Therefore there is at least one x for which x_5 is a lawyer.
forall x: P(x) -> Q(x). forall x: R(x) -> Q(x). exists x: P(x) or S(x). forall x: S(x) -> T(x). forall x: T(x) -> R(x). Therefore exists x: Q(x).