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 x: P_3(x) -> T_1(x). forall x: P_3(x) -> T_1(x). forall x: T_1(x) -> P_3(x). forall x: T_1(x) <-> W(x). forall x: ~P_3(x).
forall x: ~T_1(x) can be inferred via the universal modus tollens rule. forall x: P_3(x) <-> T_1(x) can be inferred via the universal biconditional introduction rule. forall x: P_3(x) <-> T_1(x) can be inferred via the universal biconditional introduction rule. forall x: T_1(x) <-> P_3(x) can be inferred via the universal biconditional introduction rule. forall x: T_1(x) <-> P_3(x) can be inferred via the universal biconditional introduction rule. forall x: T_1(x) -> W(x) can be inferred via the universal biconditional elimination rule. forall x: W(x) -> T_1(x) can be inferred via the universal biconditional elimination rule.