Translate the following inference to logic notation: For all x, if x were a taxi driver, then x is happy. For all x, x is happy if and only if x is a taxi driver. Michael is not a taxi driver. Therefore Michael is not happy.
forall x: P(x) -> Q(x). forall x: Q(x) <-> P(x). ~P(a). Therefore ~Q(a).