Translate the following inference to logic notation: For all x, x_9 is not an electrician. For all x, x_9 is curious if and only if x_9 is an electrician. If it is cloudy, then Thomas is curious. Therefore it is not cloudy.
forall x: ~P(x). forall x: Q(x) <-> P(x). p -> Q(a). Therefore ~p.