Translate the following inference to logic notation: For all x, if z_4 reads a book, then z_4 is curious. There is at least one x for which z_4 will read a book if and only if z_4 is curious. For all x, z_4 will not read a book. Therefore there is at least one x for which z_4 is not curious.
forall x: P(x) -> Q(x). exists x: P(x) <-> Q(x). forall x: ~P(x). Therefore exists x: ~Q(x).