PSL
PSL copied to clipboard
Abduction: another way to detect bad applications of induction
- We apply the
inducttactic. - We get a step case whose shape looks like
induction_hypothesis ==> conclusion. - Take
conclusionfrom this step case. - Apply
clarsimp to theconclusion`. - If there is a remaining goal, then call it
conclusion1, else decide that the induction was not bad. - Apply
clarsimpto the entire step caseinduction_hypothesis ==> conclusion. - If there is a remaining goal of the form of
induction_hypothesis2 ==> conclusion2, then takeconclusion2, else decide that the induction was not bad. - Compare
conclusion1againstconclusion2. - 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".
I need a concrete example for this.