Translate the following inference to logic notation: For all x, if x were a carpenter, then x is working. Patricia is a carpenter if and only if Patricia is working. Therefore Patricia is a carpenter if and only if Patricia is working.
forall x: P(x) -> Q(x). P(a) <-> Q(a). Therefore P(a) <-> Q(a).