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