Translate the following inference to logic notation: For all x, x will write a letter if and only if x is a taxi driver. If John were a taxi driver, then it is cloudy. Therefore if John writes a letter, then it is cloudy.
forall x: P(x) <-> Q(x). Q(a) -> p. Therefore P(a) -> p.