Translate the following inference to logic notation: For all x, x_11 is bored if and only if x_11 is a writer. For all x, if x_11 were a writer, then x_11 is a cashier. For all x, x_11 is bored if and only if x_11 is a cashier. Therefore for all x, x_11 is bored if and only if x_11 is a cashier.
forall x: P(x) <-> Q(x). forall x: Q(x) -> R(x). forall x: P(x) <-> R(x). Therefore forall x: P(x) <-> R(x).