Translate the following inference to logic notation: For all x, x_12 is a server if and only if x_12 will make tea. Jessica is a taxi driver or Thomas is not a server. Jessica is not a taxi driver. Therefore Thomas is not making tea.
forall x: P(x) <-> Q(x). p or ~P(a). ~p. Therefore ~Q(a).