SELECT_CONV : conv
SELECT_CONV (Term `(@n. n < m) < m`); val it = |- (@n. n < m) < m = (?n. n < m) : thm
([0 < m], (@n. n < m) < SUC m)Using the built-in arithmetic theorem
LESS_SUC |- !m n. m < n ==> m < (SUC n)this goal may be reduced by the tactic MATCH_MP_TAC LESS_SUC to the subgoal
([0 < m], (@n. n < m) < m)This is now in the correct form for using CONV_TAC SELECT_CONV to eliminate the epsilon term, resulting in the existentially quantified goal
([0 < m], ?n. n < m)which is then straightforward to prove.