author  wenzelm 
Tue, 11 Jul 2006 12:16:59 +0200  
changeset 20074  b4d0b545df01 
parent 18708  4b3dadb4fe33 
child 20945  1de0d565b483 
permissions  rwrr 
9532  1 
(* Title: Provers/hypsubst.ML 
0  2 
ID: $Id$ 
9532  3 
Authors: Martin D Coen, Tobias Nipkow and Lawrence C Paulson 
1011
5c9654e2e3de
Recoded with help from Toby to use rewriting instead of the
lcp
parents:
704
diff
changeset

4 
Copyright 1995 University of Cambridge 
5c9654e2e3de
Recoded with help from Toby to use rewriting instead of the
lcp
parents:
704
diff
changeset

5 

15662  6 
Basic equational reasoning: hyp_subst_tac and methods "hypsubst", "subst". 
9628  7 

8 
Tactic to substitute using (at least) the assumption x=t in the rest 

9 
of the subgoal, and to delete (at least) that assumption. Original 

10 
version due to Martin Coen. 

1011
5c9654e2e3de
Recoded with help from Toby to use rewriting instead of the
lcp
parents:
704
diff
changeset

11 

5c9654e2e3de
Recoded with help from Toby to use rewriting instead of the
lcp
parents:
704
diff
changeset

12 
This version uses the simplifier, and requires it to be already present. 
5c9654e2e3de
Recoded with help from Toby to use rewriting instead of the
lcp
parents:
704
diff
changeset

13 

5c9654e2e3de
Recoded with help from Toby to use rewriting instead of the
lcp
parents:
704
diff
changeset

14 
Test data: 
0  15 

9532  16 
Goal "!!x.[ Q(x,y,z); y=x; a=x; z=y; P(y) ] ==> P(z)"; 
17 
Goal "!!x.[ Q(x,y,z); z=f(x); x=z ] ==> P(z)"; 

18 
Goal "!!y. [ ?x=y; P(?x) ] ==> y = a"; 

19 
Goal "!!z. [ ?x=y; P(?x) ] ==> y = a"; 

1011
5c9654e2e3de
Recoded with help from Toby to use rewriting instead of the
lcp
parents:
704
diff
changeset

20 

15415
6e437e276ef5
fix to bound_hyp_subst_tac, partially fixing a bug in inductive definitions
paulson
parents:
13604
diff
changeset

21 
Goal "!!x a. [ x = f(b); g(a) = b ] ==> P(x)"; 
6e437e276ef5
fix to bound_hyp_subst_tac, partially fixing a bug in inductive definitions
paulson
parents:
13604
diff
changeset

22 

6e437e276ef5
fix to bound_hyp_subst_tac, partially fixing a bug in inductive definitions
paulson
parents:
13604
diff
changeset

23 
by (bound_hyp_subst_tac 1); 
1011
5c9654e2e3de
Recoded with help from Toby to use rewriting instead of the
lcp
parents:
704
diff
changeset

24 
by (hyp_subst_tac 1); 
5c9654e2e3de
Recoded with help from Toby to use rewriting instead of the
lcp
parents:
704
diff
changeset

25 

5c9654e2e3de
Recoded with help from Toby to use rewriting instead of the
lcp
parents:
704
diff
changeset

26 
Here hyp_subst_tac goes wrong; harder still to prove P(f(f(a))) & P(f(a)) 
9532  27 
Goal "P(a) > (EX y. a=y > P(f(a)))"; 
4466
305390f23734
Better equality handling in Blast_tac, usingd a new variant of hyp_subst_tac
paulson
parents:
4299
diff
changeset

28 

9532  29 
Goal "!!x. [ Q(x,h1); P(a,h2); R(x,y,h3); R(y,z,h4); x=f(y); \ 
4466
305390f23734
Better equality handling in Blast_tac, usingd a new variant of hyp_subst_tac
paulson
parents:
4299
diff
changeset

30 
\ P(x,h5); P(y,h6); K(x,h7) ] ==> Q(x,c)"; 
305390f23734
Better equality handling in Blast_tac, usingd a new variant of hyp_subst_tac
paulson
parents:
4299
diff
changeset

31 
by (blast_hyp_subst_tac (ref true) 1); 
0  32 
*) 
33 

34 
signature HYPSUBST_DATA = 

35 
sig 

4466
305390f23734
Better equality handling in Blast_tac, usingd a new variant of hyp_subst_tac
paulson
parents:
4299
diff
changeset

