2001-10-31 agoAdditional rules for simplifying inside "Goal"
berghofe [Wed, 31 Oct 2001 20:00:35 +0100] rev 12002
Additional rules for simplifying inside "Goal"

2001-10-31 ago- Tuned add_cnstrt
berghofe [Wed, 31 Oct 2001 19:59:21 +0100] rev 12001
- Tuned add_cnstrt
- Fixed bug in reconstruct_proof that caused infinite loop

2001-10-31 agoRemoved name_thm from finish_global.
berghofe [Wed, 31 Oct 2001 19:49:36 +0100] rev 12000
Removed name_thm from finish_global.

2001-10-31 agoTuned function thm_proof.
berghofe [Wed, 31 Oct 2001 19:41:29 +0100] rev 11999
Tuned function thm_proof.

2001-10-31 ago- enter_thmx -> enter_thms
berghofe [Wed, 31 Oct 2001 19:37:04 +0100] rev 11998
- enter_thmx -> enter_thms
- improved naming of theorems: enter_thms now takes functions pre_name and post_name
as arguments

2001-10-31 agonorm_hhf_eq is now stored using open_store_standard_thm.
berghofe [Wed, 31 Oct 2001 19:32:05 +0100] rev 11997
norm_hhf_eq is now stored using open_store_standard_thm.

2001-10-31 agoinduct: internalize ``missing'' consumes-facts from goal state
wenzelm [Wed, 31 Oct 2001 01:28:39 +0100] rev 11996
induct: internalize ``missing'' consumes-facts from goal state
(enables unstructured scripts to perform elim-style induction);

2001-10-31 ago- 'induct' may now use elim-style induction rules without chaining
wenzelm [Wed, 31 Oct 2001 01:27:04 +0100] rev 11995
- 'induct' may now use elim-style induction rules without chaining
facts, using ``missing'' premises from the goal state; this allows
rules stemming from inductive sets to be applied in unstructured
scripts, while still benefitting from proper handling of non-atomic
statements; NB: major inductive premises need to be put first, all the
rest of the goal is passed through the induction;

2001-10-31 ago(induct set: ...);
wenzelm [Wed, 31 Oct 2001 01:26:42 +0100] rev 11994
(induct set: ...);

2001-10-31 agoput_consumes: really overwrite existing tag;
wenzelm [Wed, 31 Oct 2001 01:22:27 +0100] rev 11993
put_consumes: really overwrite existing tag;