Translate the following inference to logic notation: Thomas is not working. For all x, x_7 will work if and only if x_7 is rich. For all x, if x_7 works, then x_7 is rich. Therefore Thomas is not rich.
~P(a). forall x: P(x) <-> Q(x). forall x: P(x) -> Q(x). Therefore ~Q(a).