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