- We apply the
induct tactic.
- We get a step case whose shape looks like
induction_hypothesis ==> conclusion.
- Take
conclusion from this step case.
- Apply
clarsimp to the conclusion`.
- If there is a remaining goal, then call it
conclusion1, else decide that the induction was not bad.
- Apply
clarsimp to the entire step case induction_hypothesis ==> conclusion.
- If there is a remaining goal of the form of
induction_hypothesis2 ==> conclusion2, then take conclusion2, else decide that the induction was not bad.
- Compare
conclusion1 against conclusion2.
- If they are different, then decide that the induction was not bad, else the induction was not useful.
If at least one subgoal is "was not bad", then the induction was "useful".