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