Translate the following inference to logic notation: For all x, if z works, then z is writing a letter. For all x, z will work if and only if z will write a letter. Linda is not working. Therefore Linda is not writing a letter.
forall x: P(x) -> Q(x). forall x: P(x) <-> Q(x). ~P(a). Therefore ~Q(a).