Translate the following inference to logic notation: For all x, y_1 will make tea or y_1 is not an electrician. For all x, if y_1 makes tea, then y_1 is an electrician. For all x, y_1 is not an electrician. Therefore for all x, y_1 will not make tea.
forall x: P(x) or ~Q(x). forall x: P(x) -> Q(x). forall x: ~Q(x). Therefore forall x: ~P(x).