LIST_INDUCT_TAC : tactic
A ?- !l. P ===================================================== LIST_INDUCT_TAC A |- P[NIL/l] A u {P[l'/l]} ?- !h. P[CONS h l'/l]where l' is a primed variant of l that does not appear free in the assumptions A (usually, l' is just l). When LIST_INDUCT_TAC is applied to a goal of the form !l.P, where l does not appear free in P, the subgoals are just A ?- P and A u {P} ?- !h.P.