wenzelm [Thu, 24 Apr 1997 19:41:00 +0200] rev 3046
adapted to SML/NJ 1.09.27;
minor cleanup;
nipkow [Thu, 24 Apr 1997 19:08:32 +0200] rev 3045
Added 'induct_tac'
nipkow [Thu, 24 Apr 1997 18:51:14 +0200] rev 3044
Updates because nat_ind_tac no longer appends "1" to the ind.var.
wenzelm [Thu, 24 Apr 1997 18:44:32 +0200] rev 3043
removed space;
nipkow [Thu, 24 Apr 1997 18:38:30 +0200] rev 3042
induct_tac
mueller [Thu, 24 Apr 1997 18:07:35 +0200] rev 3041
expandshort
nipkow [Thu, 24 Apr 1997 18:06:46 +0200] rev 3040
Introduced a generic "induct_tac" which picks up the right induction scheme
automatically. Also changed nat_ind_tac, which does no longer append a "1" to
the name of the induction variable. This caused some changes...
nipkow [Thu, 24 Apr 1997 18:03:23 +0200] rev 3039
get_thydata accesses the second component of the data field. This component
used to be empty until set at the end of loading an ML file. Now the second
component is already set when the thy file has ben read.
mueller [Thu, 24 Apr 1997 18:00:22 +0200] rev 3038
Main changes are:
- Lemmas for blift and plift are deleted
- added split_tac for If (via If2, as If does not begin with a constant)
- added new lemmata relating TT, FF and booleans:
Def_bool1, Def_bool2, Def_bool3,Def_bool4
They are added to !simpset, but should not cause difficulties
- added lemma andalso_or relating | on booleans and andalso on truth values
- deleted If_and_if and andalso from !simpset: Pay attention, may kill your proofs!
- added adm lemmas for (f x)~=TT and (f x)~=FF.
nipkow [Thu, 24 Apr 1997 17:59:55 +0200] rev 3037
rename_params_rule used to check if the new name clashed with a free name in
the whole goal state. Now checks only the subgoal concerned.
mueller [Thu, 24 Apr 1997 17:51:27 +0200] rev 3036
deleted definitions for blift and plift
mueller [Thu, 24 Apr 1997 17:50:34 +0200] rev 3035
Complete Redesign of Theory, main points are:
- Extension of the continuity prover:
* Lemmas about continuity of flift1 and flift2 are generalized
* Lemmas about continuity of mixed definitions of HOL and LCF terms generalized
Pay attention: Sometimes proofs are shorter now!
- a number of new lemmas concerning flift1, flift2, Def and Undef,
Def_less_is_eq (Def x << y = (Def x = y)) and lemmas characterizing flift1 and flift2
are added to !simpset
Pay attention: Sometimes proofs are shorter now!
- added tactic def_tac for eliminating x~=UU in assumptions