author | wenzelm |
Mon, 16 Jun 2008 22:13:47 +0200 | |
changeset 27241 | ba01fbe0f90b |
parent 27156 | e9f2d5947887 |
child 27279 | 39ff18c0f07f |
permissions | -rw-r--r-- |
252
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
1 |
(* Title: Pure/drule.ML |
0 | 2 |
ID: $Id$ |
252
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
3 |
Author: Lawrence C Paulson, Cambridge University Computer Laboratory |
0 | 4 |
Copyright 1993 University of Cambridge |
5 |
||
3766 | 6 |
Derived rules and other operations on theorems. |
0 | 7 |
*) |
8 |
||
21578 | 9 |
infix 0 RS RSN RL RLN MRS MRL OF COMP INCR_COMP COMP_INCR; |
0 | 10 |
|
5903 | 11 |
signature BASIC_DRULE = |
3766 | 12 |
sig |
18179 | 13 |
val mk_implies: cterm * cterm -> cterm |
14 |
val list_implies: cterm list * cterm -> cterm |
|
15 |
val strip_imp_prems: cterm -> cterm list |
|
16 |
val strip_imp_concl: cterm -> cterm |
|
17 |
val cprems_of: thm -> cterm list |
|
18 |
val cterm_fun: (term -> term) -> (cterm -> cterm) |
|
19 |
val ctyp_fun: (typ -> typ) -> (ctyp -> ctyp) |
|
20 |
val forall_intr_list: cterm list -> thm -> thm |
|
21 |
val forall_intr_frees: thm -> thm |
|
22 |
val forall_intr_vars: thm -> thm |
|
23 |
val forall_elim_list: cterm list -> thm -> thm |
|
24 |
val gen_all: thm -> thm |
|
25 |
val lift_all: cterm -> thm -> thm |
|
26 |
val freeze_thaw: thm -> thm * (thm -> thm) |
|
15495
50fde6f04e4c
new treatment of demodulation in proof reconstruction
paulson
parents:
15442
diff
changeset
|
27 |
val freeze_thaw_robust: thm -> thm * (int -> thm -> thm) |
18179 | 28 |
val implies_elim_list: thm -> thm list -> thm |
29 |
val implies_intr_list: cterm list -> thm -> thm |
|
18206 | 30 |
val instantiate: (ctyp * ctyp) list * (cterm * cterm) list -> thm -> thm |
21603 | 31 |
val zero_var_indexes_list: thm list -> thm list |
18179 | 32 |
val zero_var_indexes: thm -> thm |
33 |
val implies_intr_hyps: thm -> thm |
|
34 |
val standard: thm -> thm |
|
35 |
val standard': thm -> thm |
|
36 |
val rotate_prems: int -> thm -> thm |
|
37 |
val rearrange_prems: int list -> thm -> thm |
|
38 |
val RSN: thm * (int * thm) -> thm |
|
39 |
val RS: thm * thm -> thm |
|
40 |
val RLN: thm list * (int * thm list) -> thm list |
|
41 |
val RL: thm list * thm list -> thm list |
|
42 |
val MRS: thm list * thm -> thm |
|
43 |
val MRL: thm list list * thm list -> thm list |
|
44 |
val OF: thm * thm list -> thm |
|
45 |
val compose: thm * int * thm -> thm list |
|
46 |
val COMP: thm * thm -> thm |
|
21578 | 47 |
val INCR_COMP: thm * thm -> thm |
48 |
val COMP_INCR: thm * thm -> thm |
|
18179 | 49 |
val cterm_instantiate: (cterm*cterm)list -> thm -> thm |
50 |
val size_of_thm: thm -> int |
|
51 |
val reflexive_thm: thm |
|
52 |
val symmetric_thm: thm |
|
53 |
val transitive_thm: thm |
|
54 |
val symmetric_fun: thm -> thm |
|
55 |
val extensional: thm -> thm |
|
18820 | 56 |
val equals_cong: thm |
18179 | 57 |
val imp_cong: thm |
58 |
val swap_prems_eq: thm |
|
59 |
val asm_rl: thm |
|
60 |
val cut_rl: thm |
|
61 |
val revcut_rl: thm |
|
62 |
val thin_rl: thm |
|
4285 | 63 |
val triv_forall_equality: thm |
19051 | 64 |
val distinct_prems_rl: thm |
18179 | 65 |
val swap_prems_rl: thm |
66 |
val equal_intr_rule: thm |
|
67 |
val equal_elim_rule1: thm |
|
19421 | 68 |
val equal_elim_rule2: thm |
18179 | 69 |
val instantiate': ctyp option list -> cterm option list -> thm -> thm |
5903 | 70 |
end; |
71 |
||
72 |
signature DRULE = |
|
73 |
sig |
|
74 |
include BASIC_DRULE |
|
19999 | 75 |
val generalize: string list * string list -> thm -> thm |
15949 | 76 |
val list_comb: cterm * cterm list -> cterm |
12908
53bfe07a7916
New function strip_comb (cterm version of Term.strip_comb).
berghofe
parents:
12800
diff
changeset
|
77 |
val strip_comb: cterm -> cterm * cterm list |
15262 | 78 |
val strip_type: ctyp -> ctyp list * ctyp |
15949 | 79 |
val beta_conv: cterm -> cterm -> cterm |
27156 | 80 |
val types_sorts: thm -> (indexname-> typ option) * (indexname-> sort option) |
15669 | 81 |
val add_used: thm -> string list -> string list |
17713 | 82 |
val flexflex_unique: thm -> thm |
19421 | 83 |
val store_thm: bstring -> thm -> thm |
84 |
val store_standard_thm: bstring -> thm -> thm |
|
85 |
val store_thm_open: bstring -> thm -> thm |
|
86 |
val store_standard_thm_open: bstring -> thm -> thm |
|
11975 | 87 |
val compose_single: thm * int * thm -> thm |
18468 | 88 |
val imp_cong_rule: thm -> thm -> thm |
22939 | 89 |
val arg_cong_rule: cterm -> thm -> thm |
23568 | 90 |
val binop_cong_rule: cterm -> thm -> thm -> thm |
22939 | 91 |
val fun_cong_rule: thm -> cterm -> thm |
15001
fb2141a9f8c0
Moved conversion rules from MetaSimplifier to Drule. refl_implies removed
skalberg
parents:
14854
diff
changeset
|
92 |
val beta_eta_conversion: cterm -> thm |
15925 | 93 |
val eta_long_conversion: cterm -> thm |
20861 | 94 |
val eta_contraction_rule: thm -> thm |
11975 | 95 |
val norm_hhf_eq: thm |
12800 | 96 |
val is_norm_hhf: term -> bool |
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
15949
diff
changeset
|
97 |
val norm_hhf: theory -> term -> term |
20298 | 98 |
val norm_hhf_cterm: cterm -> cterm |
18025 | 99 |
val protect: cterm -> cterm |
100 |
val protectI: thm |
|
101 |
val protectD: thm |
|
18179 | 102 |
val protect_cong: thm |
18025 | 103 |
val implies_intr_protected: cterm list -> thm -> thm |
19775 | 104 |
val termI: thm |
105 |
val mk_term: cterm -> thm |
|
106 |
val dest_term: thm -> cterm |
|
21519 | 107 |
val cterm_rule: (thm -> thm) -> cterm -> cterm |
20881 | 108 |
val term_rule: theory -> (thm -> thm) -> term -> term |
24005 | 109 |
val dummy_thm: thm |
19523 | 110 |
val sort_triv: theory -> typ * sort -> thm list |
19504 | 111 |
val unconstrainTs: thm -> thm |
23423 | 112 |
val with_subgoal: int -> (thm -> thm) -> thm -> thm |
14081 | 113 |
val rename_bvars: (string * string) list -> thm -> thm |
114 |
val rename_bvars': string option list -> thm -> thm |
|
24426 | 115 |
val incr_type_indexes: int -> thm -> thm |
19124 | 116 |
val incr_indexes: thm -> thm -> thm |
117 |
val incr_indexes2: thm -> thm -> thm -> thm |
|
12297 | 118 |
val remdups_rl: thm |
18225 | 119 |
val multi_resolve: thm list -> thm -> thm Seq.seq |
120 |
val multi_resolves: thm list -> thm list -> thm Seq.seq |
|
13325 | 121 |
val abs_def: thm -> thm |
3766 | 122 |
end; |
0 | 123 |
|
5903 | 124 |
structure Drule: DRULE = |
0 | 125 |
struct |
126 |
||
3991 | 127 |
|
16682 | 128 |
(** some cterm->cterm operations: faster than calling cterm_of! **) |
708
8422e50adce0
Pure/drule/cprems_of, cskip_flexpairs, cstrip_imp_prems: new cterm operations
lcp
parents:
668
diff
changeset
|
129 |
|
8422e50adce0
Pure/drule/cprems_of, cskip_flexpairs, cstrip_imp_prems: new cterm operations
lcp
parents:
668
diff
changeset
|
130 |
(* A1==>...An==>B goes to [A1,...,An], where B is not an implication *) |
2004
3411fe560611
New operations on cterms. Now same names as in Logic
paulson
parents:
1906
diff
changeset
|
131 |
fun strip_imp_prems ct = |
22906
195b7515911a
moved some operations to more_thm.ML and conv.ML;
wenzelm
parents:
22695
diff
changeset
|
132 |
let val (cA, cB) = Thm.dest_implies ct |
20579 | 133 |
in cA :: strip_imp_prems cB end |
134 |
handle TERM _ => []; |
|
708
8422e50adce0
Pure/drule/cprems_of, cskip_flexpairs, cstrip_imp_prems: new cterm operations
lcp
parents:
668
diff
changeset
|
135 |
|
2004
3411fe560611
New operations on cterms. Now same names as in Logic
paulson
parents:
1906
diff
changeset
|
136 |
(* A1==>...An==>B goes to B, where B is not an implication *) |
3411fe560611
New operations on cterms. Now same names as in Logic
paulson
parents:
1906
diff
changeset
|
137 |
fun strip_imp_concl ct = |
20579 | 138 |
(case Thm.term_of ct of |
139 |
Const ("==>", _) $ _ $ _ => strip_imp_concl (Thm.dest_arg ct) |
|
140 |
| _ => ct); |
|
2004
3411fe560611
New operations on cterms. Now same names as in Logic
paulson
parents:
1906
diff
changeset
|
141 |
|
708
8422e50adce0
Pure/drule/cprems_of, cskip_flexpairs, cstrip_imp_prems: new cterm operations
lcp
parents:
668
diff
changeset
|
142 |
(*The premises of a theorem, as a cterm list*) |
13659
3cf622f6b0b2
Removed obsolete functions dealing with flex-flex constraints.
berghofe
parents:
13650
diff
changeset
|
143 |
val cprems_of = strip_imp_prems o cprop_of; |
708
8422e50adce0
Pure/drule/cprems_of, cskip_flexpairs, cstrip_imp_prems: new cterm operations
lcp
parents:
668
diff
changeset
|
144 |
|
26627
dac6d56b7c8d
rep_cterm/rep_thm: no longer dereference theory_ref;
wenzelm
parents:
26487
diff
changeset
|
145 |
fun cterm_fun f ct = Thm.cterm_of (Thm.theory_of_cterm ct) (f (Thm.term_of ct)); |
dac6d56b7c8d
rep_cterm/rep_thm: no longer dereference theory_ref;
wenzelm
parents:
26487
diff
changeset
|
146 |
fun ctyp_fun f cT = Thm.ctyp_of (Thm.theory_of_ctyp cT) (f (Thm.typ_of cT)); |
15797 | 147 |
|
26487 | 148 |
fun certify t = Thm.cterm_of (Context.the_theory (Context.the_thread_data ())) t; |
9547 | 149 |
|
26487 | 150 |
val implies = certify Term.implies; |
19183 | 151 |
fun mk_implies (A, B) = Thm.capply (Thm.capply implies A) B; |
9547 | 152 |
|
153 |
(*cterm version of list_implies: [A1,...,An], B goes to [|A1;==>;An|]==>B *) |
|
154 |
fun list_implies([], B) = B |
|
155 |
| list_implies(A::AS, B) = mk_implies (A, list_implies(AS,B)); |
|
156 |
||
15949 | 157 |
(*cterm version of list_comb: maps (f, [t1,...,tn]) to f(t1,...,tn) *) |
158 |
fun list_comb (f, []) = f |
|
159 |
| list_comb (f, t::ts) = list_comb (Thm.capply f t, ts); |
|
160 |
||
12908
53bfe07a7916
New function strip_comb (cterm version of Term.strip_comb).
berghofe
parents:
12800
diff
changeset
|
161 |
(*cterm version of strip_comb: maps f(t1,...,tn) to (f, [t1,...,tn]) *) |
18179 | 162 |
fun strip_comb ct = |
12908
53bfe07a7916
New function strip_comb (cterm version of Term.strip_comb).
berghofe
parents:
12800
diff
changeset
|
163 |
let |
53bfe07a7916
New function strip_comb (cterm version of Term.strip_comb).
berghofe
parents:
12800
diff
changeset
|
164 |
fun stripc (p as (ct, cts)) = |
53bfe07a7916
New function strip_comb (cterm version of Term.strip_comb).
berghofe
parents:
12800
diff
changeset
|
165 |
let val (ct1, ct2) = Thm.dest_comb ct |
53bfe07a7916
New function strip_comb (cterm version of Term.strip_comb).
berghofe
parents:
12800
diff
changeset
|
166 |
in stripc (ct1, ct2 :: cts) end handle CTERM _ => p |
53bfe07a7916
New function strip_comb (cterm version of Term.strip_comb).
berghofe
parents:
12800
diff
changeset
|
167 |
in stripc (ct, []) end; |
53bfe07a7916
New function strip_comb (cterm version of Term.strip_comb).
berghofe
parents:
12800
diff
changeset
|
168 |
|
15262 | 169 |
(* cterm version of strip_type: maps [T1,...,Tn]--->T to ([T1,T2,...,Tn], T) *) |
170 |
fun strip_type cT = (case Thm.typ_of cT of |
|
171 |
Type ("fun", _) => |
|
172 |
let |
|
173 |
val [cT1, cT2] = Thm.dest_ctyp cT; |
|
174 |
val (cTs, cT') = strip_type cT2 |
|
175 |
in (cT1 :: cTs, cT') end |
|
176 |
| _ => ([], cT)); |
|
177 |
||
15949 | 178 |
(*Beta-conversion for cterms, where x is an abstraction. Simply returns the rhs |
179 |
of the meta-equality returned by the beta_conversion rule.*) |
|
18179 | 180 |
fun beta_conv x y = |
20579 | 181 |
Thm.dest_arg (cprop_of (Thm.beta_conversion false (Thm.capply x y))); |
15949 | 182 |
|
15875 | 183 |
|
708
8422e50adce0
Pure/drule/cprems_of, cskip_flexpairs, cstrip_imp_prems: new cterm operations
lcp
parents:
668
diff
changeset
|
184 |
|
252
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
185 |
(*** Find the type (sort) associated with a (T)Var or (T)Free in a term |
0 | 186 |
Used for establishing default types (of variables) and sorts (of |
187 |
type variables) when reading another term. |
|
188 |
Index -1 indicates that a (T)Free rather than a (T)Var is wanted. |
|
189 |
***) |
|
190 |
||
191 |
fun types_sorts thm = |
|
20329 | 192 |
let |
22695
17073e9b94f2
moved Drule.plain_prop_of, Drule.fold_terms to more_thm.ML;
wenzelm
parents:
22681
diff
changeset
|
193 |
val vars = Thm.fold_terms Term.add_vars thm []; |
17073e9b94f2
moved Drule.plain_prop_of, Drule.fold_terms to more_thm.ML;
wenzelm
parents:
22681
diff
changeset
|
194 |
val frees = Thm.fold_terms Term.add_frees thm []; |
17073e9b94f2
moved Drule.plain_prop_of, Drule.fold_terms to more_thm.ML;
wenzelm
parents:
22681
diff
changeset
|
195 |
val tvars = Thm.fold_terms Term.add_tvars thm []; |
17073e9b94f2
moved Drule.plain_prop_of, Drule.fold_terms to more_thm.ML;
wenzelm
parents:
22681
diff
changeset
|
196 |
val tfrees = Thm.fold_terms Term.add_tfrees thm []; |
20329 | 197 |
fun types (a, i) = |
198 |
if i < 0 then AList.lookup (op =) frees a else AList.lookup (op =) vars (a, i); |
|
199 |
fun sorts (a, i) = |
|
200 |
if i < 0 then AList.lookup (op =) tfrees a else AList.lookup (op =) tvars (a, i); |
|
201 |
in (types, sorts) end; |
|
0 | 202 |
|
20329 | 203 |
val add_used = |
22695
17073e9b94f2
moved Drule.plain_prop_of, Drule.fold_terms to more_thm.ML;
wenzelm
parents:
22681
diff
changeset
|
204 |
(Thm.fold_terms o fold_types o fold_atyps) |
20329 | 205 |
(fn TFree (a, _) => insert (op =) a |
206 |
| TVar ((a, _), _) => insert (op =) a |
|
207 |
| _ => I); |
|
15669 | 208 |
|
7636 | 209 |
|
9455 | 210 |
|
0 | 211 |
(** Standardization of rules **) |
212 |
||
19523 | 213 |
(* type classes and sorts *) |
214 |
||
215 |
fun sort_triv thy (T, S) = |
|
216 |
let |
|
217 |
val certT = Thm.ctyp_of thy; |
|
218 |
val cT = certT T; |
|
219 |
fun class_triv c = |
|
220 |
Thm.class_triv thy c |
|
24848 | 221 |
|> Thm.instantiate ([(certT (TVar ((Name.aT, 0), [c])), cT)], []); |
19523 | 222 |
in map class_triv S end; |
223 |
||
19504 | 224 |
fun unconstrainTs th = |
20298 | 225 |
fold (Thm.unconstrainT o Thm.ctyp_of (Thm.theory_of_thm th) o TVar) |
22695
17073e9b94f2
moved Drule.plain_prop_of, Drule.fold_terms to more_thm.ML;
wenzelm
parents:
22681
diff
changeset
|
226 |
(Thm.fold_terms Term.add_tvars th []) th; |
19504 | 227 |
|
19730 | 228 |
(*Generalization over a list of variables*) |
229 |
val forall_intr_list = fold_rev forall_intr; |
|
0 | 230 |
|
231 |
(*Generalization over all suitable Free variables*) |
|
232 |
fun forall_intr_frees th = |
|
19730 | 233 |
let |
26627
dac6d56b7c8d
rep_cterm/rep_thm: no longer dereference theory_ref;
wenzelm
parents:
26487
diff
changeset
|
234 |
val thy = Thm.theory_of_thm th; |
dac6d56b7c8d
rep_cterm/rep_thm: no longer dereference theory_ref;
wenzelm
parents:
26487
diff
changeset
|
235 |
val {prop, hyps, tpairs, ...} = rep_thm th; |
19730 | 236 |
val fixed = fold Term.add_frees (Thm.terms_of_tpairs tpairs @ hyps) []; |
237 |
val frees = Term.fold_aterms (fn Free v => |
|
238 |
if member (op =) fixed v then I else insert (op =) v | _ => I) prop []; |
|
239 |
in fold (forall_intr o cterm_of thy o Free) frees th end; |
|
0 | 240 |
|
18535 | 241 |
(*Generalization over Vars -- canonical order*) |
242 |
fun forall_intr_vars th = |
|
20298 | 243 |
fold forall_intr |
22695
17073e9b94f2
moved Drule.plain_prop_of, Drule.fold_terms to more_thm.ML;
wenzelm
parents:
22681
diff
changeset
|
244 |
(map (Thm.cterm_of (Thm.theory_of_thm th) o Var) (Thm.fold_terms Term.add_vars th [])) th; |
18535 | 245 |
|
18025 | 246 |
fun outer_params t = |
20077
4fc9a4fef219
replaced Term.variant(list) by Name.variant(_list);
wenzelm
parents:
19999
diff
changeset
|
247 |
let val vs = Term.strip_all_vars t |
4fc9a4fef219
replaced Term.variant(list) by Name.variant(_list);
wenzelm
parents:
19999
diff
changeset
|
248 |
in Name.variant_list [] (map (Name.clean o #1) vs) ~~ map #2 vs end; |
18025 | 249 |
|
250 |
(*generalize outermost parameters*) |
|
251 |
fun gen_all th = |
|
12719
41e0d086f8b6
improved forall_elim_vars_safe (no longer invents new indexes);
wenzelm
parents:
12710
diff
changeset
|
252 |
let |
26627
dac6d56b7c8d
rep_cterm/rep_thm: no longer dereference theory_ref;
wenzelm
parents:
26487
diff
changeset
|
253 |
val thy = Thm.theory_of_thm th; |
dac6d56b7c8d
rep_cterm/rep_thm: no longer dereference theory_ref;
wenzelm
parents:
26487
diff
changeset
|
254 |
val {prop, maxidx, ...} = Thm.rep_thm th; |
18025 | 255 |
val cert = Thm.cterm_of thy; |
256 |
fun elim (x, T) = Thm.forall_elim (cert (Var ((x, maxidx + 1), T))); |
|
257 |
in fold elim (outer_params prop) th end; |
|
258 |
||
259 |
(*lift vars wrt. outermost goal parameters |
|
18118 | 260 |
-- reverses the effect of gen_all modulo higher-order unification*) |
18025 | 261 |
fun lift_all goal th = |
262 |
let |
|
263 |
val thy = Theory.merge (Thm.theory_of_cterm goal, Thm.theory_of_thm th); |
|
264 |
val cert = Thm.cterm_of thy; |
|
19421 | 265 |
val maxidx = Thm.maxidx_of th; |
18025 | 266 |
val ps = outer_params (Thm.term_of goal) |
267 |
|> map (fn (x, T) => Var ((x, maxidx + 1), Logic.incr_tvar (maxidx + 1) T)); |
|
268 |
val Ts = map Term.fastype_of ps; |
|
22695
17073e9b94f2
moved Drule.plain_prop_of, Drule.fold_terms to more_thm.ML;
wenzelm
parents:
22681
diff
changeset
|
269 |
val inst = Thm.fold_terms Term.add_vars th [] |> map (fn (xi, T) => |
18025 | 270 |
(cert (Var (xi, T)), cert (Term.list_comb (Var (xi, Ts ---> T), ps)))); |
271 |
in |
|
272 |
th |> Thm.instantiate ([], inst) |
|
273 |
|> fold_rev (Thm.forall_intr o cert) ps |
|
274 |
end; |
|
275 |
||
19999 | 276 |
(*direct generalization*) |
277 |
fun generalize names th = Thm.generalize names (Thm.maxidx_of th + 1) th; |
|
9554 | 278 |
|
16949
ea65d75e0ce1
tuned gen_all, forall_elim_list, implies_intr_list, standard;
wenzelm
parents:
16861
diff
changeset
|
279 |
(*specialization over a list of cterms*) |
ea65d75e0ce1
tuned gen_all, forall_elim_list, implies_intr_list, standard;
wenzelm
parents:
16861
diff
changeset
|
280 |
val forall_elim_list = fold forall_elim; |
0 | 281 |
|
16949
ea65d75e0ce1
tuned gen_all, forall_elim_list, implies_intr_list, standard;
wenzelm
parents:
16861
diff
changeset
|
282 |
(*maps A1,...,An |- B to [| A1;...;An |] ==> B*) |
ea65d75e0ce1
tuned gen_all, forall_elim_list, implies_intr_list, standard;
wenzelm
parents:
16861
diff
changeset
|
283 |
val implies_intr_list = fold_rev implies_intr; |
0 | 284 |
|
16949
ea65d75e0ce1
tuned gen_all, forall_elim_list, implies_intr_list, standard;
wenzelm
parents:
16861
diff
changeset
|
285 |
(*maps [| A1;...;An |] ==> B and [A1,...,An] to B*) |
24978
159b0f4dd1e9
moved Drule.unvarify to Thm.unvarify (cf. more_thm.ML);
wenzelm
parents:
24947
diff
changeset
|
286 |
fun implies_elim_list impth ths = fold Thm.elim_implies ths impth; |
0 | 287 |
|
288 |
(*Reset Var indexes to zero, renaming to preserve distinctness*) |
|
21603 | 289 |
fun zero_var_indexes_list [] = [] |
290 |
| zero_var_indexes_list ths = |
|
291 |
let |
|
292 |
val thy = Theory.merge_list (map Thm.theory_of_thm ths); |
|
293 |
val certT = Thm.ctyp_of thy and cert = Thm.cterm_of thy; |
|
294 |
val (instT, inst) = TermSubst.zero_var_indexes_inst (map Thm.full_prop_of ths); |
|
295 |
val cinstT = map (fn (v, T) => (certT (TVar v), certT T)) instT; |
|
296 |
val cinst = map (fn (v, t) => (cert (Var v), cert t)) inst; |
|
297 |
in map (Thm.adjust_maxidx_thm ~1 o Thm.instantiate (cinstT, cinst)) ths end; |
|
298 |
||
299 |
val zero_var_indexes = singleton zero_var_indexes_list; |
|
0 | 300 |
|
301 |
||
14394 | 302 |
(** Standard form of object-rule: no hypotheses, flexflex constraints, |
303 |
Frees, or outer quantifiers; all generality expressed by Vars of index 0.**) |
|
10515 | 304 |
|
16595 | 305 |
(*Discharge all hypotheses.*) |
306 |
fun implies_intr_hyps th = |
|
307 |
fold Thm.implies_intr (#hyps (Thm.crep_thm th)) th; |
|
308 |
||
14394 | 309 |
(*Squash a theorem's flexflex constraints provided it can be done uniquely. |
310 |
This step can lose information.*) |
|
14387
e96d5c42c4b0
Polymorphic treatment of binary arithmetic using axclasses
paulson
parents:
14340
diff
changeset
|
311 |
fun flexflex_unique th = |
17713 | 312 |
if null (tpairs_of th) then th else |
23439 | 313 |
case distinct Thm.eq_thm (Seq.list_of (flexflex_rule th)) of |
314 |
[th] => th |
|
315 |
| [] => raise THM("flexflex_unique: impossible constraints", 0, [th]) |
|
316 |
| _ => raise THM("flexflex_unique: multiple unifiers", 0, [th]); |
|
14387
e96d5c42c4b0
Polymorphic treatment of binary arithmetic using axclasses
paulson
parents:
14340
diff
changeset
|
317 |
|
21603 | 318 |
|
319 |
(* legacy standard operations *) |
|
320 |
||
16949
ea65d75e0ce1
tuned gen_all, forall_elim_list, implies_intr_list, standard;
wenzelm
parents:
16861
diff
changeset
|
321 |
val standard' = |
ea65d75e0ce1
tuned gen_all, forall_elim_list, implies_intr_list, standard;
wenzelm
parents:
16861
diff
changeset
|
322 |
implies_intr_hyps |
ea65d75e0ce1
tuned gen_all, forall_elim_list, implies_intr_list, standard;
wenzelm
parents:
16861
diff
changeset
|
323 |
#> forall_intr_frees |
19421 | 324 |
#> `Thm.maxidx_of |
16949
ea65d75e0ce1
tuned gen_all, forall_elim_list, implies_intr_list, standard;
wenzelm
parents:
16861
diff
changeset
|
325 |
#-> (fn maxidx => |
26653 | 326 |
Thm.forall_elim_vars (maxidx + 1) |
20904 | 327 |
#> Thm.strip_shyps |
16949
ea65d75e0ce1
tuned gen_all, forall_elim_list, implies_intr_list, standard;
wenzelm
parents:
16861
diff
changeset
|
328 |
#> zero_var_indexes |
26627
dac6d56b7c8d
rep_cterm/rep_thm: no longer dereference theory_ref;
wenzelm
parents:
26487
diff
changeset
|
329 |
#> Thm.varifyT); |
1218
59ed8ef1a3a1
modified pretty_thm, standard, eq_thm to handle shyps;
wenzelm
parents:
1194
diff
changeset
|
330 |
|
16949
ea65d75e0ce1
tuned gen_all, forall_elim_list, implies_intr_list, standard;
wenzelm
parents:
16861
diff
changeset
|
331 |
val standard = |
21600
222810ce6b05
*** bad commit -- reverted to previous version ***
wenzelm
parents:
21596
diff
changeset
|
332 |
flexflex_unique |
16949
ea65d75e0ce1
tuned gen_all, forall_elim_list, implies_intr_list, standard;
wenzelm
parents:
16861
diff
changeset
|
333 |
#> standard' |
26627
dac6d56b7c8d
rep_cterm/rep_thm: no longer dereference theory_ref;
wenzelm
parents:
26487
diff
changeset
|
334 |
#> Thm.close_derivation; |
11512
da3a96ab5630
Some basic rules are now stored with "open" derivations, to facilitate
berghofe
parents:
11163
diff
changeset
|
335 |
|
0 | 336 |
|
8328 | 337 |
(*Convert all Vars in a theorem to Frees. Also return a function for |
4610
b1322be47244
Tidying; rotate_prems; moved freeze_thaw from tactic.ML
paulson
parents:
4588
diff
changeset
|
338 |
reversing that operation. DOES NOT WORK FOR TYPE VARIABLES. |
b1322be47244
Tidying; rotate_prems; moved freeze_thaw from tactic.ML
paulson
parents:
4588
diff
changeset
|
339 |
Similar code in type/freeze_thaw*) |
15495
50fde6f04e4c
new treatment of demodulation in proof reconstruction
paulson
parents:
15442
diff
changeset
|
340 |
|
50fde6f04e4c
new treatment of demodulation in proof reconstruction
paulson
parents:
15442
diff
changeset
|
341 |
fun freeze_thaw_robust th = |
19878 | 342 |
let val fth = Thm.freezeT th |
26627
dac6d56b7c8d
rep_cterm/rep_thm: no longer dereference theory_ref;
wenzelm
parents:
26487
diff
changeset
|
343 |
val thy = Thm.theory_of_thm fth |
dac6d56b7c8d
rep_cterm/rep_thm: no longer dereference theory_ref;
wenzelm
parents:
26487
diff
changeset
|
344 |
val {prop, tpairs, ...} = rep_thm fth |
15495
50fde6f04e4c
new treatment of demodulation in proof reconstruction
paulson
parents:
15442
diff
changeset
|
345 |
in |
23178 | 346 |
case List.foldr add_term_vars [] (prop :: Thm.terms_of_tpairs tpairs) of |
15495
50fde6f04e4c
new treatment of demodulation in proof reconstruction
paulson
parents:
15442
diff
changeset
|
347 |
[] => (fth, fn i => fn x => x) (*No vars: nothing to do!*) |
50fde6f04e4c
new treatment of demodulation in proof reconstruction
paulson
parents:
15442
diff
changeset
|
348 |
| vars => |
19753 | 349 |
let fun newName (Var(ix,_)) = (ix, gensym (string_of_indexname ix)) |
350 |
val alist = map newName vars |
|
15495
50fde6f04e4c
new treatment of demodulation in proof reconstruction
paulson
parents:
15442
diff
changeset
|
351 |
fun mk_inst (Var(v,T)) = |
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
15949
diff
changeset
|
352 |
(cterm_of thy (Var(v,T)), |
17325 | 353 |
cterm_of thy (Free(((the o AList.lookup (op =) alist) v), T))) |
15495
50fde6f04e4c
new treatment of demodulation in proof reconstruction
paulson
parents:
15442
diff
changeset
|
354 |
val insts = map mk_inst vars |
50fde6f04e4c
new treatment of demodulation in proof reconstruction
paulson
parents:
15442
diff
changeset
|
355 |
fun thaw i th' = (*i is non-negative increment for Var indexes*) |
50fde6f04e4c
new treatment of demodulation in proof reconstruction
paulson
parents:
15442
diff
changeset
|
356 |
th' |> forall_intr_list (map #2 insts) |
22906
195b7515911a
moved some operations to more_thm.ML and conv.ML;
wenzelm
parents:
22695
diff
changeset
|
357 |
|> forall_elim_list (map (Thm.incr_indexes_cterm i o #1) insts) |
15495
50fde6f04e4c
new treatment of demodulation in proof reconstruction
paulson
parents:
15442
diff
changeset
|
358 |
in (Thm.instantiate ([],insts) fth, thaw) end |
50fde6f04e4c
new treatment of demodulation in proof reconstruction
paulson
parents:
15442
diff
changeset
|
359 |
end; |
50fde6f04e4c
new treatment of demodulation in proof reconstruction
paulson
parents:
15442
diff
changeset
|
360 |
|
50fde6f04e4c
new treatment of demodulation in proof reconstruction
paulson
parents:
15442
diff
changeset
|
361 |
(*Basic version of the function above. No option to rename Vars apart in thaw. |
19999 | 362 |
The Frees created from Vars have nice names. FIXME: does not check for |
19753 | 363 |
clashes with variables in the assumptions, so delete and use freeze_thaw_robust instead?*) |
4610
b1322be47244
Tidying; rotate_prems; moved freeze_thaw from tactic.ML
paulson
parents:
4588
diff
changeset
|
364 |
fun freeze_thaw th = |
19878 | 365 |
let val fth = Thm.freezeT th |
26627
dac6d56b7c8d
rep_cterm/rep_thm: no longer dereference theory_ref;
wenzelm
parents:
26487
diff
changeset
|
366 |
val thy = Thm.theory_of_thm fth |
dac6d56b7c8d
rep_cterm/rep_thm: no longer dereference theory_ref;
wenzelm
parents:
26487
diff
changeset
|
367 |
val {prop, tpairs, ...} = rep_thm fth |
7248
322151fe6f02
new primitive rule permute_prems to underlie defer_tac and rotate_prems
paulson
parents:
6995
diff
changeset
|
368 |
in |
23178 | 369 |
case List.foldr add_term_vars [] (prop :: Thm.terms_of_tpairs tpairs) of |
7248
322151fe6f02
new primitive rule permute_prems to underlie defer_tac and rotate_prems
paulson
parents:
6995
diff
changeset
|
370 |
[] => (fth, fn x => x) |
322151fe6f02
new primitive rule permute_prems to underlie defer_tac and rotate_prems
paulson
parents:
6995
diff
changeset
|
371 |
| vars => |
8328 | 372 |
let fun newName (Var(ix,_), (pairs,used)) = |
20077
4fc9a4fef219
replaced Term.variant(list) by Name.variant(_list);
wenzelm
parents:
19999
diff
changeset
|
373 |
let val v = Name.variant used (string_of_indexname ix) |
8328 | 374 |
in ((ix,v)::pairs, v::used) end; |
23178 | 375 |
val (alist, _) = List.foldr newName ([], Library.foldr add_term_names |
15574
b1d1b5bfc464
Removed practically all references to Library.foldr.
skalberg
parents:
15570
diff
changeset
|
376 |
(prop :: Thm.terms_of_tpairs tpairs, [])) vars |
8328 | 377 |
fun mk_inst (Var(v,T)) = |
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
15949
diff
changeset
|
378 |
(cterm_of thy (Var(v,T)), |
17325 | 379 |
cterm_of thy (Free(((the o AList.lookup (op =) alist) v), T))) |
8328 | 380 |
val insts = map mk_inst vars |
381 |
fun thaw th' = |
|
382 |
th' |> forall_intr_list (map #2 insts) |
|
383 |
|> forall_elim_list (map #1 insts) |
|
384 |
in (Thm.instantiate ([],insts) fth, thaw) end |
|
7248
322151fe6f02
new primitive rule permute_prems to underlie defer_tac and rotate_prems
paulson
parents:
6995
diff
changeset
|
385 |
end; |
4610
b1322be47244
Tidying; rotate_prems; moved freeze_thaw from tactic.ML
paulson
parents:
4588
diff
changeset
|
386 |
|
7248
322151fe6f02
new primitive rule permute_prems to underlie defer_tac and rotate_prems
paulson
parents:
6995
diff
changeset
|
387 |
(*Rotates a rule's premises to the left by k*) |
23537 | 388 |
fun rotate_prems 0 = I |
389 |
| rotate_prems k = permute_prems 0 k; |
|
390 |
||
23423 | 391 |
fun with_subgoal i f = rotate_prems (i - 1) #> f #> rotate_prems (1 - i); |
4610
b1322be47244
Tidying; rotate_prems; moved freeze_thaw from tactic.ML
paulson
parents:
4588
diff
changeset
|
392 |
|
11163 | 393 |
(* permute prems, where the i-th position in the argument list (counting from 0) |
394 |
gives the position within the original thm to be transferred to position i. |
|
395 |
Any remaining trailing positions are left unchanged. *) |
|
396 |
val rearrange_prems = let |
|
397 |
fun rearr new [] thm = thm |
|
11815 | 398 |
| rearr new (p::ps) thm = rearr (new+1) |
11163 | 399 |
(map (fn q => if new<=q andalso q<p then q+1 else q) ps) |
400 |
(permute_prems (new+1) (new-p) (permute_prems new (p-new) thm)) |
|
401 |
in rearr 0 end; |
|
4610
b1322be47244
Tidying; rotate_prems; moved freeze_thaw from tactic.ML
paulson
parents:
4588
diff
changeset
|
402 |
|
252
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
403 |
(*Resolution: exactly one resolvent must be produced.*) |
0 | 404 |
fun tha RSN (i,thb) = |
19861 | 405 |
case Seq.chop 2 (biresolution false [(false,tha)] i thb) of |
0 | 406 |
([th],_) => th |
407 |
| ([],_) => raise THM("RSN: no unifiers", i, [tha,thb]) |
|
408 |
| _ => raise THM("RSN: multiple unifiers", i, [tha,thb]); |
|
409 |
||
410 |
(*resolution: P==>Q, Q==>R gives P==>R. *) |
|
411 |
fun tha RS thb = tha RSN (1,thb); |
|
412 |
||
413 |
(*For joining lists of rules*) |
|
252
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
414 |
fun thas RLN (i,thbs) = |
0 | 415 |
let val resolve = biresolution false (map (pair false) thas) i |
4270 | 416 |
fun resb thb = Seq.list_of (resolve thb) handle THM _ => [] |
19482
9f11af8f7ef9
tuned basic list operators (flat, maps, map_filter);
wenzelm
parents:
19421
diff
changeset
|
417 |
in maps resb thbs end; |
0 | 418 |
|
419 |
fun thas RL thbs = thas RLN (1,thbs); |
|
420 |
||
11
d0e17c42dbb4
Added MRS, MRL from ZF/ROOT.ML. These support forward proof, resolving a
lcp
parents:
0
diff
changeset
|
421 |
(*Resolve a list of rules against bottom_rl from right to left; |
d0e17c42dbb4
Added MRS, MRL from ZF/ROOT.ML. These support forward proof, resolving a
lcp
parents:
0
diff
changeset
|
422 |
makes proof trees*) |
252
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
423 |
fun rls MRS bottom_rl = |
11
d0e17c42dbb4
Added MRS, MRL from ZF/ROOT.ML. These support forward proof, resolving a
lcp
parents:
0
diff
changeset
|
424 |
let fun rs_aux i [] = bottom_rl |
252
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
425 |
| rs_aux i (rl::rls) = rl RSN (i, rs_aux (i+1) rls) |
11
d0e17c42dbb4
Added MRS, MRL from ZF/ROOT.ML. These support forward proof, resolving a
lcp
parents:
0
diff
changeset
|
426 |
in rs_aux 1 rls end; |
d0e17c42dbb4
Added MRS, MRL from ZF/ROOT.ML. These support forward proof, resolving a
lcp
parents:
0
diff
changeset
|
427 |
|
d0e17c42dbb4
Added MRS, MRL from ZF/ROOT.ML. These support forward proof, resolving a
lcp
parents:
0
diff
changeset
|
428 |
(*As above, but for rule lists*) |
252
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
429 |
fun rlss MRL bottom_rls = |
11
d0e17c42dbb4
Added MRS, MRL from ZF/ROOT.ML. These support forward proof, resolving a
lcp
parents:
0
diff
changeset
|
430 |
let fun rs_aux i [] = bottom_rls |
252
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
431 |
| rs_aux i (rls::rlss) = rls RLN (i, rs_aux (i+1) rlss) |
11
d0e17c42dbb4
Added MRS, MRL from ZF/ROOT.ML. These support forward proof, resolving a
lcp
parents:
0
diff
changeset
|
432 |
in rs_aux 1 rlss end; |
d0e17c42dbb4
Added MRS, MRL from ZF/ROOT.ML. These support forward proof, resolving a
lcp
parents:
0
diff
changeset
|
433 |
|
9288
06a55195741b
infix 'OF' is a version of 'MRS' with more appropriate argument order;
wenzelm
parents:
8605
diff
changeset
|
434 |
(*A version of MRS with more appropriate argument order*) |
06a55195741b
infix 'OF' is a version of 'MRS' with more appropriate argument order;
wenzelm
parents:
8605
diff
changeset
|
435 |
fun bottom_rl OF rls = rls MRS bottom_rl; |
06a55195741b
infix 'OF' is a version of 'MRS' with more appropriate argument order;
wenzelm
parents:
8605
diff
changeset
|
436 |
|
252
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
437 |
(*compose Q and [...,Qi,Q(i+1),...]==>R to [...,Q(i+1),...]==>R |
0 | 438 |
with no lifting or renaming! Q may contain ==> or meta-quants |
439 |
ALWAYS deletes premise i *) |
|
252
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
440 |
fun compose(tha,i,thb) = |
24426 | 441 |
distinct Thm.eq_thm (Seq.list_of (bicompose false (false,tha,0) i thb)); |
0 | 442 |
|
6946 | 443 |
fun compose_single (tha,i,thb) = |
24426 | 444 |
case compose (tha,i,thb) of |
6946 | 445 |
[th] => th |
24426 | 446 |
| _ => raise THM ("compose: unique result expected", i, [tha,thb]); |
6946 | 447 |
|
0 | 448 |
(*compose Q and [Q1,Q2,...,Qk]==>R to [Q2,...,Qk]==>R getting unique result*) |
449 |
fun tha COMP thb = |
|
24426 | 450 |
case compose(tha,1,thb) of |
252
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
451 |
[th] => th |
0 | 452 |
| _ => raise THM("COMP", 1, [tha,thb]); |
453 |
||
13105
3d1e7a199bdc
use eq_thm_prop instead of slightly inadequate eq_thm;
wenzelm
parents:
12908
diff
changeset
|
454 |
|
4016 | 455 |
(** theorem equality **) |
0 | 456 |
|
457 |
(*Useful "distance" function for BEST_FIRST*) |
|
16720 | 458 |
val size_of_thm = size_of_term o Thm.full_prop_of; |
0 | 459 |
|
1194
563ecd14c1d8
Added weak_eq_thm and forall_intr_vars (thanks to Mark Staples)
lcp
parents:
952
diff
changeset
|
460 |
|
563ecd14c1d8
Added weak_eq_thm and forall_intr_vars (thanks to Mark Staples)
lcp
parents:
952
diff
changeset
|
461 |
|
0 | 462 |
(*** Meta-Rewriting Rules ***) |
463 |
||
26487 | 464 |
val read_prop = certify o SimpleSyntax.read_prop; |
465 |
||
466 |
fun store_thm name th = |
|
467 |
Context.>>> (Context.map_theory_result (PureThy.store_thm (name, th))); |
|
4610
b1322be47244
Tidying; rotate_prems; moved freeze_thaw from tactic.ML
paulson
parents:
4588
diff
changeset
|
468 |
|
26487 | 469 |
fun store_thm_open name th = |
470 |
Context.>>> (Context.map_theory_result (PureThy.store_thm_open (name, th))); |
|
471 |
||
472 |
fun store_standard_thm name th = store_thm name (standard th); |
|
12135 | 473 |
fun store_standard_thm_open name thm = store_thm_open name (standard' thm); |
4016 | 474 |
|
0 | 475 |
val reflexive_thm = |
26487 | 476 |
let val cx = certify (Var(("x",0),TVar(("'a",0),[]))) |
12135 | 477 |
in store_standard_thm_open "reflexive" (Thm.reflexive cx) end; |
0 | 478 |
|
479 |
val symmetric_thm = |
|
24241 | 480 |
let val xy = read_prop "x::'a == y::'a" |
16595 | 481 |
in store_standard_thm_open "symmetric" (Thm.implies_intr xy (Thm.symmetric (Thm.assume xy))) end; |
0 | 482 |
|
483 |
val transitive_thm = |
|
24241 | 484 |
let val xy = read_prop "x::'a == y::'a" |
485 |
val yz = read_prop "y::'a == z::'a" |
|
0 | 486 |
val xythm = Thm.assume xy and yzthm = Thm.assume yz |
12135 | 487 |
in store_standard_thm_open "transitive" (Thm.implies_intr yz (Thm.transitive xythm yzthm)) end; |
0 | 488 |
|
4679 | 489 |
fun symmetric_fun thm = thm RS symmetric_thm; |
490 |
||
11512
da3a96ab5630
Some basic rules are now stored with "open" derivations, to facilitate
berghofe
parents:
11163
diff
changeset
|
491 |
fun extensional eq = |
da3a96ab5630
Some basic rules are now stored with "open" derivations, to facilitate
berghofe
parents:
11163
diff
changeset
|
492 |
let val eq' = |
22906
195b7515911a
moved some operations to more_thm.ML and conv.ML;
wenzelm
parents:
22695
diff
changeset
|
493 |
abstract_rule "x" (Thm.dest_arg (fst (Thm.dest_equals (cprop_of eq)))) eq |
11512
da3a96ab5630
Some basic rules are now stored with "open" derivations, to facilitate
berghofe
parents:
11163
diff
changeset
|
494 |
in equal_elim (eta_conversion (cprop_of eq')) eq' end; |
da3a96ab5630
Some basic rules are now stored with "open" derivations, to facilitate
berghofe
parents:
11163
diff
changeset
|
495 |
|
18820 | 496 |
val equals_cong = |
24241 | 497 |
store_standard_thm_open "equals_cong" (Thm.reflexive (read_prop "x::'a == y::'a")); |
18820 | 498 |
|
10414 | 499 |
val imp_cong = |
500 |
let |
|
24241 | 501 |
val ABC = read_prop "A ==> B::prop == C::prop" |
502 |
val AB = read_prop "A ==> B" |
|
503 |
val AC = read_prop "A ==> C" |
|
504 |
val A = read_prop "A" |
|
10414 | 505 |
in |
12135 | 506 |
store_standard_thm_open "imp_cong" (implies_intr ABC (equal_intr |
10414 | 507 |
(implies_intr AB (implies_intr A |
508 |
(equal_elim (implies_elim (assume ABC) (assume A)) |
|
509 |
(implies_elim (assume AB) (assume A))))) |
|
510 |
(implies_intr AC (implies_intr A |
|
511 |
(equal_elim (symmetric (implies_elim (assume ABC) (assume A))) |
|
512 |
(implies_elim (assume AC) (assume A))))))) |
|
513 |
end; |
|
514 |
||
515 |
val swap_prems_eq = |
|
516 |
let |
|
24241 | 517 |
val ABC = read_prop "A ==> B ==> C" |
518 |
val BAC = read_prop "B ==> A ==> C" |
|
519 |
val A = read_prop "A" |
|
520 |
val B = read_prop "B" |
|
10414 | 521 |
in |
12135 | 522 |
store_standard_thm_open "swap_prems_eq" (equal_intr |
10414 | 523 |
(implies_intr ABC (implies_intr B (implies_intr A |
524 |
(implies_elim (implies_elim (assume ABC) (assume A)) (assume B))))) |
|
525 |
(implies_intr BAC (implies_intr A (implies_intr B |
|
526 |
(implies_elim (implies_elim (assume BAC) (assume B)) (assume A)))))) |
|
527 |
end; |
|
229
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
214
diff
changeset
|
528 |
|
22938 | 529 |
val imp_cong_rule = Thm.combination o Thm.combination (Thm.reflexive implies); |
530 |
||
23537 | 531 |
fun arg_cong_rule ct th = Thm.combination (Thm.reflexive ct) th; (*AP_TERM in LCF/HOL*) |
532 |
fun fun_cong_rule th ct = Thm.combination th (Thm.reflexive ct); (*AP_THM in LCF/HOL*) |
|
23568 | 533 |
fun binop_cong_rule ct th1 th2 = Thm.combination (arg_cong_rule ct th1) th2; |
0 | 534 |
|
15001
fb2141a9f8c0
Moved conversion rules from MetaSimplifier to Drule. refl_implies removed
skalberg
parents:
14854
diff
changeset
|
535 |
local |
22906
195b7515911a
moved some operations to more_thm.ML and conv.ML;
wenzelm
parents:
22695
diff
changeset
|
536 |
val dest_eq = Thm.dest_equals o cprop_of |
15001
fb2141a9f8c0
Moved conversion rules from MetaSimplifier to Drule. refl_implies removed
skalberg
parents:
14854
diff
changeset
|
537 |
val rhs_of = snd o dest_eq |
fb2141a9f8c0
Moved conversion rules from MetaSimplifier to Drule. refl_implies removed
skalberg
parents:
14854
diff
changeset
|
538 |
in |
fb2141a9f8c0
Moved conversion rules from MetaSimplifier to Drule. refl_implies removed
skalberg
parents:
14854
diff
changeset
|
539 |
fun beta_eta_conversion t = |
fb2141a9f8c0
Moved conversion rules from MetaSimplifier to Drule. refl_implies removed
skalberg
parents:
14854
diff
changeset
|
540 |
let val thm = beta_conversion true t |
fb2141a9f8c0
Moved conversion rules from MetaSimplifier to Drule. refl_implies removed
skalberg
parents:
14854
diff
changeset
|
541 |
in transitive thm (eta_conversion (rhs_of thm)) end |
fb2141a9f8c0
Moved conversion rules from MetaSimplifier to Drule. refl_implies removed
skalberg
parents:
14854
diff
changeset
|
542 |
end; |
fb2141a9f8c0
Moved conversion rules from MetaSimplifier to Drule. refl_implies removed
skalberg
parents:
14854
diff
changeset
|
543 |
|
15925 | 544 |
fun eta_long_conversion ct = transitive (beta_eta_conversion ct) |
545 |
(symmetric (beta_eta_conversion (cterm_fun (Pattern.eta_long []) ct))); |
|
546 |
||
20861 | 547 |
(*Contract all eta-redexes in the theorem, lest they give rise to needless abstractions*) |
548 |
fun eta_contraction_rule th = |
|
549 |
equal_elim (eta_conversion (cprop_of th)) th; |
|
550 |
||
24947
b7e990e1706a
improved abs_def: only abstract over outermost (unique) Vars;
wenzelm
parents:
24848
diff
changeset
|
551 |
|
b7e990e1706a
improved abs_def: only abstract over outermost (unique) Vars;
wenzelm
parents:
24848
diff
changeset
|
552 |
(* abs_def *) |
b7e990e1706a
improved abs_def: only abstract over outermost (unique) Vars;
wenzelm
parents:
24848
diff
changeset
|
553 |
|
b7e990e1706a
improved abs_def: only abstract over outermost (unique) Vars;
wenzelm
parents:
24848
diff
changeset
|
554 |
(* |
b7e990e1706a
improved abs_def: only abstract over outermost (unique) Vars;
wenzelm
parents:
24848
diff
changeset
|
555 |
f ?x1 ... ?xn == u |
b7e990e1706a
improved abs_def: only abstract over outermost (unique) Vars;
wenzelm
parents:
24848
diff
changeset
|
556 |
-------------------- |
b7e990e1706a
improved abs_def: only abstract over outermost (unique) Vars;
wenzelm
parents:
24848
diff
changeset
|
557 |
f == %x1 ... xn. u |
b7e990e1706a
improved abs_def: only abstract over outermost (unique) Vars;
wenzelm
parents:
24848
diff
changeset
|
558 |
*) |
b7e990e1706a
improved abs_def: only abstract over outermost (unique) Vars;
wenzelm
parents:
24848
diff
changeset
|
559 |
|
b7e990e1706a
improved abs_def: only abstract over outermost (unique) Vars;
wenzelm
parents:
24848
diff
changeset
|
560 |
local |
b7e990e1706a
improved abs_def: only abstract over outermost (unique) Vars;
wenzelm
parents:
24848
diff
changeset
|
561 |
|
b7e990e1706a
improved abs_def: only abstract over outermost (unique) Vars;
wenzelm
parents:
24848
diff
changeset
|
562 |
fun contract_lhs th = |
b7e990e1706a
improved abs_def: only abstract over outermost (unique) Vars;
wenzelm
parents:
24848
diff
changeset
|
563 |
Thm.transitive (Thm.symmetric (beta_eta_conversion |
b7e990e1706a
improved abs_def: only abstract over outermost (unique) Vars;
wenzelm
parents:
24848
diff
changeset
|
564 |
(fst (Thm.dest_equals (cprop_of th))))) th; |
b7e990e1706a
improved abs_def: only abstract over outermost (unique) Vars;
wenzelm
parents:
24848
diff
changeset
|
565 |
|
b7e990e1706a
improved abs_def: only abstract over outermost (unique) Vars;
wenzelm
parents:
24848
diff
changeset
|
566 |
fun var_args ct = |
b7e990e1706a
improved abs_def: only abstract over outermost (unique) Vars;
wenzelm
parents:
24848
diff
changeset
|
567 |
(case try Thm.dest_comb ct of |
b7e990e1706a
improved abs_def: only abstract over outermost (unique) Vars;
wenzelm
parents:
24848
diff
changeset
|
568 |
SOME (f, arg) => |
b7e990e1706a
improved abs_def: only abstract over outermost (unique) Vars;
wenzelm
parents:
24848
diff
changeset
|
569 |
(case Thm.term_of arg of |
b7e990e1706a
improved abs_def: only abstract over outermost (unique) Vars;
wenzelm
parents:
24848
diff
changeset
|
570 |
Var ((x, _), _) => update (eq_snd (op aconvc)) (x, arg) (var_args f) |
b7e990e1706a
improved abs_def: only abstract over outermost (unique) Vars;
wenzelm
parents:
24848
diff
changeset
|
571 |
| _ => []) |
b7e990e1706a
improved abs_def: only abstract over outermost (unique) Vars;
wenzelm
parents:
24848
diff
changeset
|
572 |
| NONE => []); |
b7e990e1706a
improved abs_def: only abstract over outermost (unique) Vars;
wenzelm
parents:
24848
diff
changeset
|
573 |
|
b7e990e1706a
improved abs_def: only abstract over outermost (unique) Vars;
wenzelm
parents:
24848
diff
changeset
|
574 |
in |
b7e990e1706a
improved abs_def: only abstract over outermost (unique) Vars;
wenzelm
parents:
24848
diff
changeset
|
575 |
|
b7e990e1706a
improved abs_def: only abstract over outermost (unique) Vars;
wenzelm
parents:
24848
diff
changeset
|
576 |
fun abs_def th = |
18337 | 577 |
let |
24947
b7e990e1706a
improved abs_def: only abstract over outermost (unique) Vars;
wenzelm
parents:
24848
diff
changeset
|
578 |
val th' = contract_lhs th; |
b7e990e1706a
improved abs_def: only abstract over outermost (unique) Vars;
wenzelm
parents:
24848
diff
changeset
|
579 |
val args = var_args (Thm.lhs_of th'); |
b7e990e1706a
improved abs_def: only abstract over outermost (unique) Vars;
wenzelm
parents:
24848
diff
changeset
|
580 |
in contract_lhs (fold (uncurry Thm.abstract_rule) args th') end; |
b7e990e1706a
improved abs_def: only abstract over outermost (unique) Vars;
wenzelm
parents:
24848
diff
changeset
|
581 |
|
b7e990e1706a
improved abs_def: only abstract over outermost (unique) Vars;
wenzelm
parents:
24848
diff
changeset
|
582 |
end; |
b7e990e1706a
improved abs_def: only abstract over outermost (unique) Vars;
wenzelm
parents:
24848
diff
changeset
|
583 |
|
18337 | 584 |
|
18468 | 585 |
|
15669 | 586 |
(*** Some useful meta-theorems ***) |
0 | 587 |
|
588 |
(*The rule V/V, obtains assumption solving for eresolve_tac*) |
|
24241 | 589 |
val asm_rl = store_standard_thm_open "asm_rl" (Thm.trivial (read_prop "?psi")); |
7380 | 590 |
val _ = store_thm "_" asm_rl; |
0 | 591 |
|
592 |
(*Meta-level cut rule: [| V==>W; V |] ==> W *) |
|
4016 | 593 |
val cut_rl = |
12135 | 594 |
store_standard_thm_open "cut_rl" |
24241 | 595 |
(Thm.trivial (read_prop "?psi ==> ?theta")); |
0 | 596 |
|
252
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
597 |
(*Generalized elim rule for one conclusion; cut_rl with reversed premises: |
0 | 598 |
[| PROP V; PROP V ==> PROP W |] ==> PROP W *) |
599 |
val revcut_rl = |
|
24241 | 600 |
let val V = read_prop "V" |
601 |
and VW = read_prop "V ==> W"; |
|
4016 | 602 |
in |
12135 | 603 |
store_standard_thm_open "revcut_rl" |
4016 | 604 |
(implies_intr V (implies_intr VW (implies_elim (assume VW) (assume V)))) |
0 | 605 |
end; |
606 |
||
668 | 607 |
(*for deleting an unwanted assumption*) |
608 |
val thin_rl = |
|
24241 | 609 |
let val V = read_prop "V" |
610 |
and W = read_prop "W"; |
|
12135 | 611 |
in store_standard_thm_open "thin_rl" (implies_intr V (implies_intr W (assume W))) end; |
668 | 612 |
|
0 | 613 |
(* (!!x. PROP ?V) == PROP ?V Allows removal of redundant parameters*) |
614 |
val triv_forall_equality = |
|
24241 | 615 |
let val V = read_prop "V" |
616 |
and QV = read_prop "!!x::'a. V" |
|
26487 | 617 |
and x = certify (Free ("x", Term.aT [])); |
4016 | 618 |
in |
12135 | 619 |
store_standard_thm_open "triv_forall_equality" |
11512
da3a96ab5630
Some basic rules are now stored with "open" derivations, to facilitate
berghofe
parents:
11163
diff
changeset
|
620 |
(equal_intr (implies_intr QV (forall_elim x (assume QV))) |
da3a96ab5630
Some basic rules are now stored with "open" derivations, to facilitate
berghofe
parents:
11163
diff
changeset
|
621 |
(implies_intr V (forall_intr x (assume V)))) |
0 | 622 |
end; |
623 |
||
19051 | 624 |
(* (PROP ?Phi ==> PROP ?Phi ==> PROP ?Psi) ==> |
625 |
(PROP ?Phi ==> PROP ?Psi) |
|
626 |
*) |
|
627 |
val distinct_prems_rl = |
|
628 |
let |
|
24241 | 629 |
val AAB = read_prop "Phi ==> Phi ==> Psi" |
630 |
val A = read_prop "Phi"; |
|
19051 | 631 |
in |
632 |
store_standard_thm_open "distinct_prems_rl" |
|
633 |
(implies_intr_list [AAB, A] (implies_elim_list (assume AAB) [assume A, assume A])) |
|
634 |
end; |
|
635 |
||
1756 | 636 |
(* (PROP ?PhiA ==> PROP ?PhiB ==> PROP ?Psi) ==> |
637 |
(PROP ?PhiB ==> PROP ?PhiA ==> PROP ?Psi) |
|
638 |
`thm COMP swap_prems_rl' swaps the first two premises of `thm' |
|
639 |
*) |
|
640 |
val swap_prems_rl = |
|
24241 | 641 |
let val cmajor = read_prop "PhiA ==> PhiB ==> Psi"; |
1756 | 642 |
val major = assume cmajor; |
24241 | 643 |
val cminor1 = read_prop "PhiA"; |
1756 | 644 |
val minor1 = assume cminor1; |
24241 | 645 |
val cminor2 = read_prop "PhiB"; |
1756 | 646 |
val minor2 = assume cminor2; |
12135 | 647 |
in store_standard_thm_open "swap_prems_rl" |
1756 | 648 |
(implies_intr cmajor (implies_intr cminor2 (implies_intr cminor1 |
649 |
(implies_elim (implies_elim major minor1) minor2)))) |
|
650 |
end; |
|
651 |
||
3653 | 652 |
(* [| PROP ?phi ==> PROP ?psi; PROP ?psi ==> PROP ?phi |] |
653 |
==> PROP ?phi == PROP ?psi |
|
8328 | 654 |
Introduction rule for == as a meta-theorem. |
3653 | 655 |
*) |
656 |
val equal_intr_rule = |
|
24241 | 657 |
let val PQ = read_prop "phi ==> psi" |
658 |
and QP = read_prop "psi ==> phi" |
|
4016 | 659 |
in |
12135 | 660 |
store_standard_thm_open "equal_intr_rule" |
4016 | 661 |
(implies_intr PQ (implies_intr QP (equal_intr (assume PQ) (assume QP)))) |
3653 | 662 |
end; |
663 |
||
19421 | 664 |
(* PROP ?phi == PROP ?psi ==> PROP ?phi ==> PROP ?psi *) |
13368 | 665 |
val equal_elim_rule1 = |
24241 | 666 |
let val eq = read_prop "phi::prop == psi::prop" |
667 |
and P = read_prop "phi" |
|
13368 | 668 |
in store_standard_thm_open "equal_elim_rule1" |
669 |
(Thm.equal_elim (assume eq) (assume P) |> implies_intr_list [eq, P]) |
|
670 |
end; |
|
4285 | 671 |
|
19421 | 672 |
(* PROP ?psi == PROP ?phi ==> PROP ?phi ==> PROP ?psi *) |
673 |
val equal_elim_rule2 = |
|
674 |
store_standard_thm_open "equal_elim_rule2" (symmetric_thm RS equal_elim_rule1); |
|
675 |
||
12297 | 676 |
(* "[| PROP ?phi; PROP ?phi; PROP ?psi |] ==> PROP ?psi" *) |
677 |
val remdups_rl = |
|
24241 | 678 |
let val P = read_prop "phi" and Q = read_prop "psi"; |
12297 | 679 |
in store_standard_thm_open "remdups_rl" (implies_intr_list [P, P, Q] (Thm.assume Q)) end; |
680 |
||
681 |
||
9554 | 682 |
(*(PROP ?phi ==> (!!x. PROP ?psi(x))) == (!!x. PROP ?phi ==> PROP ?psi(x)) |
12297 | 683 |
Rewrite rule for HHF normalization.*) |
9554 | 684 |
|
685 |
val norm_hhf_eq = |
|
686 |
let |
|
14854 | 687 |
val aT = TFree ("'a", []); |
9554 | 688 |
val all = Term.all aT; |
689 |
val x = Free ("x", aT); |
|
690 |
val phi = Free ("phi", propT); |
|
691 |
val psi = Free ("psi", aT --> propT); |
|
692 |
||
26487 | 693 |
val cx = certify x; |
694 |
val cphi = certify phi; |
|
695 |
val lhs = certify (Logic.mk_implies (phi, all $ Abs ("x", aT, psi $ Bound 0))); |
|
696 |
val rhs = certify (all $ Abs ("x", aT, Logic.mk_implies (phi, psi $ Bound 0))); |
|
9554 | 697 |
in |
698 |
Thm.equal_intr |
|
699 |
(Thm.implies_elim (Thm.assume lhs) (Thm.assume cphi) |
|
700 |
|> Thm.forall_elim cx |
|
701 |
|> Thm.implies_intr cphi |
|
702 |
|> Thm.forall_intr cx |
|
703 |
|> Thm.implies_intr lhs) |
|
704 |
(Thm.implies_elim |
|
705 |
(Thm.assume rhs |> Thm.forall_elim cx) (Thm.assume cphi) |
|
706 |
|> Thm.forall_intr cx |
|
707 |
|> Thm.implies_intr cphi |
|
708 |
|> Thm.implies_intr rhs) |
|
12135 | 709 |
|> store_standard_thm_open "norm_hhf_eq" |
9554 | 710 |
end; |
711 |
||
18179 | 712 |
val norm_hhf_prop = Logic.dest_equals (Thm.prop_of norm_hhf_eq); |
713 |
||
12800 | 714 |
fun is_norm_hhf tm = |
715 |
let |
|
716 |
fun is_norm (Const ("==>", _) $ _ $ (Const ("all", _) $ _)) = false |
|
717 |
| is_norm (t $ u) = is_norm t andalso is_norm u |
|
718 |
| is_norm (Abs (_, _, t)) = is_norm t |
|
719 |
| is_norm _ = true; |
|
18929 | 720 |
in is_norm (Envir.beta_eta_contract tm) end; |
12800 | 721 |
|
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
15949
diff
changeset
|
722 |
fun norm_hhf thy t = |
12800 | 723 |
if is_norm_hhf t then t |
18179 | 724 |
else Pattern.rewrite_term thy [norm_hhf_prop] [] t; |
725 |
||
20298 | 726 |
fun norm_hhf_cterm ct = |
727 |
if is_norm_hhf (Thm.term_of ct) then ct |
|
728 |
else cterm_fun (Pattern.rewrite_term (Thm.theory_of_cterm ct) [norm_hhf_prop] []) ct; |
|
729 |
||
12800 | 730 |
|
21603 | 731 |
(* var indexes *) |
732 |
||
24426 | 733 |
(*Increment the indexes of only the type variables*) |
734 |
fun incr_type_indexes inc th = |
|
735 |
let val tvs = term_tvars (prop_of th) |
|
736 |
and thy = theory_of_thm th |
|
737 |
fun inc_tvar ((a,i),s) = pairself (ctyp_of thy) (TVar ((a,i),s), TVar ((a,i+inc),s)) |
|
738 |
in Thm.instantiate (map inc_tvar tvs, []) th end; |
|
739 |
||
21603 | 740 |
fun incr_indexes th = Thm.incr_indexes (Thm.maxidx_of th + 1); |
741 |
||
742 |
fun incr_indexes2 th1 th2 = |
|
743 |
Thm.incr_indexes (Int.max (Thm.maxidx_of th1, Thm.maxidx_of th2) + 1); |
|
744 |
||
745 |
fun th1 INCR_COMP th2 = incr_indexes th2 th1 COMP th2; |
|
746 |
fun th1 COMP_INCR th2 = th1 COMP incr_indexes th1 th2; |
|
747 |
||
9554 | 748 |
|
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
15949
diff
changeset
|
749 |
(*** Instantiate theorem th, reading instantiations in theory thy ****) |
8129
29e239c7b8c2
Thm.instantiate no longer normalizes, but Drule.instantiate does
paulson
parents:
8086
diff
changeset
|
750 |
|
29e239c7b8c2
Thm.instantiate no longer normalizes, but Drule.instantiate does
paulson
parents:
8086
diff
changeset
|
751 |
(*Version that normalizes the result: Thm.instantiate no longer does that*) |
21603 | 752 |
fun instantiate instpair th = |
753 |
Thm.adjust_maxidx_thm ~1 (Thm.instantiate instpair th COMP_INCR asm_rl); |
|
8129
29e239c7b8c2
Thm.instantiate no longer normalizes, but Drule.instantiate does
paulson
parents:
8086
diff
changeset
|
754 |
|
29e239c7b8c2
Thm.instantiate no longer normalizes, but Drule.instantiate does
paulson
parents:
8086
diff
changeset
|
755 |
(*Left-to-right replacements: tpairs = [...,(vi,ti),...]. |
29e239c7b8c2
Thm.instantiate no longer normalizes, but Drule.instantiate does
paulson
parents:
8086
diff
changeset
|
756 |
Instantiates distinct Vars by terms, inferring type instantiations. *) |
29e239c7b8c2
Thm.instantiate no longer normalizes, but Drule.instantiate does
paulson
parents:
8086
diff
changeset
|
757 |
local |
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
15949
diff
changeset
|
758 |
fun add_types ((ct,cu), (thy,tye,maxidx)) = |
26627
dac6d56b7c8d
rep_cterm/rep_thm: no longer dereference theory_ref;
wenzelm
parents:
26487
diff
changeset
|
759 |
let |
dac6d56b7c8d
rep_cterm/rep_thm: no longer dereference theory_ref;
wenzelm
parents:
26487
diff
changeset
|
760 |
val thyt = Thm.theory_of_cterm ct; |
dac6d56b7c8d
rep_cterm/rep_thm: no longer dereference theory_ref;
wenzelm
parents:
26487
diff
changeset
|
761 |
val thyu = Thm.theory_of_cterm cu; |
dac6d56b7c8d
rep_cterm/rep_thm: no longer dereference theory_ref;
wenzelm
parents:
26487
diff
changeset
|
762 |
val {t, T, maxidx = maxt, ...} = Thm.rep_cterm ct; |
dac6d56b7c8d
rep_cterm/rep_thm: no longer dereference theory_ref;
wenzelm
parents:
26487
diff
changeset
|
763 |
val {t = u, T = U, maxidx = maxu, ...} = Thm.rep_cterm cu; |
8129
29e239c7b8c2
Thm.instantiate no longer normalizes, but Drule.instantiate does
paulson
parents:
8086
diff
changeset
|
764 |
val maxi = Int.max(maxidx, Int.max(maxt, maxu)); |
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
15949
diff
changeset
|
765 |
val thy' = Theory.merge(thy, Theory.merge(thyt, thyu)) |
16949
ea65d75e0ce1
tuned gen_all, forall_elim_list, implies_intr_list, standard;
wenzelm
parents:
16861
diff
changeset
|
766 |
val (tye',maxi') = Sign.typ_unify thy' (T, U) (tye, maxi) |
25470 | 767 |
handle Type.TUNIFY => raise TYPE ("Ill-typed instantiation:\nType\n" ^ |
26939
1035c89b4c02
moved global pretty/string_of functions from Sign to Syntax;
wenzelm
parents:
26653
diff
changeset
|
768 |
Syntax.string_of_typ_global thy' (Envir.norm_type tye T) ^ |
25470 | 769 |
"\nof variable " ^ |
26939
1035c89b4c02
moved global pretty/string_of functions from Sign to Syntax;
wenzelm
parents:
26653
diff
changeset
|
770 |
Syntax.string_of_term_global thy' (Term.map_types (Envir.norm_type tye) t) ^ |
25470 | 771 |
"\ncannot be unified with type\n" ^ |
26939
1035c89b4c02
moved global pretty/string_of functions from Sign to Syntax;
wenzelm
parents:
26653
diff
changeset
|
772 |
Syntax.string_of_typ_global thy' (Envir.norm_type tye U) ^ "\nof term " ^ |
1035c89b4c02
moved global pretty/string_of functions from Sign to Syntax;
wenzelm
parents:
26653
diff
changeset
|
773 |
Syntax.string_of_term_global thy' (Term.map_types (Envir.norm_type tye) u), |
25470 | 774 |
[T, U], [t, u]) |
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
15949
diff
changeset
|
775 |
in (thy', tye', maxi') end; |
8129
29e239c7b8c2
Thm.instantiate no longer normalizes, but Drule.instantiate does
paulson
parents:
8086
diff
changeset
|
776 |
in |
22561 | 777 |
fun cterm_instantiate [] th = th |
778 |
| cterm_instantiate ctpairs0 th = |
|
23178 | 779 |
let val (thy,tye,_) = List.foldr add_types (Thm.theory_of_thm th, Vartab.empty, 0) ctpairs0 |
18179 | 780 |
fun instT(ct,cu) = |
22287
9985a79735c7
cterm_instantiate was calling a type instantiation function that works only for matching,
paulson
parents:
22109
diff
changeset
|
781 |
let val inst = cterm_of thy o Term.map_types (Envir.norm_type tye) o term_of |
14340
bc93ffa674cc
correction to cterm_instantiate by Christoph Leuth
paulson
parents:
14081
diff
changeset
|
782 |
in (inst ct, inst cu) end |
22307
bb31094b4879
Completing the bug fix from the previous update: the result of unifying type
paulson
parents:
22287
diff
changeset
|
783 |
fun ctyp2 (ixn, (S, T)) = (ctyp_of thy (TVar (ixn, S)), ctyp_of thy (Envir.norm_type tye T)) |
8406
a217b0cd304d
Type.unify and Type.typ_match now use Vartab instead of association lists.
berghofe
parents:
8365
diff
changeset
|
784 |
in instantiate (map ctyp2 (Vartab.dest tye), map instT ctpairs0) th end |
8129
29e239c7b8c2
Thm.instantiate no longer normalizes, but Drule.instantiate does
paulson
parents:
8086
diff
changeset
|
785 |
handle TERM _ => |
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
15949
diff
changeset
|
786 |
raise THM("cterm_instantiate: incompatible theories",0,[th]) |
8129
29e239c7b8c2
Thm.instantiate no longer normalizes, but Drule.instantiate does
paulson
parents:
8086
diff
changeset
|
787 |
| TYPE (msg, _, _) => raise THM(msg, 0, [th]) |
29e239c7b8c2
Thm.instantiate no longer normalizes, but Drule.instantiate does
paulson
parents:
8086
diff
changeset
|
788 |
end; |
29e239c7b8c2
Thm.instantiate no longer normalizes, but Drule.instantiate does
paulson
parents:
8086
diff
changeset
|
789 |
|
29e239c7b8c2
Thm.instantiate no longer normalizes, but Drule.instantiate does
paulson
parents:
8086
diff
changeset
|
790 |
|
19775 | 791 |
(** protected propositions and embedded terms **) |
4789 | 792 |
|
793 |
local |
|
26487 | 794 |
val A = certify (Free ("A", propT)); |
26424 | 795 |
val get_axiom = Thm.unvarify o Thm.get_axiom (Context.the_theory (Context.the_thread_data ())); |
796 |
val prop_def = get_axiom "prop_def"; |
|
797 |
val term_def = get_axiom "term_def"; |
|
4789 | 798 |
in |
26487 | 799 |
val protect = Thm.capply (certify Logic.protectC); |
21437 | 800 |
val protectI = store_thm "protectI" (PureThy.kind_rule Thm.internalK (standard |
18025 | 801 |
(Thm.equal_elim (Thm.symmetric prop_def) (Thm.assume A)))); |
21437 | 802 |
val protectD = store_thm "protectD" (PureThy.kind_rule Thm.internalK (standard |
18025 | 803 |
(Thm.equal_elim prop_def (Thm.assume (protect A))))); |
18179 | 804 |
val protect_cong = store_standard_thm_open "protect_cong" (Thm.reflexive (protect A)); |
19775 | 805 |
|
21437 | 806 |
val termI = store_thm "termI" (PureThy.kind_rule Thm.internalK (standard |
19775 | 807 |
(Thm.equal_elim (Thm.symmetric term_def) (Thm.forall_intr A (Thm.trivial A))))); |
4789 | 808 |
end; |
809 |
||
18025 | 810 |
fun implies_intr_protected asms th = |
18118 | 811 |
let val asms' = map protect asms in |
812 |
implies_elim_list |
|
813 |
(implies_intr_list asms th) |
|
814 |
(map (fn asm' => Thm.assume asm' RS protectD) asms') |
|
815 |
|> implies_intr_list asms' |
|
816 |
end; |
|
11815 | 817 |
|
19775 | 818 |
fun mk_term ct = |
819 |
let |
|
26627
dac6d56b7c8d
rep_cterm/rep_thm: no longer dereference theory_ref;
wenzelm
parents:
26487
diff
changeset
|
820 |
val thy = Thm.theory_of_cterm ct; |
19775 | 821 |
val cert = Thm.cterm_of thy; |
822 |
val certT = Thm.ctyp_of thy; |
|
26627
dac6d56b7c8d
rep_cterm/rep_thm: no longer dereference theory_ref;
wenzelm
parents:
26487
diff
changeset
|
823 |
val T = Thm.typ_of (Thm.ctyp_of_term ct); |
19775 | 824 |
val a = certT (TVar (("'a", 0), [])); |
825 |
val x = cert (Var (("x", 0), T)); |
|
826 |
in Thm.instantiate ([(a, certT T)], [(x, ct)]) termI end; |
|
827 |
||
828 |
fun dest_term th = |
|
21566 | 829 |
let val cprop = strip_imp_concl (Thm.cprop_of th) in |
19775 | 830 |
if can Logic.dest_term (Thm.term_of cprop) then |
20579 | 831 |
Thm.dest_arg cprop |
19775 | 832 |
else raise THM ("dest_term", 0, [th]) |
833 |
end; |
|
834 |
||
21519 | 835 |
fun cterm_rule f = dest_term o f o mk_term; |
836 |
fun term_rule thy f t = Thm.term_of (cterm_rule f (Thm.cterm_of thy t)); |
|
20881 | 837 |
|
26487 | 838 |
val dummy_thm = mk_term (certify (Term.dummy_pattern propT)); |
24005 | 839 |
|
840 |
||
4789 | 841 |
|
5688 | 842 |
(** variations on instantiate **) |
4285 | 843 |
|
844 |
(* instantiate by left-to-right occurrence of variables *) |
|
845 |
||
846 |
fun instantiate' cTs cts thm = |
|
847 |
let |
|
848 |
fun err msg = |
|
849 |
raise TYPE ("instantiate': " ^ msg, |
|
19482
9f11af8f7ef9
tuned basic list operators (flat, maps, map_filter);
wenzelm
parents:
19421
diff
changeset
|
850 |
map_filter (Option.map Thm.typ_of) cTs, |
9f11af8f7ef9
tuned basic list operators (flat, maps, map_filter);
wenzelm
parents:
19421
diff
changeset
|
851 |
map_filter (Option.map Thm.term_of) cts); |
4285 | 852 |
|
853 |
fun inst_of (v, ct) = |
|
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
15949
diff
changeset
|
854 |
(Thm.cterm_of (Thm.theory_of_cterm ct) (Var v), ct) |
4285 | 855 |
handle TYPE (msg, _, _) => err msg; |
856 |
||
15797 | 857 |
fun tyinst_of (v, cT) = |
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
15949
diff
changeset
|
858 |
(Thm.ctyp_of (Thm.theory_of_ctyp cT) (TVar v), cT) |
15797 | 859 |
handle TYPE (msg, _, _) => err msg; |
860 |
||
20298 | 861 |
fun zip_vars xs ys = |
862 |
zip_options xs ys handle Library.UnequalLengths => |
|
863 |
err "more instantiations than variables in thm"; |
|
4285 | 864 |
|
865 |
(*instantiate types first!*) |
|
866 |
val thm' = |
|
867 |
if forall is_none cTs then thm |
|
20298 | 868 |
else Thm.instantiate |
22695
17073e9b94f2
moved Drule.plain_prop_of, Drule.fold_terms to more_thm.ML;
wenzelm
parents:
22681
diff
changeset
|
869 |
(map tyinst_of (zip_vars (rev (Thm.fold_terms Term.add_tvars thm [])) cTs), []) thm; |
20579 | 870 |
val thm'' = |
4285 | 871 |
if forall is_none cts then thm' |
20298 | 872 |
else Thm.instantiate |
22695
17073e9b94f2
moved Drule.plain_prop_of, Drule.fold_terms to more_thm.ML;
wenzelm
parents:
22681
diff
changeset
|
873 |
([], map inst_of (zip_vars (rev (Thm.fold_terms Term.add_vars thm' [])) cts)) thm'; |
20298 | 874 |
in thm'' end; |
4285 | 875 |
|
876 |
||
14081 | 877 |
|
878 |
(** renaming of bound variables **) |
|
879 |
||
880 |
(* replace bound variables x_i in thm by y_i *) |
|
881 |
(* where vs = [(x_1, y_1), ..., (x_n, y_n)] *) |
|
882 |
||
883 |
fun rename_bvars [] thm = thm |
|
884 |
| rename_bvars vs thm = |
|
26627
dac6d56b7c8d
rep_cterm/rep_thm: no longer dereference theory_ref;
wenzelm
parents:
26487
diff
changeset
|
885 |
let |
dac6d56b7c8d
rep_cterm/rep_thm: no longer dereference theory_ref;
wenzelm
parents:
26487
diff
changeset
|
886 |
val cert = Thm.cterm_of (Thm.theory_of_thm thm); |
dac6d56b7c8d
rep_cterm/rep_thm: no longer dereference theory_ref;
wenzelm
parents:
26487
diff
changeset
|
887 |
fun ren (Abs (x, T, t)) = Abs (AList.lookup (op =) vs x |> the_default x, T, ren t) |
dac6d56b7c8d
rep_cterm/rep_thm: no longer dereference theory_ref;
wenzelm
parents:
26487
diff
changeset
|
888 |
| ren (t $ u) = ren t $ ren u |
dac6d56b7c8d
rep_cterm/rep_thm: no longer dereference theory_ref;
wenzelm
parents:
26487
diff
changeset
|
889 |
| ren t = t; |
dac6d56b7c8d
rep_cterm/rep_thm: no longer dereference theory_ref;
wenzelm
parents:
26487
diff
changeset
|
890 |
in equal_elim (reflexive (cert (ren (Thm.prop_of thm)))) thm end; |
14081 | 891 |
|
892 |
||
893 |
(* renaming in left-to-right order *) |
|
894 |
||
895 |
fun rename_bvars' xs thm = |
|
896 |
let |
|
26627
dac6d56b7c8d
rep_cterm/rep_thm: no longer dereference theory_ref;
wenzelm
parents:
26487
diff
changeset
|
897 |
val cert = Thm.cterm_of (Thm.theory_of_thm thm); |
dac6d56b7c8d
rep_cterm/rep_thm: no longer dereference theory_ref;
wenzelm
parents:
26487
diff
changeset
|
898 |
val prop = Thm.prop_of thm; |
14081 | 899 |
fun rename [] t = ([], t) |
900 |
| rename (x' :: xs) (Abs (x, T, t)) = |
|
901 |
let val (xs', t') = rename xs t |
|
18929 | 902 |
in (xs', Abs (the_default x x', T, t')) end |
14081 | 903 |
| rename xs (t $ u) = |
904 |
let |
|
905 |
val (xs', t') = rename xs t; |
|
906 |
val (xs'', u') = rename xs' u |
|
907 |
in (xs'', t' $ u') end |
|
908 |
| rename xs t = (xs, t); |
|
909 |
in case rename xs prop of |
|
26627
dac6d56b7c8d
rep_cterm/rep_thm: no longer dereference theory_ref;
wenzelm
parents:
26487
diff
changeset
|
910 |
([], prop') => equal_elim (reflexive (cert prop')) thm |
14081 | 911 |
| _ => error "More names than abstractions in theorem" |
912 |
end; |
|
913 |
||
914 |
||
11975 | 915 |
|
18225 | 916 |
(** multi_resolve **) |
917 |
||
918 |
local |
|
919 |
||
920 |
fun res th i rule = |
|
921 |
Thm.biresolution false [(false, th)] i rule handle THM _ => Seq.empty; |
|
922 |
||
923 |
fun multi_res _ [] rule = Seq.single rule |
|
924 |
| multi_res i (th :: ths) rule = Seq.maps (res th i) (multi_res (i + 1) ths rule); |
|
925 |
||
926 |
in |
|
927 |
||
928 |
val multi_resolve = multi_res 1; |
|
929 |
fun multi_resolves facts rules = Seq.maps (multi_resolve facts) (Seq.of_list rules); |
|
930 |
||
931 |
end; |
|
932 |
||
11975 | 933 |
end; |
5903 | 934 |
|
935 |
structure BasicDrule: BASIC_DRULE = Drule; |
|
936 |
open BasicDrule; |