Translate the following inference to logic notation: For all x, y will make tea or y is not a server. For all x, y will make tea if and only if y is a server. Therefore for all x, if y makes tea, then y is a server.
forall x: P(x) or ~Q(x). forall x: P(x) <-> Q(x). Therefore forall x: P(x) -> Q(x).