nipkow [Thu, 30 Oct 1997 09:46:11 +0100] rev 4033
Updated proofs
nipkow [Thu, 30 Oct 1997 09:45:03 +0100] rev 4032
For each datatype `t' there is now a theorem `split_t_case' of the form
P(t_case f1 ... fn x) = ((!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1))&
...
(!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn)))
The simplifier now reduces !x. (..x.. & x = t & ..x..) --> P x
to (..t.. & ..t..) --> P t
(and similarly for t=x).
wenzelm [Wed, 29 Oct 1997 16:03:19 +0100] rev 4031
fixed spaces in qed;
oheimb [Wed, 29 Oct 1997 14:23:49 +0100] rev 4030
debugging concerning sort variables
theorems are now proved immediately after generating the syntax
wenzelm [Tue, 28 Oct 1997 17:58:35 +0100] rev 4029
PureThy.add_store_axioms_i;
wenzelm [Tue, 28 Oct 1997 17:58:08 +0100] rev 4028
PureThy.add_store_defs_i, PureThy.add_store_axioms_i;
wenzelm [Tue, 28 Oct 1997 17:56:57 +0100] rev 4027
PureThy.add_store_defs_i;
wenzelm [Tue, 28 Oct 1997 17:56:15 +0100] rev 4026
PureThy.add_store_axioms;
wenzelm [Tue, 28 Oct 1997 17:41:40 +0100] rev 4025
fixed qed;
wenzelm [Tue, 28 Oct 1997 17:41:15 +0100] rev 4024
do not change global_names flag;