Translate the following inference to logic notation: For all x, if x were an electrician, then x is a musician. For all x, if x were a musician, then x is an electrician. There is at least one x for which x will make tea if and only if x is a musician. For all x, x is not an electrician. Therefore there is at least one x for which x will not make tea.
forall x: P(x) -> Q(x). forall x: Q(x) -> P(x). exists x: R(x) <-> Q(x). forall x: ~P(x). Therefore exists x: ~R(x).