36 
val dest_Trueprop : term > term 
9532  37 
val dest_eq : term > term*term*typ 
38 
val dest_imp : term > term*term 

39 
val eq_reflection : thm (* a=b ==> a==b *) 

40 
val rev_eq_reflection: thm (* a==b ==> a=b *) 

41 
val imp_intr : thm (* (P ==> Q) ==> P>Q *) 

42 
val rev_mp : thm (* [ P; P>Q ] ==> Q *) 

43 
val subst : thm (* [ a=b; P(a) ] ==> P(b) *) 

44 
val sym : thm (* a=b ==> b=a *) 

4223  45 
val thin_refl : thm (* [x=x; PROP W] ==> PROP W *) 
4466
305390f23734
Better equality handling in Blast_tac, usingd a new variant of hyp_subst_tac
paulson
parents:
4299
diff
changeset

46 
end; 
0  47 

1011
5c9654e2e3de
Recoded with help from Toby to use rewriting instead of the
lcp
parents:
704
diff
changeset

48 

0  49 
signature HYPSUBST = 
50 
sig 

1011
5c9654e2e3de
Recoded with help from Toby to use rewriting instead of the
lcp
parents:
704
diff
changeset

51 
val bound_hyp_subst_tac : int > tactic 
5c9654e2e3de
Recoded with help from Toby to use rewriting instead of the
lcp
parents:
704
diff
changeset

52 
val hyp_subst_tac : int > tactic 
4466
305390f23734
Better equality handling in Blast_tac, usingd a new variant of hyp_subst_tac
paulson
parents:
4299
diff
changeset

53 
val blast_hyp_subst_tac : bool ref > int > tactic 
0  54 
(*exported purely for debugging purposes*) 
1011
5c9654e2e3de
Recoded with help from Toby to use rewriting instead of the
lcp
parents:
704
diff
changeset

55 
val gen_hyp_subst_tac : bool > int > tactic 
5c9654e2e3de
Recoded with help from Toby to use rewriting instead of the
lcp
parents:
704
diff
changeset

56 
val vars_gen_hyp_subst_tac : bool > int > tactic 
5c9654e2e3de
Recoded with help from Toby to use rewriting instead of the
lcp
parents:
704
diff
changeset

57 
val eq_var : bool > bool > term > int * bool 
4179
cc4b6791d5dc
hyp_subst_tac checks if the equality has type variables and uses a suitable
paulson
parents:
3537
diff
changeset

58 
val inspect_pair : bool > bool > term * term * typ > bool 
15415
6e437e276ef5
fix to bound_hyp_subst_tac, partially fixing a bug in inductive definitions
paulson
parents:
13604
diff
changeset

59 
val mk_eqs : bool > thm > thm list 
9532  60 
val stac : thm > int > tactic 
18708  61 
val hypsubst_setup : theory > theory 
0  62 
end; 
63 

2722
3e07c20b967c
Now uses rotate_tac and eta_contract_atom for greater speed
paulson
parents:
2174
diff
changeset

64 

3e07c20b967c
Now uses rotate_tac and eta_contract_atom for greater speed
paulson
parents:
2174
diff
changeset

65 

9532  66 
functor HypsubstFun(Data: HYPSUBST_DATA): HYPSUBST = 
0  67 
struct 
68 

69 
exception EQ_VAR; 

70 

17896  71 
fun loose (i,t) = member (op =) (add_loose_bnos (t, i, [])) 0; 
0  72 

16979  73 
(*Simplifier turns Bound variables to special Free variables: 
74 
change it back (any Bound variable will do)*) 

1011
5c9654e2e3de
Recoded with help from Toby to use rewriting instead of the
lcp
parents:
704
diff
changeset

75 
fun contract t = 
16979  76 
(case Pattern.eta_contract_atom t of 
20074  77 
Free (a, T) => if Name.is_bound a then Bound 0 else Free (a, T) 
16979  78 
 t' => t'); 
1011
5c9654e2e3de
Recoded with help from Toby to use rewriting instead of the
lcp
parents:
704
diff
changeset

79 

5c9654e2e3de
Recoded with help from Toby to use rewriting instead of the
lcp
parents:
704
diff
changeset

80 
fun has_vars t = maxidx_of_term t <> ~1; 
5c9654e2e3de
Recoded with help from Toby to use rewriting instead of the
lcp
parents:
704
diff
changeset

81 

