simpLib.SIMP_PROVE : simpset -> thm list -> term -> thm
SYNOPSIS
Like SIMP_CONV, but converts boolean terms to theorem with same conclusion.
LIBRARY
simpLib
DESCRIBE
SIMP_PROVE ss thml is equivalent to EQT_ELIM o SIMP_CONV ss thml.
FAILURE
Fails if the term can not be shown to be equivalent to true. May
diverge.
EXAMPLE
Using SIMP_PROVE here allows ASSUME_TAC to add a new fact, where
the equality with truth that SIMP_CONV would produce would be less
useful.
- ASSUME_TAC (SIMP_PROVE hol_ss [] ``x < y ==> x < y + 6``)
([], ``x + y = 10``)
> val it =
([([`x < y ==> x < y + 6`], `x + y = 10`)], fn)
: tactic_result
USES
SIMP_PROVE is useful when constructing theorems to be passed to
other tools, where those other tools would prefer not to have
theorems of the form |- P = T.