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: ~W_2(j). forall x: W_2(x) <-> P(x). w or P(j).
~P(j) -> w can be inferred via the rewriting rule. forall x: W_2(x) -> P(x) can be inferred via the universal biconditional elimination rule. forall x: P(x) -> W_2(x) can be inferred via the universal biconditional elimination rule.