5c9654e2e3de
Recoded with help from Toby to use rewriting instead of the
lcp
parents:
704
diff
changeset

82 
(*If novars then we forbid Vars in the equality. 
16979  83 
If bnd then we only look for Bound variables to eliminate. 
1011
5c9654e2e3de
Recoded with help from Toby to use rewriting instead of the
lcp
parents:
704
diff
changeset

84 
When can we safely delete the equality? 
5c9654e2e3de
Recoded with help from Toby to use rewriting instead of the
lcp
parents:
704
diff
changeset

85 
Not if it equates two constants; consider 0=1. 
5c9654e2e3de
Recoded with help from Toby to use rewriting instead of the
lcp
parents:
704
diff
changeset

86 
Not if it resembles x=t[x], since substitution does not eliminate x. 
4299  87 
Not if it resembles ?x=0; consider ?x=0 ==> ?x=1 or even ?x=0 ==> P 
9532  88 
Not if it involves a variable free in the premises, 
1011
5c9654e2e3de
Recoded with help from Toby to use rewriting instead of the
lcp
parents:
704
diff
changeset

89 
but we can't check for this  hence bnd and bound_hyp_subst_tac 
5c9654e2e3de
Recoded with help from Toby to use rewriting instead of the
lcp
parents:
704
diff
changeset

90 
Prefer to eliminate Bound variables if possible. 
5c9654e2e3de
Recoded with help from Toby to use rewriting instead of the
lcp
parents:
704
diff
changeset

91 
Result: true = use as is, false = reorient first *) 
4179
cc4b6791d5dc
hyp_subst_tac checks if the equality has type variables and uses a suitable
paulson
parents:
3537
diff
changeset

92 
fun inspect_pair bnd novars (t,u,T) = 
9532  93 
if novars andalso maxidx_of_typ T <> ~1 
4179
cc4b6791d5dc
hyp_subst_tac checks if the equality has type variables and uses a suitable
paulson
parents:
3537
diff
changeset

94 
then raise Match (*variables in the type!*) 
cc4b6791d5dc
hyp_subst_tac checks if the equality has type variables and uses a suitable
paulson
parents:
3537
diff
changeset

95 
else 
1011
5c9654e2e3de
Recoded with help from Toby to use rewriting instead of the
lcp
parents:
704
diff
changeset

96 
case (contract t, contract u) of 
9532  97 
(Bound i, _) => if loose(i,u) orelse novars andalso has_vars u 
98 
then raise Match 

99 
else true (*eliminates t*) 

100 
 (_, Bound i) => if loose(i,t) orelse novars andalso has_vars t 

101 
then raise Match 

102 
else false (*eliminates u*) 

103 
 (Free _, _) => if bnd orelse Logic.occs(t,u) orelse 

104 
novars andalso has_vars u 

105 
then raise Match 

106 
else true (*eliminates t*) 

107 
 (_, Free _) => if bnd orelse Logic.occs(u,t) orelse 

108 
novars andalso has_vars t 

109 
then raise Match 

110 
else false (*eliminates u*) 

0  111 
 _ => raise Match; 
112 

680
f9e24455bbd1
Provers/hypsubst: greatly simplified! No longer simulates a
lcp
parents:
646
diff
changeset

113 
(*Locates a substitutable variable on the left (resp. right) of an equality 
1011
5c9654e2e3de
Recoded with help from Toby to use rewriting instead of the
lcp
parents:
704
diff
changeset

114 
assumption. Returns the number of intervening assumptions. *) 
5c9654e2e3de
Recoded with help from Toby to use rewriting instead of the
lcp
parents:
704
diff
changeset

115 
fun eq_var bnd novars = 
680
f9e24455bbd1
Provers/hypsubst: greatly simplified! No longer simulates a
lcp
parents:
646
diff
changeset

116 
let fun eq_var_aux k (Const("all",_) $ Abs(_,_,t)) = eq_var_aux k t 
9532  117 
 eq_var_aux k (Const("==>",_) $ A $ B) = 
118 
((k, inspect_pair bnd novars 

119 
(Data.dest_eq (Data.dest_Trueprop A))) 

120 
(*Exception comes from inspect_pair or dest_eq*) 

121 
handle _ => eq_var_aux (k+1) B) 

122 
 eq_var_aux k _ = raise EQ_VAR 

680
f9e24455bbd1
Provers/hypsubst: greatly simplified! No longer simulates a
lcp
parents:
646
diff
changeset

