Translate the following inference to logic notation: If Thomas reads a book, then Thomas is making tea. For all x, y will read a book if and only if y will make tea. Therefore if Thomas makes tea, then Thomas is reading a book.
P(a) -> Q(a). forall x: P(x) <-> Q(x). Therefore Q(a) -> P(a).