Translate the following inference to logic notation: For all x, if x_4 makes tea, then x_4 is running. For all x, x_4 will go running if and only if x_4 will make tea. Therefore for all x, if x_4 goes running, then x_4 is making tea.
forall x: P(x) -> Q(x). forall x: Q(x) <-> P(x). Therefore forall x: Q(x) -> P(x).