Translate the following inference to logic notation: For all x, y_1 will sleep if and only if y_1 will make tea. For all x, y_1 will sleep or y_1 is not a taxi driver. Therefore for all x, if y_1 were a taxi driver, then y_1 is making tea.
forall x: P(x) <-> Q(x). forall x: P(x) or ~R(x). Therefore forall x: R(x) -> Q(x).