What can be inferred from the following premises in a single inference step (ignoring inferences that add new predicates or constants)? Name the inference rule being used: forall y: T(y) <-> P_3(y). forall x: W(x) <-> P_2(x). ~P_3(b). ~P_2(e).
~P_3(b) and ~P_2(e) can be inferred via the conjunction rule. ~P_2(e) and ~P_3(b) can be inferred via the conjunction rule. forall y: T(y) -> P_3(y) can be inferred via the universal biconditional elimination rule. forall x: W(x) -> P_2(x) can be inferred via the universal biconditional elimination rule. forall y: P_3(y) -> T(y) can be inferred via the universal biconditional elimination rule. forall x: P_2(x) -> W(x) can be inferred via the universal biconditional elimination rule.