# HG changeset patch
# User clasohm
# Date 794231286 -3600
# Node ID 305e7cfda8693bdbf487af8e6803b276c6849e0a
# Parent  9d1348498c366d537d858ce451debc45b88731ee
replaced Pure by ProtoPure

diff -r 9d1348498c36 -r 305e7cfda869 src/Provers/genelim.ML
--- a/src/Provers/genelim.ML	Fri Mar 03 12:34:57 1995 +0100
+++ b/src/Provers/genelim.ML	Fri Mar 03 12:48:06 1995 +0100
@@ -1,7 +1,7 @@
 (** Generalized elimination rules **)
 
 (*Generalized elimination for two conclusions*)
-val prems = goal pure_thy 
+val prems = goal proto_pure_thy 
      "[| PROP U ==> PROP VA;  \
 \        PROP U ==> PROP VB;  \
 \        PROP U;              \
diff -r 9d1348498c36 -r 305e7cfda869 src/Provers/splitter.ML
--- a/src/Provers/splitter.ML	Fri Mar 03 12:34:57 1995 +0100
+++ b/src/Provers/splitter.ML	Fri Mar 03 12:48:06 1995 +0100
@@ -19,9 +19,10 @@
 fun mk_case_split_tac iffD =
 let
 
-val lift = prove_goal Pure.thy
-  "[| !!x::'b::logic. Q(x) == R(x) |] ==> P(%x.Q(x)) == P(%x.R(x))::'a::logic"
-  (fn [prem] => [rewtac prem, rtac reflexive_thm 1]);
+val lift = prove_goalw_cterm [] (cterm_of (sign_of (theory_of_thm iffD))
+             (read "[| !!x::'b::logic. Q(x) == R(x) |] ==> \
+                   \P(%x.Q(x)) == P(%x.R(x))::'a::logic"))
+             (fn [prem] => [rewtac prem, rtac reflexive_thm 1]);
 
 val trlift = lift RS transitive_thm;
 val _ $ (Var(P,PT)$_) $ _ = concl_of trlift;