Translate the following inference to logic notation: For all x, x_4 is not poor. There is at least one x for which x_4 is a janitor. For all x, x_4 is poor or x_4 will sleep. Therefore there is at least one x for which x_4 is a janitor.
forall x: ~P(x). exists x: Q(x). forall x: P(x) or R(x). Therefore exists x: Q(x).