INDUCT_TAC : tactic
A ?- !n. P ======================================== INDUCT_TAC A ?- P[0/n] A u {P} ?- P[SUC n'/n]where n' is a primed variant of n that does not appear free in the assumptions A (usually, n' just equals n). When INDUCT_TAC is applied to a goal of the form !n.P, where n does not appear free in P, the subgoals are just A ?- P and A u {P} ?- P.