Translate the following inference to logic notation: For all x, if y makes tea, then y is writing a letter. For all x, if y were an electrician, then y is making tea. For all x, y will not write a letter. Therefore for all x, y is not an electrician.
forall x: P(x) -> Q(x). forall x: R(x) -> P(x). forall x: ~Q(x). Therefore forall x: ~R(x).