wenzelm@16978
|
1 |
(* -=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=- *)
|
dixon@15538
|
2 |
(* Title: Provers/eqsubst.ML
|
wenzelm@16434
|
3 |
ID: $Id$
|
paulson@15481
|
4 |
Author: Lucas Dixon, University of Edinburgh
|
paulson@15481
|
5 |
lucas.dixon@ed.ac.uk
|
wenzelm@16978
|
6 |
Modified: 18 Feb 2005 - Lucas -
|
paulson@15481
|
7 |
Created: 29 Jan 2005
|
paulson@15481
|
8 |
*)
|
wenzelm@16978
|
9 |
(* -=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=- *)
|
paulson@15481
|
10 |
(* DESCRIPTION:
|
paulson@15481
|
11 |
|
paulson@15481
|
12 |
A Tactic to perform a substiution using an equation.
|
paulson@15481
|
13 |
|
paulson@15481
|
14 |
*)
|
paulson@15481
|
15 |
(* -=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=- *)
|
paulson@15481
|
16 |
|
dixon@16004
|
17 |
|
dixon@16004
|
18 |
|
dixon@15538
|
19 |
(* Logic specific data stub *)
|
paulson@15481
|
20 |
signature EQRULE_DATA =
|
paulson@15481
|
21 |
sig
|
dixon@15538
|
22 |
|
paulson@15481
|
23 |
(* to make a meta equality theorem in the current logic *)
|
paulson@15481
|
24 |
val prep_meta_eq : thm -> thm list
|
dixon@15538
|
25 |
|
paulson@15481
|
26 |
end;
|
paulson@15481
|
27 |
|
dixon@15538
|
28 |
|
paulson@15481
|
29 |
(* the signature of an instance of the SQSUBST tactic *)
|
wenzelm@16978
|
30 |
signature EQSUBST_TAC =
|
paulson@15481
|
31 |
sig
|
dixon@15538
|
32 |
|
wenzelm@16978
|
33 |
exception eqsubst_occL_exp of
|
wenzelm@16978
|
34 |
string * (int list) * (thm list) * int * thm;
|
dixon@15959
|
35 |
|
dixon@16004
|
36 |
|
wenzelm@16978
|
37 |
type match =
|
wenzelm@16978
|
38 |
((indexname * (sort * typ)) list (* type instantiations *)
|
wenzelm@16978
|
39 |
* (indexname * (typ * term)) list) (* term instantiations *)
|
wenzelm@16978
|
40 |
* (string * typ) list (* fake named type abs env *)
|
wenzelm@16978
|
41 |
* (string * typ) list (* type abs env *)
|
wenzelm@16978
|
42 |
* term (* outer term *)
|
dixon@15550
|
43 |
|
wenzelm@16978
|
44 |
type searchinfo =
|
wenzelm@16978
|
45 |
theory (* sign for matching *)
|
dixon@16004
|
46 |
* int (* maxidx *)
|
dixon@16004
|
47 |
* BasicIsaFTerm.FcTerm (* focusterm to search under *)
|
dixon@16004
|
48 |
|
dixon@15538
|
49 |
val prep_subst_in_asm :
|
dixon@16004
|
50 |
int (* subgoal to subst in *)
|
wenzelm@16978
|
51 |
-> thm (* target theorem with subgoals *)
|
dixon@15538
|
52 |
-> int (* premise to subst in *)
|
wenzelm@16978
|
53 |
-> (cterm list (* certified free var placeholders for vars *)
|
dixon@15538
|
54 |
* int (* premice no. to subst *)
|
dixon@15538
|
55 |
* int (* number of assumptions of premice *)
|
wenzelm@16978
|
56 |
* thm) (* premice as a new theorem for forward reasoning *)
|
dixon@16004
|
57 |
* searchinfo (* search info: prem id etc *)
|
dixon@15538
|
58 |
|
dixon@15538
|
59 |
val prep_subst_in_asms :
|
dixon@16004
|
60 |
int (* subgoal to subst in *)
|
wenzelm@16978
|
61 |
-> thm (* target theorem with subgoals *)
|
wenzelm@16978
|
62 |
-> ((cterm list (* certified free var placeholders for vars *)
|
dixon@15538
|
63 |
* int (* premice no. to subst *)
|
dixon@15538
|
64 |
* int (* number of assumptions of premice *)
|
wenzelm@16978
|
65 |
* thm) (* premice as a new theorem for forward reasoning *)
|
dixon@16004
|
66 |
* searchinfo) list
|
dixon@15538
|
67 |
|
dixon@15538
|
68 |
val apply_subst_in_asm :
|
dixon@15538
|
69 |
int (* subgoal *)
|
wenzelm@16978
|
70 |
-> thm (* overall theorem *)
|
wenzelm@16978
|
71 |
-> thm (* rule *)
|
wenzelm@16978
|
72 |
-> (cterm list (* certified free var placeholders for vars *)
|
dixon@15538
|
73 |
* int (* assump no being subst *)
|
wenzelm@16978
|
74 |
* int (* num of premises of asm *)
|
wenzelm@16978
|
75 |
* thm) (* premthm *)
|
dixon@16004
|
76 |
* match
|
wenzelm@16978
|
77 |
-> thm Seq.seq
|
dixon@15538
|
78 |
|
dixon@15538
|
79 |
val prep_concl_subst :
|
dixon@16004
|
80 |
int (* subgoal *)
|
wenzelm@16978
|
81 |
-> thm (* overall goal theorem *)
|
wenzelm@16978
|
82 |
-> (cterm list * thm) * searchinfo (* (cvfs, conclthm), matchf *)
|
dixon@15538
|
83 |
|
dixon@15538
|
84 |
val apply_subst_in_concl :
|
dixon@15538
|
85 |
int (* subgoal *)
|
wenzelm@16978
|
86 |
-> thm (* thm with all goals *)
|
wenzelm@16978
|
87 |
-> cterm list (* certified free var placeholders for vars *)
|
wenzelm@16978
|
88 |
* thm (* trivial thm of goal concl *)
|
dixon@15538
|
89 |
(* possible matches/unifiers *)
|
wenzelm@16978
|
90 |
-> thm (* rule *)
|
dixon@15550
|
91 |
-> match
|
wenzelm@16978
|
92 |
-> thm Seq.seq (* substituted goal *)
|
dixon@15538
|
93 |
|
dixon@16004
|
94 |
(* basic notion of search *)
|
wenzelm@16978
|
95 |
val searchf_tlr_unify_all :
|
wenzelm@16978
|
96 |
(searchinfo
|
wenzelm@16978
|
97 |
-> term (* lhs *)
|
dixon@16004
|
98 |
-> match Seq.seq Seq.seq)
|
wenzelm@16978
|
99 |
val searchf_tlr_unify_valid :
|
wenzelm@16978
|
100 |
(searchinfo
|
wenzelm@16978
|
101 |
-> term (* lhs *)
|
dixon@16004
|
102 |
-> match Seq.seq Seq.seq)
|
dixon@15814
|
103 |
|
wenzelm@16978
|
104 |
(* specialise search constructor for conclusion skipping occurrences. *)
|
dixon@16004
|
105 |
val skip_first_occs_search :
|
dixon@16004
|
106 |
int -> ('a -> 'b -> 'c Seq.seq Seq.seq) -> 'a -> 'b -> 'c Seq.seq
|
dixon@16004
|
107 |
(* specialised search constructor for assumptions using skips *)
|
dixon@16004
|
108 |
val skip_first_asm_occs_search :
|
dixon@16004
|
109 |
('a -> 'b -> 'c Seq.seq Seq.seq) ->
|
dixon@16004
|
110 |
'a -> int -> 'b -> 'c IsaPLib.skipseqT
|
dixon@16004
|
111 |
|
dixon@16004
|
112 |
(* tactics and methods *)
|
wenzelm@16978
|
113 |
val eqsubst_asm_meth : int list -> thm list -> Proof.method
|
wenzelm@16978
|
114 |
val eqsubst_asm_tac :
|
wenzelm@16978
|
115 |
int list -> thm list -> int -> thm -> thm Seq.seq
|
wenzelm@16978
|
116 |
val eqsubst_asm_tac' :
|
dixon@16004
|
117 |
(* search function with skips *)
|
wenzelm@16978
|
118 |
(searchinfo -> int -> term -> match IsaPLib.skipseqT)
|
dixon@16004
|
119 |
-> int (* skip to *)
|
wenzelm@16978
|
120 |
-> thm (* rule *)
|
dixon@16004
|
121 |
-> int (* subgoal number *)
|
wenzelm@16978
|
122 |
-> thm (* tgt theorem with subgoals *)
|
wenzelm@16978
|
123 |
-> thm Seq.seq (* new theorems *)
|
dixon@15538
|
124 |
|
wenzelm@16978
|
125 |
val eqsubst_meth : int list -> thm list -> Proof.method
|
wenzelm@16978
|
126 |
val eqsubst_tac :
|
wenzelm@16978
|
127 |
int list -> thm list -> int -> thm -> thm Seq.seq
|
wenzelm@16978
|
128 |
val eqsubst_tac' :
|
wenzelm@16978
|
129 |
(searchinfo -> term -> match Seq.seq)
|
wenzelm@16978
|
130 |
-> thm -> int -> thm -> thm Seq.seq
|
dixon@15538
|
131 |
|
wenzelm@16978
|
132 |
val meth : (bool * int list) * thm list -> Proof.context -> Proof.method
|
paulson@15481
|
133 |
val setup : (Theory.theory -> Theory.theory) list
|
paulson@15481
|
134 |
end;
|
paulson@15481
|
135 |
|
dixon@16004
|
136 |
|
wenzelm@16978
|
137 |
functor EQSubstTacFUN (structure EqRuleData : EQRULE_DATA)
|
dixon@15538
|
138 |
: EQSUBST_TAC
|
paulson@15481
|
139 |
= struct
|
paulson@15481
|
140 |
|
dixon@15915
|
141 |
(* a type abriviation for match information *)
|
wenzelm@16978
|
142 |
type match =
|
wenzelm@16978
|
143 |
((indexname * (sort * typ)) list (* type instantiations *)
|
wenzelm@16978
|
144 |
* (indexname * (typ * term)) list) (* term instantiations *)
|
wenzelm@16978
|
145 |
* (string * typ) list (* fake named type abs env *)
|
wenzelm@16978
|
146 |
* (string * typ) list (* type abs env *)
|
wenzelm@16978
|
147 |
* term (* outer term *)
|
dixon@15550
|
148 |
|
wenzelm@16978
|
149 |
type searchinfo =
|
dixon@16004
|
150 |
Sign.sg (* sign for matching *)
|
dixon@16004
|
151 |
* int (* maxidx *)
|
dixon@16004
|
152 |
* BasicIsaFTerm.FcTerm (* focusterm to search under *)
|
dixon@15550
|
153 |
|
dixon@15538
|
154 |
(* FOR DEBUGGING...
|
dixon@15538
|
155 |
type trace_subst_errT = int (* subgoal *)
|
wenzelm@16978
|
156 |
* thm (* thm with all goals *)
|
dixon@15538
|
157 |
* (Thm.cterm list (* certified free var placeholders for vars *)
|
wenzelm@16978
|
158 |
* thm) (* trivial thm of goal concl *)
|
dixon@15538
|
159 |
(* possible matches/unifiers *)
|
wenzelm@16978
|
160 |
* thm (* rule *)
|
wenzelm@16978
|
161 |
* (((indexname * typ) list (* type instantiations *)
|
wenzelm@16978
|
162 |
* (indexname * term) list ) (* term instantiations *)
|
wenzelm@16978
|
163 |
* (string * typ) list (* Type abs env *)
|
wenzelm@16978
|
164 |
* term) (* outer term *);
|
dixon@15538
|
165 |
|
dixon@15538
|
166 |
val trace_subst_err = (ref NONE : trace_subst_errT option ref);
|
dixon@15538
|
167 |
val trace_subst_search = ref false;
|
dixon@15538
|
168 |
exception trace_subst_exp of trace_subst_errT;
|
dixon@15538
|
169 |
*)
|
dixon@15538
|
170 |
|
wenzelm@16978
|
171 |
(* also defined in /HOL/Tools/inductive_codegen.ML,
|
dixon@15538
|
172 |
maybe move this to seq.ML ? *)
|
dixon@15538
|
173 |
infix 5 :->;
|
dixon@15538
|
174 |
fun s :-> f = Seq.flat (Seq.map f s);
|
dixon@15538
|
175 |
|
dixon@15814
|
176 |
(* search from top, left to right, then down *)
|
wenzelm@16978
|
177 |
fun search_tlr_all_f f ft =
|
paulson@15481
|
178 |
let
|
wenzelm@16978
|
179 |
fun maux ft =
|
wenzelm@16978
|
180 |
let val t' = (IsaFTerm.focus_of_fcterm ft)
|
wenzelm@16978
|
181 |
(* val _ =
|
wenzelm@16978
|
182 |
if !trace_subst_search then
|
dixon@15538
|
183 |
(writeln ("Examining: " ^ (TermLib.string_of_term t'));
|
dixon@15538
|
184 |
TermLib.writeterm t'; ())
|
dixon@15538
|
185 |
else (); *)
|
wenzelm@16978
|
186 |
in
|
wenzelm@16978
|
187 |
(case t' of
|
wenzelm@16978
|
188 |
(_ $ _) => Seq.append(maux (IsaFTerm.focus_left ft),
|
wenzelm@16978
|
189 |
Seq.cons(f ft,
|
paulson@15481
|
190 |
maux (IsaFTerm.focus_right ft)))
|
dixon@15929
|
191 |
| (Abs _) => Seq.cons(f ft, maux (IsaFTerm.focus_abs ft))
|
dixon@15929
|
192 |
| leaf => Seq.single (f ft)) end
|
paulson@15481
|
193 |
in maux ft end;
|
paulson@15481
|
194 |
|
dixon@15814
|
195 |
(* search from top, left to right, then down *)
|
wenzelm@16978
|
196 |
fun search_tlr_valid_f f ft =
|
dixon@15814
|
197 |
let
|
wenzelm@16978
|
198 |
fun maux ft =
|
wenzelm@16978
|
199 |
let
|
dixon@15814
|
200 |
val hereseq = if IsaFTerm.valid_match_start ft then f ft else Seq.empty
|
wenzelm@16978
|
201 |
in
|
wenzelm@16978
|
202 |
(case (IsaFTerm.focus_of_fcterm ft) of
|
wenzelm@16978
|
203 |
(_ $ _) => Seq.append(maux (IsaFTerm.focus_left ft),
|
wenzelm@16978
|
204 |
Seq.cons(hereseq,
|
dixon@15814
|
205 |
maux (IsaFTerm.focus_right ft)))
|
dixon@15929
|
206 |
| (Abs _) => Seq.cons(hereseq, maux (IsaFTerm.focus_abs ft))
|
dixon@15929
|
207 |
| leaf => Seq.single (hereseq))
|
dixon@15814
|
208 |
end
|
dixon@15814
|
209 |
in maux ft end;
|
dixon@15814
|
210 |
|
dixon@15814
|
211 |
(* search all unifications *)
|
wenzelm@16978
|
212 |
fun searchf_tlr_unify_all (sgn, maxidx, ft) lhs =
|
wenzelm@16978
|
213 |
IsaFTerm.find_fcterm_matches
|
wenzelm@16978
|
214 |
search_tlr_all_f
|
dixon@16004
|
215 |
(IsaFTerm.clean_unify_ft sgn maxidx lhs)
|
dixon@16004
|
216 |
ft;
|
paulson@15481
|
217 |
|
dixon@15814
|
218 |
(* search only for 'valid' unifiers (non abs subterms and non vars) *)
|
wenzelm@16978
|
219 |
fun searchf_tlr_unify_valid (sgn, maxidx, ft) lhs =
|
wenzelm@16978
|
220 |
IsaFTerm.find_fcterm_matches
|
wenzelm@16978
|
221 |
search_tlr_valid_f
|
dixon@16004
|
222 |
(IsaFTerm.clean_unify_ft sgn maxidx lhs)
|
dixon@16004
|
223 |
ft;
|
dixon@15929
|
224 |
|
dixon@15814
|
225 |
|
dixon@15538
|
226 |
(* apply a substitution in the conclusion of the theorem th *)
|
dixon@15538
|
227 |
(* cfvs are certified free var placeholders for goal params *)
|
dixon@15538
|
228 |
(* conclthm is a theorem of for just the conclusion *)
|
dixon@15538
|
229 |
(* m is instantiation/match information *)
|
dixon@15538
|
230 |
(* rule is the equation for substitution *)
|
wenzelm@16978
|
231 |
fun apply_subst_in_concl i th (cfvs, conclthm) rule m =
|
dixon@15538
|
232 |
(RWInst.rw m rule conclthm)
|
dixon@15855
|
233 |
|> IsaND.unfix_frees cfvs
|
dixon@15915
|
234 |
|> RWInst.beta_eta_contract
|
dixon@15538
|
235 |
|> (fn r => Tactic.rtac r i th);
|
paulson@15481
|
236 |
|
paulson@15481
|
237 |
(* substitute within the conclusion of goal i of gth, using a meta
|
dixon@15538
|
238 |
equation rule. Note that we assume rule has var indicies zero'd *)
|
wenzelm@16978
|
239 |
fun prep_concl_subst i gth =
|
wenzelm@16978
|
240 |
let
|
paulson@15481
|
241 |
val th = Thm.incr_indexes 1 gth;
|
paulson@15481
|
242 |
val tgt_term = Thm.prop_of th;
|
paulson@15481
|
243 |
|
paulson@15481
|
244 |
val sgn = Thm.sign_of_thm th;
|
paulson@15481
|
245 |
val ctermify = Thm.cterm_of sgn;
|
paulson@15481
|
246 |
val trivify = Thm.trivial o ctermify;
|
paulson@15481
|
247 |
|
paulson@15481
|
248 |
val (fixedbody, fvs) = IsaND.fix_alls_term i tgt_term;
|
paulson@15481
|
249 |
val cfvs = rev (map ctermify fvs);
|
paulson@15481
|
250 |
|
dixon@15538
|
251 |
val conclterm = Logic.strip_imp_concl fixedbody;
|
dixon@15538
|
252 |
val conclthm = trivify conclterm;
|
dixon@15538
|
253 |
val maxidx = Term.maxidx_of_term conclterm;
|
wenzelm@16978
|
254 |
val ft = ((IsaFTerm.focus_right
|
dixon@16004
|
255 |
o IsaFTerm.focus_left
|
wenzelm@16978
|
256 |
o IsaFTerm.fcterm_of_term
|
dixon@16004
|
257 |
o Thm.prop_of) conclthm)
|
paulson@15481
|
258 |
in
|
dixon@16004
|
259 |
((cfvs, conclthm), (sgn, maxidx, ft))
|
paulson@15481
|
260 |
end;
|
paulson@15481
|
261 |
|
paulson@15481
|
262 |
(* substitute using an object or meta level equality *)
|
wenzelm@16978
|
263 |
fun eqsubst_tac' searchf instepthm i th =
|
wenzelm@16978
|
264 |
let
|
dixon@16004
|
265 |
val (cvfsconclthm, searchinfo) = prep_concl_subst i th;
|
wenzelm@16978
|
266 |
val stepthms =
|
wenzelm@16978
|
267 |
Seq.map Drule.zero_var_indexes
|
dixon@15538
|
268 |
(Seq.of_list (EqRuleData.prep_meta_eq instepthm));
|
dixon@15538
|
269 |
fun rewrite_with_thm r =
|
dixon@15538
|
270 |
let val (lhs,_) = Logic.dest_equals (Thm.concl_of r);
|
dixon@16004
|
271 |
in (searchf searchinfo lhs)
|
dixon@15538
|
272 |
:-> (apply_subst_in_concl i th cvfsconclthm r) end;
|
dixon@16004
|
273 |
in stepthms :-> rewrite_with_thm end;
|
dixon@15538
|
274 |
|
dixon@15538
|
275 |
|
dixon@16004
|
276 |
(* Tactic.distinct_subgoals_tac -- fails to free type variables *)
|
dixon@15959
|
277 |
|
wenzelm@16978
|
278 |
(* custom version of distinct subgoals that works with term and
|
wenzelm@16978
|
279 |
type variables. Asssumes th is in beta-eta normal form.
|
dixon@15959
|
280 |
Also, does nothing if flexflex contraints are present. *)
|
dixon@15959
|
281 |
fun distinct_subgoals th =
|
dixon@15959
|
282 |
if List.null (Thm.tpairs_of th) then
|
dixon@15959
|
283 |
let val (fixes,fixedthm) = IsaND.fix_vars_and_tvars th
|
dixon@15959
|
284 |
val (fixedthconcl,cprems) = IsaND.hide_prems fixedthm
|
dixon@15959
|
285 |
in
|
wenzelm@16978
|
286 |
IsaND.unfix_frees_and_tfrees
|
dixon@15959
|
287 |
fixes
|
wenzelm@16978
|
288 |
(Drule.implies_intr_list
|
wenzelm@16978
|
289 |
(Library.gen_distinct
|
dixon@15959
|
290 |
(fn (x, y) => Thm.term_of x = Thm.term_of y)
|
dixon@15959
|
291 |
cprems) fixedthconcl)
|
dixon@15959
|
292 |
end
|
dixon@15959
|
293 |
else th;
|
dixon@15538
|
294 |
|
wenzelm@16978
|
295 |
(* General substiuttion of multiple occurances using one of
|
dixon@15936
|
296 |
the given theorems*)
|
wenzelm@16978
|
297 |
exception eqsubst_occL_exp of
|
wenzelm@16978
|
298 |
string * (int list) * (thm list) * int * thm;
|
wenzelm@16978
|
299 |
fun skip_first_occs_search occ srchf sinfo lhs =
|
wenzelm@16978
|
300 |
case (IsaPLib.skipto_seqseq occ (srchf sinfo lhs)) of
|
dixon@16004
|
301 |
IsaPLib.skipmore _ => Seq.empty
|
dixon@16004
|
302 |
| IsaPLib.skipseq ss => Seq.flat ss;
|
dixon@16004
|
303 |
|
wenzelm@16978
|
304 |
fun eqsubst_tac occL thms i th =
|
dixon@15936
|
305 |
let val nprems = Thm.nprems_of th in
|
dixon@15936
|
306 |
if nprems < i then Seq.empty else
|
wenzelm@16978
|
307 |
let val thmseq = (Seq.of_list thms)
|
wenzelm@16978
|
308 |
fun apply_occ occ th =
|
wenzelm@16978
|
309 |
thmseq :->
|
wenzelm@16978
|
310 |
(fn r => eqsubst_tac' (skip_first_occs_search
|
dixon@15936
|
311 |
occ searchf_tlr_unify_valid) r
|
dixon@15936
|
312 |
(i + ((Thm.nprems_of th) - nprems))
|
dixon@15936
|
313 |
th);
|
wenzelm@16978
|
314 |
val sortedoccL =
|
dixon@16004
|
315 |
Library.sort (Library.rev_order o Library.int_ord) occL;
|
dixon@15936
|
316 |
in
|
dixon@16004
|
317 |
Seq.map distinct_subgoals (Seq.EVERY (map apply_occ sortedoccL) th)
|
dixon@15936
|
318 |
end
|
dixon@15959
|
319 |
end
|
dixon@15959
|
320 |
handle THM _ => raise eqsubst_occL_exp ("THM",occL,thms,i,th);
|
dixon@15959
|
321 |
|
paulson@15481
|
322 |
|
paulson@15481
|
323 |
(* inthms are the given arguments in Isar, and treated as eqstep with
|
paulson@15481
|
324 |
the first one, then the second etc *)
|
dixon@15936
|
325 |
fun eqsubst_meth occL inthms =
|
wenzelm@16978
|
326 |
Method.METHOD
|
dixon@15538
|
327 |
(fn facts =>
|
dixon@15936
|
328 |
HEADGOAL ( Method.insert_tac facts THEN' eqsubst_tac occL inthms ));
|
paulson@15481
|
329 |
|
dixon@16004
|
330 |
(* apply a substitution inside assumption j, keeps asm in the same place *)
|
wenzelm@16978
|
331 |
fun apply_subst_in_asm i th rule ((cfvs, j, ngoalprems, pth),m) =
|
wenzelm@16978
|
332 |
let
|
dixon@16004
|
333 |
val th2 = Thm.rotate_rule (j - 1) i th; (* put premice first *)
|
wenzelm@16978
|
334 |
val preelimrule =
|
dixon@16004
|
335 |
(RWInst.rw m rule pth)
|
dixon@16004
|
336 |
|> (Seq.hd o Tactic.prune_params_tac)
|
dixon@16004
|
337 |
|> Thm.permute_prems 0 ~1 (* put old asm first *)
|
dixon@16004
|
338 |
|> IsaND.unfix_frees cfvs (* unfix any global params *)
|
dixon@16004
|
339 |
|> RWInst.beta_eta_contract; (* normal form *)
|
wenzelm@16978
|
340 |
(* val elimrule =
|
dixon@16004
|
341 |
preelimrule
|
dixon@16004
|
342 |
|> Tactic.make_elim (* make into elim rule *)
|
dixon@16004
|
343 |
|> Thm.lift_rule (th2, i); (* lift into context *)
|
dixon@16007
|
344 |
*)
|
dixon@16004
|
345 |
in
|
dixon@16004
|
346 |
(* ~j because new asm starts at back, thus we subtract 1 *)
|
dixon@16007
|
347 |
Seq.map (Thm.rotate_rule (~j) ((Thm.nprems_of rule) + i))
|
dixon@16007
|
348 |
(Tactic.dtac preelimrule i th2)
|
dixon@16007
|
349 |
|
wenzelm@16978
|
350 |
(* (Thm.bicompose
|
dixon@16004
|
351 |
false (* use unification *)
|
dixon@16004
|
352 |
(true, (* elim resolution *)
|
dixon@16007
|
353 |
elimrule, (2 + (Thm.nprems_of rule)) - ngoalprems)
|
dixon@16007
|
354 |
i th2) *)
|
dixon@16004
|
355 |
end;
|
dixon@15538
|
356 |
|
dixon@15538
|
357 |
|
dixon@15538
|
358 |
(* prepare to substitute within the j'th premise of subgoal i of gth,
|
dixon@15538
|
359 |
using a meta-level equation. Note that we assume rule has var indicies
|
dixon@15538
|
360 |
zero'd. Note that we also assume that premt is the j'th premice of
|
dixon@15538
|
361 |
subgoal i of gth. Note the repetition of work done for each
|
dixon@15538
|
362 |
assumption, i.e. this can be made more efficient for search over
|
dixon@15538
|
363 |
multiple assumptions. *)
|
wenzelm@16978
|
364 |
fun prep_subst_in_asm i gth j =
|
wenzelm@16978
|
365 |
let
|
paulson@15481
|
366 |
val th = Thm.incr_indexes 1 gth;
|
paulson@15481
|
367 |
val tgt_term = Thm.prop_of th;
|
paulson@15481
|
368 |
|
paulson@15481
|
369 |
val sgn = Thm.sign_of_thm th;
|
paulson@15481
|
370 |
val ctermify = Thm.cterm_of sgn;
|
paulson@15481
|
371 |
val trivify = Thm.trivial o ctermify;
|
paulson@15481
|
372 |
|
paulson@15481
|
373 |
val (fixedbody, fvs) = IsaND.fix_alls_term i tgt_term;
|
paulson@15481
|
374 |
val cfvs = rev (map ctermify fvs);
|
paulson@15481
|
375 |
|
dixon@15538
|
376 |
val asmt = Library.nth_elem(j - 1,(Logic.strip_imp_prems fixedbody));
|
dixon@15538
|
377 |
val asm_nprems = length (Logic.strip_imp_prems asmt);
|
dixon@15538
|
378 |
|
dixon@15538
|
379 |
val pth = trivify asmt;
|
dixon@15538
|
380 |
val maxidx = Term.maxidx_of_term asmt;
|
dixon@15538
|
381 |
|
wenzelm@16978
|
382 |
val ft = ((IsaFTerm.focus_right
|
wenzelm@16978
|
383 |
o IsaFTerm.fcterm_of_term
|
dixon@16004
|
384 |
o Thm.prop_of) pth)
|
dixon@16004
|
385 |
in ((cfvs, j, asm_nprems, pth), (sgn, maxidx, ft)) end;
|
paulson@15481
|
386 |
|
dixon@15538
|
387 |
(* prepare subst in every possible assumption *)
|
wenzelm@16978
|
388 |
fun prep_subst_in_asms i gth =
|
dixon@16004
|
389 |
map (prep_subst_in_asm i gth)
|
wenzelm@16978
|
390 |
((rev o IsaPLib.mk_num_list o length)
|
dixon@16004
|
391 |
(Logic.prems_of_goal (Thm.prop_of gth) i));
|
dixon@15538
|
392 |
|
dixon@15538
|
393 |
|
dixon@15538
|
394 |
(* substitute in an assumption using an object or meta level equality *)
|
wenzelm@16978
|
395 |
fun eqsubst_asm_tac' searchf skipocc instepthm i th =
|
wenzelm@16978
|
396 |
let
|
dixon@16004
|
397 |
val asmpreps = prep_subst_in_asms i th;
|
wenzelm@16978
|
398 |
val stepthms =
|
wenzelm@16978
|
399 |
Seq.map Drule.zero_var_indexes
|
dixon@16004
|
400 |
(Seq.of_list (EqRuleData.prep_meta_eq instepthm))
|
dixon@16004
|
401 |
fun rewrite_with_thm r =
|
dixon@16004
|
402 |
let val (lhs,_) = Logic.dest_equals (Thm.concl_of r)
|
dixon@16004
|
403 |
fun occ_search occ [] = Seq.empty
|
dixon@16004
|
404 |
| occ_search occ ((asminfo, searchinfo)::moreasms) =
|
wenzelm@16978
|
405 |
(case searchf searchinfo occ lhs of
|
dixon@16004
|
406 |
IsaPLib.skipmore i => occ_search i moreasms
|
wenzelm@16978
|
407 |
| IsaPLib.skipseq ss =>
|
dixon@16004
|
408 |
Seq.append (Seq.map (Library.pair asminfo)
|
wenzelm@16978
|
409 |
(Seq.flat ss),
|
dixon@16004
|
410 |
occ_search 1 moreasms))
|
dixon@16004
|
411 |
(* find later substs also *)
|
wenzelm@16978
|
412 |
in
|
dixon@16004
|
413 |
(occ_search skipocc asmpreps) :-> (apply_subst_in_asm i th r)
|
dixon@16004
|
414 |
end;
|
dixon@16004
|
415 |
in stepthms :-> rewrite_with_thm end;
|
dixon@15538
|
416 |
|
dixon@16004
|
417 |
|
wenzelm@16978
|
418 |
fun skip_first_asm_occs_search searchf sinfo occ lhs =
|
dixon@16004
|
419 |
IsaPLib.skipto_seqseq occ (searchf sinfo lhs);
|
dixon@16004
|
420 |
|
wenzelm@16978
|
421 |
fun eqsubst_asm_tac occL thms i th =
|
wenzelm@16978
|
422 |
let val nprems = Thm.nprems_of th
|
dixon@15538
|
423 |
in
|
dixon@16004
|
424 |
if nprems < i then Seq.empty else
|
wenzelm@16978
|
425 |
let val thmseq = (Seq.of_list thms)
|
wenzelm@16978
|
426 |
fun apply_occ occK th =
|
wenzelm@16978
|
427 |
thmseq :->
|
wenzelm@16978
|
428 |
(fn r =>
|
wenzelm@16978
|
429 |
eqsubst_asm_tac' (skip_first_asm_occs_search
|
dixon@16004
|
430 |
searchf_tlr_unify_valid) occK r
|
dixon@16004
|
431 |
(i + ((Thm.nprems_of th) - nprems))
|
dixon@16004
|
432 |
th);
|
wenzelm@16978
|
433 |
val sortedoccs =
|
dixon@16004
|
434 |
Library.sort (Library.rev_order o Library.int_ord) occL
|
dixon@16004
|
435 |
in
|
dixon@16004
|
436 |
Seq.map distinct_subgoals
|
dixon@16004
|
437 |
(Seq.EVERY (map apply_occ sortedoccs) th)
|
dixon@16004
|
438 |
end
|
dixon@16004
|
439 |
end
|
dixon@16004
|
440 |
handle THM _ => raise eqsubst_occL_exp ("THM",occL,thms,i,th);
|
paulson@15481
|
441 |
|
paulson@15481
|
442 |
(* inthms are the given arguments in Isar, and treated as eqstep with
|
paulson@15481
|
443 |
the first one, then the second etc *)
|
dixon@15936
|
444 |
fun eqsubst_asm_meth occL inthms =
|
wenzelm@16978
|
445 |
Method.METHOD
|
dixon@15538
|
446 |
(fn facts =>
|
dixon@15936
|
447 |
HEADGOAL (Method.insert_tac facts THEN' eqsubst_asm_tac occL inthms ));
|
paulson@15481
|
448 |
|
paulson@15481
|
449 |
(* combination method that takes a flag (true indicates that subst
|
paulson@15481
|
450 |
should be done to an assumption, false = apply to the conclusion of
|
paulson@15481
|
451 |
the goal) as well as the theorems to use *)
|
wenzelm@16978
|
452 |
fun meth ((asmflag, occL), inthms) ctxt =
|
dixon@15936
|
453 |
if asmflag then eqsubst_asm_meth occL inthms else eqsubst_meth occL inthms;
|
paulson@15481
|
454 |
|
paulson@15481
|
455 |
(* syntax for options, given "(asm)" will give back true, without
|
paulson@15481
|
456 |
gives back false *)
|
paulson@15481
|
457 |
val options_syntax =
|
paulson@15481
|
458 |
(Args.parens (Args.$$$ "asm") >> (K true)) ||
|
paulson@15481
|
459 |
(Scan.succeed false);
|
dixon@15936
|
460 |
|
dixon@15929
|
461 |
val ith_syntax =
|
dixon@15936
|
462 |
(Args.parens (Scan.repeat Args.nat))
|
dixon@15936
|
463 |
|| (Scan.succeed [0]);
|
paulson@15481
|
464 |
|
paulson@15481
|
465 |
(* method syntax, first take options, then theorems *)
|
paulson@15481
|
466 |
fun meth_syntax meth src ctxt =
|
wenzelm@16978
|
467 |
meth (snd (Method.syntax ((Scan.lift options_syntax)
|
wenzelm@16978
|
468 |
-- (Scan.lift ith_syntax)
|
wenzelm@16978
|
469 |
-- Attrib.local_thms) src ctxt))
|
paulson@15481
|
470 |
ctxt;
|
paulson@15481
|
471 |
|
paulson@15481
|
472 |
(* setup function for adding method to theory. *)
|
wenzelm@16978
|
473 |
val setup =
|
paulson@15481
|
474 |
[Method.add_method ("subst", meth_syntax meth, "Substiution with an equation. Use \"(asm)\" option to substitute in an assumption.")];
|
paulson@15481
|
475 |
|
wenzelm@16978
|
476 |
end;
|