Translate the following inference to logic notation: If Karen were rich, then Thomas is playing tennis. For all x, x will cook if and only if x will play tennis. For all x, x will not cook. Therefore Karen is not rich.
p -> P(a). forall x: Q(x) <-> P(x). forall x: ~Q(x). Therefore ~p.