Translate the following inference to logic notation: For all x, if x_6 were an office clerk, then x_6 is writing a letter. For all x, if x_6 writes a letter, then x_6 is working. For all x, x_6 is an office clerk or x_6 will not work. Therefore for all x, if x_6 were an office clerk, then x_6 is working.
forall x: P(x) -> Q(x). forall x: Q(x) -> R(x). forall x: P(x) or ~R(x). Therefore forall x: P(x) -> R(x).