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