123 
in eq_var_aux 0 end; 
0  124 

1011
5c9654e2e3de
Recoded with help from Toby to use rewriting instead of the
lcp
parents:
704
diff
changeset

125 
(*For the simpset. Adds ALL suitable equalities, even if not first! 
5c9654e2e3de
Recoded with help from Toby to use rewriting instead of the
lcp
parents:
704
diff
changeset

126 
No vars are allowed here, as simpsets are built from metaassumptions*) 
15415
6e437e276ef5
fix to bound_hyp_subst_tac, partially fixing a bug in inductive definitions
paulson
parents:
13604
diff
changeset

127 
fun mk_eqs bnd th = 
6e437e276ef5
fix to bound_hyp_subst_tac, partially fixing a bug in inductive definitions
paulson
parents:
13604
diff
changeset

128 
[ if inspect_pair bnd false (Data.dest_eq 
9532  129 
(Data.dest_Trueprop (#prop (rep_thm th)))) 
1011
5c9654e2e3de
Recoded with help from Toby to use rewriting instead of the
lcp
parents:
704
diff
changeset

130 
then th RS Data.eq_reflection 
9532  131 
else symmetric(th RS Data.eq_reflection) (*reorient*) ] 
4466
305390f23734
Better equality handling in Blast_tac, usingd a new variant of hyp_subst_tac
paulson
parents:
4299
diff
changeset

132 
handle _ => []; (*Exception comes from inspect_pair or dest_eq*) 
1011
5c9654e2e3de
Recoded with help from Toby to use rewriting instead of the
lcp
parents:
704
diff
changeset

133 

17896  134 
local 
1011
5c9654e2e3de
Recoded with help from Toby to use rewriting instead of the
lcp
parents:
704
diff
changeset

135 
in 
5c9654e2e3de
Recoded with help from Toby to use rewriting instead of the
lcp
parents:
704
diff
changeset

136 

15415
6e437e276ef5
fix to bound_hyp_subst_tac, partially fixing a bug in inductive definitions
paulson
parents:
13604
diff
changeset

137 
(*Select a suitable equality assumption; substitute throughout the subgoal 
6e437e276ef5
fix to bound_hyp_subst_tac, partially fixing a bug in inductive definitions
paulson
parents:
13604
diff
changeset

138 
If bnd is true, then it replaces Bound variables only. *) 
13604  139 
fun gen_hyp_subst_tac bnd = 
17896  140 
let fun tac i st = SUBGOAL (fn (Bi, _) => 
141 
let 

142 
val (k, _) = eq_var bnd true Bi 

143 
val hyp_subst_ss = Simplifier.theory_context (Thm.theory_of_thm st) empty_ss 

144 
setmksimps (mk_eqs bnd) 

13604  145 
in EVERY [rotate_tac k i, asm_lr_simp_tac hyp_subst_ss i, 
146 
etac thin_rl i, rotate_tac (~k) i] 

17896  147 
end handle THM _ => no_tac  EQ_VAR => no_tac) i st 
13604  148 
in REPEAT_DETERM1 o tac end; 
1011
5c9654e2e3de
Recoded with help from Toby to use rewriting instead of the
lcp
parents:
704
diff
changeset

149 

5c9654e2e3de
Recoded with help from Toby to use rewriting instead of the
lcp
parents:
704
diff
changeset

150 
end; 
5c9654e2e3de
Recoded with help from Toby to use rewriting instead of the
lcp
parents:
704
diff
changeset

151 

4466
305390f23734
Better equality handling in Blast_tac, usingd a new variant of hyp_subst_tac
paulson
parents:
4299
diff
changeset

152 
val ssubst = standard (Data.sym RS Data.subst); 
305390f23734
Better equality handling in Blast_tac, usingd a new variant of hyp_subst_tac
paulson
parents:
4299
diff
changeset

153 

305390f23734
Better equality handling in Blast_tac, usingd a new variant of hyp_subst_tac
paulson
parents:
4299
diff
changeset

154 
val imp_intr_tac = rtac Data.imp_intr; 
1011
5c9654e2e3de
Recoded with help from Toby to use rewriting instead of the
lcp
parents:
704
diff
changeset

155 

5c9654e2e3de
Recoded with help from Toby to use rewriting instead of the
lcp
parents:
704
diff
changeset

156 
(*Old version of the tactic above  slower but the only way 
5c9654e2e3de
Recoded with help from Toby to use rewriting instead of the
lcp
parents:
704
diff
changeset

157 
to handle equalities containing Vars.*) 
3537  158 
fun vars_gen_hyp_subst_tac bnd = SUBGOAL(fn (Bi,i) => 
159 
let val n = length(Logic.strip_assums_hyp Bi)  1 

9532  160 
val (k,symopt) = eq_var bnd false Bi 
161 
in 

162 
DETERM 

4466
305390f23734
Better equality handling in Blast_tac, usingd a new variant of hyp_subst_tac
paulson
parents:
4299
diff
changeset

163 
(EVERY [REPEAT_DETERM_N k (etac Data.rev_mp i), 
9532  164 
rotate_tac 1 i, 
165 
REPEAT_DETERM_N (nk) (etac Data.rev_mp i), 

166 
etac (if symopt then ssubst else Data.subst) i, 

167 
REPEAT_DETERM_N n (imp_intr_tac i THEN rotate_tac ~1 i)]) 

0  168 
end 
3537  169 
handle THM _ => no_tac  EQ_VAR => no_tac); 
0  170 

171 
(*Substitutes for Free or Bound variables*) 

4466
305390f23734
Better equality handling in Blast_tac, usingd a new variant of hyp_subst_tac
paulson
parents:
4299
diff
changeset

172 
val hyp_subst_tac = FIRST' [ematch_tac [Data.thin_refl], 
4223  173 
gen_hyp_subst_tac false, vars_gen_hyp_subst_tac false]; 
0  174 

175 
(*Substitutes for Bound variables only  this is always safe*) 

9532  176 
val bound_hyp_subst_tac = 
1011
5c9654e2e3de
Recoded with help from Toby to use rewriting instead of the
lcp
parents:
704
diff
changeset

177 
gen_hyp_subst_tac true ORELSE' vars_gen_hyp_subst_tac true; 
0  178 

4466
305390f23734
Better equality handling in Blast_tac, usingd a new variant of hyp_subst_tac
paulson
parents:
4299
diff
changeset

179 

9532  180 
(** Version for Blast_tac. Hyps that are affected by the substitution are 
4466
305390f23734
Better equality handling in Blast_tac, usingd a new variant of hyp_subst_tac
paulson
parents:
4299
diff
changeset

181 
moved to the front. Defect: even trivial changes are noticed, such as 
305390f23734
Better equality handling in Blast_tac, usingd a new variant of hyp_subst_tac
paulson
parents:
4299
diff
changeset

182 
substitutions in the arguments of a function Var. **) 
305390f23734
Better equality handling in Blast_tac, usingd a new variant of hyp_subst_tac
paulson
parents:
4299
diff
changeset

183 

305390f23734
Better equality handling in Blast_tac, usingd a new variant of hyp_subst_tac
paulson
parents:
4299
diff
changeset

184 
(*final rereversal of the changed assumptions*) 
305390f23734
Better equality handling in Blast_tac, usingd a new variant of hyp_subst_tac
paulson
parents:
4299
diff
changeset

185 
fun reverse_n_tac 0 i = all_tac 
305390f23734
Better equality handling in Blast_tac, usingd a new variant of hyp_subst_tac
paulson
parents:
4299
diff
changeset

186 
 reverse_n_tac 1 i = rotate_tac ~1 i 
9532  187 
 reverse_n_tac n i = 
4466
305390f23734
Better equality handling in Blast_tac, usingd a new variant of hyp_subst_tac
paulson
parents:
4299
diff
changeset

188 
REPEAT_DETERM_N n (rotate_tac ~1 i THEN etac Data.rev_mp i) THEN 
305390f23734
Better equality handling in Blast_tac, usingd a new variant of hyp_subst_tac
paulson
parents:
4299
diff
changeset

189 
REPEAT_DETERM_N n (imp_intr_tac i THEN rotate_tac ~1 i); 
305390f23734
Better equality handling in Blast_tac, usingd a new variant of hyp_subst_tac
paulson
parents:
4299
diff
changeset

190 

305390f23734
Better equality handling in Blast_tac, usingd a new variant of hyp_subst_tac
paulson
parents:
4299
diff
changeset

191 
(*Use imp_intr, comparing the old hyps with the new ones as they come out.*) 
9532  192 
fun all_imp_intr_tac hyps i = 
4466
305390f23734
Better equality handling in Blast_tac, usingd a new variant of hyp_subst_tac
paulson
parents:
4299
diff
changeset

193 
let fun imptac (r, []) st = reverse_n_tac r i st 
9532  194 
 imptac (r, hyp::hyps) st = 
195 
let val (hyp',_) = List.nth (prems_of st, i1) > 

196 
Logic.strip_assums_concl > 

197 
Data.dest_Trueprop > Data.dest_imp 

198 
val (r',tac) = if Pattern.aeconv (hyp,hyp') 

199 
then (r, imp_intr_tac i THEN rotate_tac ~1 i) 

200 
else (*leave affected hyps at end*) 

201 
(r+1, imp_intr_tac i) 

202 
in 

203 
case Seq.pull(tac st) of 

15531  204 
NONE => Seq.single(st) 
205 
 SOME(st',_) => imptac (r',hyps) st' 

9532  206 
end handle _ => error "?? in blast_hyp_subst_tac" 
4466
305390f23734
Better equality handling in Blast_tac, usingd a new variant of hyp_subst_tac
paulson
parents:
4299
diff
changeset

207 
in imptac (0, rev hyps) end; 
305390f23734
Better equality handling in Blast_tac, usingd a new variant of hyp_subst_tac
paulson
parents:
4299
diff
changeset

208 

305390f23734
Better equality handling in Blast_tac, usingd a new variant of hyp_subst_tac
paulson
parents:
4299
diff
changeset

209 

305390f23734
Better equality handling in Blast_tac, usingd a new variant of hyp_subst_tac
paulson
parents:
4299
diff
changeset

210 
fun blast_hyp_subst_tac trace = SUBGOAL(fn (Bi,i) => 
305390f23734
Better equality handling in Blast_tac, usingd a new variant of hyp_subst_tac
paulson
parents:
4299
diff
changeset

211 
let val (k,symopt) = eq_var false false Bi 
9532  212 
val hyps0 = map Data.dest_Trueprop (Logic.strip_assums_hyp Bi) 
4466
305390f23734
Better equality handling in Blast_tac, usingd a new variant of hyp_subst_tac
paulson
parents:
4299
diff
changeset

213 
(*omit selected equality, returning other hyps*) 
9532  214 
val hyps = List.take(hyps0, k) @ List.drop(hyps0, k+1) 
215 
val n = length hyps 

216 
in 

12262  217 
if !trace then tracing "Substituting an equality" else (); 
9532  218 
DETERM 
4466
305390f23734
Better equality handling in Blast_tac, usingd a new variant of hyp_subst_tac
paulson
parents:
4299
diff
changeset

219 
(EVERY [REPEAT_DETERM_N k (etac Data.rev_mp i), 
9532  220 
rotate_tac 1 i, 
221 
REPEAT_DETERM_N (nk) (etac Data.rev_mp i), 

222 
etac (if symopt then ssubst else Data.subst) i, 

223 
all_imp_intr_tac hyps i]) 

4466
305390f23734
Better equality handling in Blast_tac, usingd a new variant of hyp_subst_tac
paulson
parents:
4299
diff
changeset

224 
end 
305390f23734
Better equality handling in Blast_tac, usingd a new variant of hyp_subst_tac
paulson
parents:
4299
diff
changeset

225 
handle THM _ => no_tac  EQ_VAR => no_tac); 
305390f23734
Better equality handling in Blast_tac, usingd a new variant of hyp_subst_tac
paulson
parents:
4299
diff
changeset

226 

9532  227 

228 
(*apply an equality or definition ONCE; 

229 
fails unless the substitution has an effect*) 

230 
fun stac th = 

231 
let val th' = th RS Data.rev_eq_reflection handle THM _ => th 

232 
in CHANGED_GOAL (rtac (th' RS ssubst)) end; 

233 

234 

9628  235 
(* proof methods *) 
9532  236 

9705  237 
val subst_meth = Method.thm_args (Method.SIMPLE_METHOD' HEADGOAL o stac); 
10821  238 
val hyp_subst_meth = 
239 
Method.no_args (Method.SIMPLE_METHOD' HEADGOAL (CHANGED_PROP o hyp_subst_tac)); 

9532  240 

9628  241 

242 
(* theory setup *) 

243 

9532  244 
val hypsubst_setup = 
18708  245 
Method.add_methods 
246 
[("hypsubst", hyp_subst_meth, "substitution using an assumption (improper)"), 

247 
("simplesubst", subst_meth, "simple substitution")]; 

9532  248 

0  249 
end; 