Translate the following inference to logic notation: For all x, if x_10 were a nurse, then x_10 is drinking water. For all x, if x_10 makes tea, then x_10 is a janitor. For all x, if x_10 were a janitor, then x_10 is making tea. For all x, if x_10 drinks water, then x_10 is making tea. For all x, if x_10 were a janitor, then x_10 is a nurse. Therefore for all x, x_10 is a nurse if and only if x_10 will make tea.
forall x: P(x) -> Q(x). forall x: R(x) -> S(x). forall x: S(x) -> R(x). forall x: Q(x) -> R(x). forall x: S(x) -> P(x). Therefore forall x: P(x) <-> R(x).