src/FOLP/simp.ML
changeset 13105 3d1e7a199bdc
parent 7645 c67115c0e105
child 14643 130076a81b84
     1.1 --- a/src/FOLP/simp.ML	Tue May 07 14:24:30 2002 +0200
     1.2 +++ b/src/FOLP/simp.ML	Tue May 07 14:26:32 2002 +0200
     1.3 @@ -64,7 +64,7 @@
     1.4  
     1.5  (*** Indexing and filtering of theorems ***)
     1.6  
     1.7 -fun eq_brl ((b1,th1),(b2,th2)) = b1=b2 andalso eq_thm(th1,th2);
     1.8 +fun eq_brl ((b1,th1),(b2,th2)) = b1=b2 andalso Drule.eq_thm_prop (th1,th2);
     1.9  
    1.10  (*insert a thm in a discrimination net by its lhs*)
    1.11  fun lhs_insert_thm (th,net) =
    1.12 @@ -247,7 +247,7 @@
    1.13  
    1.14  (*insert a thm in a thm net*)
    1.15  fun insert_thm_warn (th,net) = 
    1.16 -  Net.insert_term((concl_of th, th), net, eq_thm)
    1.17 +  Net.insert_term((concl_of th, th), net, Drule.eq_thm_prop)
    1.18    handle Net.INSERT => 
    1.19      (writeln"\nDuplicate rewrite or congruence rule:"; print_thm th;
    1.20       net);
    1.21 @@ -273,7 +273,7 @@
    1.22  
    1.23  (*delete a thm from a thm net*)
    1.24  fun delete_thm_warn (th,net) = 
    1.25 -  Net.delete_term((concl_of th, th), net, eq_thm)
    1.26 +  Net.delete_term((concl_of th, th), net, Drule.eq_thm_prop)
    1.27    handle Net.DELETE => 
    1.28      (writeln"\nNo such rewrite or congruence rule:";  print_thm th;
    1.29       net);
    1.30 @@ -281,7 +281,7 @@
    1.31  val delete_thms = foldr delete_thm_warn;
    1.32  
    1.33  fun op delcongs(SS{auto_tac,congs,cong_net,mk_simps,simps,simp_net}, thms) =
    1.34 -let val congs' = foldl (gen_rem eq_thm) (congs,thms)
    1.35 +let val congs' = foldl (gen_rem Drule.eq_thm_prop) (congs,thms)
    1.36  in SS{auto_tac=auto_tac, congs= congs',
    1.37        cong_net= delete_thms(map mk_trans thms,cong_net),
    1.38        mk_simps= normed_rews congs', simps=simps, simp_net=simp_net}
    1.39 @@ -289,7 +289,7 @@
    1.40  
    1.41  fun delrew(SS{auto_tac,congs,cong_net,mk_simps,simps,simp_net}, thm) =
    1.42  let fun find((p as (th,ths))::ps',ps) =
    1.43 -          if eq_thm(thm,th) then (ths,ps@ps') else find(ps',p::ps)
    1.44 +          if Drule.eq_thm_prop(thm,th) then (ths,ps@ps') else find(ps',p::ps)
    1.45        | find([],simps') = (writeln"\nNo such rewrite or congruence rule:";
    1.46                             print_thm thm;
    1.47                             ([],simps'))