Translate the following inference to logic notation: For all x, if x_1 takes a plane, then x_1 is sleeping. If Michael sleeps, then Sarah is making tea. If Sarah makes tea, then Michael is sleeping. Therefore if Michael takes a plane, then Sarah is making tea.
forall x: P(x) -> Q(x). Q(a) -> p. p -> Q(a). Therefore P(a) -> p.