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