Wed, 31 Oct 2001 01:21:01 +0100 use induct_rulify2;
wenzelm [Wed, 31 Oct 2001 01:21:01 +0100] rev 11990
use induct_rulify2;
Wed, 31 Oct 2001 01:20:42 +0100 renamed inductive_XXX to induct_XXX;
wenzelm [Wed, 31 Oct 2001 01:20:42 +0100] rev 11989
renamed inductive_XXX to induct_XXX; added induct_impliesI;
Wed, 31 Oct 2001 01:19:58 +0100 induct_impliesI;
wenzelm [Wed, 31 Oct 2001 01:19:58 +0100] rev 11988
induct_impliesI;
Tue, 30 Oct 2001 17:37:25 +0100 tuned induct proofs;
wenzelm [Tue, 30 Oct 2001 17:37:25 +0100] rev 11987
tuned induct proofs;
Tue, 30 Oct 2001 17:33:56 +0100 - 'induct' method now derives symbolic cases from the *rulified* rule
wenzelm [Tue, 30 Oct 2001 17:33:56 +0100] rev 11986
- 'induct' method now derives symbolic cases from the *rulified* rule (before it used to rulify cases stemming from the internal atomized version); this means that the context of a non-atomic statement becomes is included in the hypothesis, avoiding the slightly cumbersome show "PROP ?case" form;
Tue, 30 Oct 2001 17:33:03 +0100 tuned;
wenzelm [Tue, 30 Oct 2001 17:33:03 +0100] rev 11985
tuned;
Tue, 30 Oct 2001 17:30:21 +0100 induct: cases are extracted from rulified rule;
wenzelm [Tue, 30 Oct 2001 17:30:21 +0100] rev 11984
induct: cases are extracted from rulified rule;
Tue, 30 Oct 2001 17:29:43 +0100 removed obsolete make_raw;
wenzelm [Tue, 30 Oct 2001 17:29:43 +0100] rev 11983
removed obsolete make_raw;
Tue, 30 Oct 2001 13:43:26 +0100 lemma Least_mono moved from Typedef.thy to Set.thy;
wenzelm [Tue, 30 Oct 2001 13:43:26 +0100] rev 11982
lemma Least_mono moved from Typedef.thy to Set.thy;
Mon, 29 Oct 2001 17:22:18 +0100 tuned;
wenzelm [Mon, 29 Oct 2001 17:22:18 +0100] rev 11981
tuned;
(0) -10000 -3000 -1000 -300 -100 -10 +10 +100 +300 +1000 +3000 +10000 +30000 tip