Consider the following premises. forall x: P(x) <-> W(x). forall x: P(x) <-> W(x). Can we infer W(i) -> P(i) from them? If possible, name the inference rules being used at each step.
 From forall x: P(x) <-> W(x) we can infer forall x: W(x) -> P(x) via universal biconditional elimination. From forall x: P(x) <-> W(x) we can infer forall x: P(x) -> W(x) via universal biconditional elimination. From forall x: W(x) -> P(x), forall x: P(x) -> W(x) we can infer forall x: W(x) <-> P(x) via universal biconditional introduction. From forall x: W(x) <-> P(x) we can infer W(i) <-> P(i) via universal instantiation. Finally, from W(i) <-> P(i) we can infer W(i) -> P(i) via biconditional elimination. Therefore, the answer is yes.