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