Translate the following inference to logic notation: For all x, z_2 will cook if and only if z_2 is a taxi driver. If Patricia cooks, then Patricia is a taxi driver. Patricia is not a taxi driver. Therefore Patricia is not cooking.
forall x: P(x) <-> Q(x). P(a) -> Q(a). ~Q(a). Therefore ~P(a).