author | huffman |
Thu, 26 May 2005 02:23:27 +0200 | |
changeset 16081 | 81a4b4a245b0 |
parent 15949 | fd02dd265b78 |
child 16425 | 2427be27cc60 |
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 |
||
13606
2f121149acfe
Removed nRS again because extract_rews now takes care of preserving names.
berghofe
parents:
13569
diff
changeset
|
9 |
infix 0 RS RSN RL RLN MRS MRL OF COMP; |
0 | 10 |
|
5903 | 11 |
signature BASIC_DRULE = |
3766 | 12 |
sig |
9547 | 13 |
val mk_implies : cterm * cterm -> cterm |
14 |
val list_implies : cterm list * cterm -> cterm |
|
4285 | 15 |
val dest_implies : cterm -> cterm * cterm |
10414 | 16 |
val dest_equals : cterm -> cterm * cterm |
8328 | 17 |
val strip_imp_prems : cterm -> cterm list |
10414 | 18 |
val strip_imp_concl : cterm -> cterm |
8328 | 19 |
val cprems_of : thm -> cterm list |
15797 | 20 |
val cterm_fun : (term -> term) -> (cterm -> cterm) |
21 |
val ctyp_fun : (typ -> typ) -> (ctyp -> ctyp) |
|
8328 | 22 |
val read_insts : |
4285 | 23 |
Sign.sg -> (indexname -> typ option) * (indexname -> sort option) |
24 |
-> (indexname -> typ option) * (indexname -> sort option) |
|
15442
3b75e1b22ff1
Added variants of instantiation functions that operate on pairs of type
berghofe
parents:
15262
diff
changeset
|
25 |
-> string list -> (indexname * string) list |
15797 | 26 |
-> (ctyp * ctyp) list * (cterm * cterm) list |
4285 | 27 |
val types_sorts: thm -> (indexname-> typ option) * (indexname-> sort option) |
7636 | 28 |
val strip_shyps_warning : thm -> thm |
8328 | 29 |
val forall_intr_list : cterm list -> thm -> thm |
30 |
val forall_intr_frees : thm -> thm |
|
31 |
val forall_intr_vars : thm -> thm |
|
32 |
val forall_elim_list : cterm list -> thm -> thm |
|
33 |
val forall_elim_var : int -> thm -> thm |
|
34 |
val forall_elim_vars : int -> thm -> thm |
|
12725 | 35 |
val gen_all : thm -> thm |
8328 | 36 |
val freeze_thaw : thm -> thm * (thm -> thm) |
15495
50fde6f04e4c
new treatment of demodulation in proof reconstruction
paulson
parents:
15442
diff
changeset
|
37 |
val freeze_thaw_robust: thm -> thm * (int -> thm -> thm) |
8328 | 38 |
val implies_elim_list : thm -> thm list -> thm |
39 |
val implies_intr_list : cterm list -> thm -> thm |
|
8129
29e239c7b8c2
Thm.instantiate no longer normalizes, but Drule.instantiate does
paulson
parents:
8086
diff
changeset
|
40 |
val instantiate : |
15797 | 41 |
(ctyp * ctyp) list * (cterm * cterm) list -> thm -> thm |
8328 | 42 |
val zero_var_indexes : thm -> thm |
43 |
val standard : thm -> thm |
|
11512
da3a96ab5630
Some basic rules are now stored with "open" derivations, to facilitate
berghofe
parents:
11163
diff
changeset
|
44 |
val standard' : thm -> thm |
4610
b1322be47244
Tidying; rotate_prems; moved freeze_thaw from tactic.ML
paulson
parents:
4588
diff
changeset
|
45 |
val rotate_prems : int -> thm -> thm |
11163 | 46 |
val rearrange_prems : int list -> thm -> thm |
8328 | 47 |
val assume_ax : theory -> string -> thm |
48 |
val RSN : thm * (int * thm) -> thm |
|
49 |
val RS : thm * thm -> thm |
|
50 |
val RLN : thm list * (int * thm list) -> thm list |
|
51 |
val RL : thm list * thm list -> thm list |
|
52 |
val MRS : thm list * thm -> thm |
|
53 |
val MRL : thm list list * thm list -> thm list |
|
9288
06a55195741b
infix 'OF' is a version of 'MRS' with more appropriate argument order;
wenzelm
parents:
8605
diff
changeset
|
54 |
val OF : thm * thm list -> thm |
8328 | 55 |
val compose : thm * int * thm -> thm list |
56 |
val COMP : thm * thm -> thm |
|
0 | 57 |
val read_instantiate_sg: Sign.sg -> (string*string)list -> thm -> thm |
8328 | 58 |
val read_instantiate : (string*string)list -> thm -> thm |
59 |
val cterm_instantiate : (cterm*cterm)list -> thm -> thm |
|
13105
3d1e7a199bdc
use eq_thm_prop instead of slightly inadequate eq_thm;
wenzelm
parents:
12908
diff
changeset
|
60 |
val eq_thm_sg : thm * thm -> bool |
3d1e7a199bdc
use eq_thm_prop instead of slightly inadequate eq_thm;
wenzelm
parents:
12908
diff
changeset
|
61 |
val eq_thm_prop : thm * thm -> bool |
8328 | 62 |
val weak_eq_thm : thm * thm -> bool |
63 |
val size_of_thm : thm -> int |
|
64 |
val reflexive_thm : thm |
|
65 |
val symmetric_thm : thm |
|
66 |
val transitive_thm : thm |
|
4679 | 67 |
val symmetric_fun : thm -> thm |
11512
da3a96ab5630
Some basic rules are now stored with "open" derivations, to facilitate
berghofe
parents:
11163
diff
changeset
|
68 |
val extensional : thm -> thm |
10414 | 69 |
val imp_cong : thm |
70 |
val swap_prems_eq : thm |
|
8328 | 71 |
val equal_abs_elim : cterm -> thm -> thm |
4285 | 72 |
val equal_abs_elim_list: cterm list -> thm -> thm |
8328 | 73 |
val asm_rl : thm |
74 |
val cut_rl : thm |
|
75 |
val revcut_rl : thm |
|
76 |
val thin_rl : thm |
|
4285 | 77 |
val triv_forall_equality: thm |
1756 | 78 |
val swap_prems_rl : thm |
4285 | 79 |
val equal_intr_rule : thm |
13368 | 80 |
val equal_elim_rule1 : thm |
8550
b44c185f8018
new meta-rule "inst", a shorthand for read_instantiate_sg
paulson
parents:
8496
diff
changeset
|
81 |
val inst : string -> string -> thm -> thm |
8328 | 82 |
val instantiate' : ctyp option list -> cterm option list -> thm -> thm |
83 |
val incr_indexes_wrt : int list -> ctyp list -> cterm list -> thm list -> thm -> thm |
|
5903 | 84 |
end; |
85 |
||
86 |
signature DRULE = |
|
87 |
sig |
|
88 |
include BASIC_DRULE |
|
15949 | 89 |
val list_comb: cterm * cterm list -> cterm |
12908
53bfe07a7916
New function strip_comb (cterm version of Term.strip_comb).
berghofe
parents:
12800
diff
changeset
|
90 |
val strip_comb: cterm -> cterm * cterm list |
15262 | 91 |
val strip_type: ctyp -> ctyp list * ctyp |
15949 | 92 |
val beta_conv: cterm -> cterm -> cterm |
15875 | 93 |
val plain_prop_of: thm -> term |
15669 | 94 |
val add_used: thm -> string list -> string list |
11975 | 95 |
val rule_attribute: ('a -> thm -> thm) -> 'a attribute |
96 |
val tag_rule: tag -> thm -> thm |
|
97 |
val untag_rule: string -> thm -> thm |
|
98 |
val tag: tag -> 'a attribute |
|
99 |
val untag: string -> 'a attribute |
|
100 |
val get_kind: thm -> string |
|
101 |
val kind: string -> 'a attribute |
|
102 |
val theoremK: string |
|
103 |
val lemmaK: string |
|
104 |
val corollaryK: string |
|
105 |
val internalK: string |
|
106 |
val kind_internal: 'a attribute |
|
107 |
val has_internal: tag list -> bool |
|
108 |
val impose_hyps: cterm list -> thm -> thm |
|
13389 | 109 |
val satisfy_hyps: thm list -> thm -> thm |
11975 | 110 |
val close_derivation: thm -> thm |
12005 | 111 |
val local_standard: thm -> thm |
11975 | 112 |
val compose_single: thm * int * thm -> thm |
12373 | 113 |
val add_rule: thm -> thm list -> thm list |
114 |
val del_rule: thm -> thm list -> thm list |
|
11975 | 115 |
val add_rules: thm list -> thm list -> thm list |
116 |
val del_rules: thm list -> thm list -> thm list |
|
117 |
val merge_rules: thm list * thm list -> thm list |
|
15001
fb2141a9f8c0
Moved conversion rules from MetaSimplifier to Drule. refl_implies removed
skalberg
parents:
14854
diff
changeset
|
118 |
val imp_cong' : thm -> thm -> thm |
fb2141a9f8c0
Moved conversion rules from MetaSimplifier to Drule. refl_implies removed
skalberg
parents:
14854
diff
changeset
|
119 |
val beta_eta_conversion: cterm -> thm |
15925 | 120 |
val eta_long_conversion: cterm -> thm |
15001
fb2141a9f8c0
Moved conversion rules from MetaSimplifier to Drule. refl_implies removed
skalberg
parents:
14854
diff
changeset
|
121 |
val goals_conv : (int -> bool) -> (cterm -> thm) -> cterm -> thm |
fb2141a9f8c0
Moved conversion rules from MetaSimplifier to Drule. refl_implies removed
skalberg
parents:
14854
diff
changeset
|
122 |
val forall_conv : (cterm -> thm) -> cterm -> thm |
fb2141a9f8c0
Moved conversion rules from MetaSimplifier to Drule. refl_implies removed
skalberg
parents:
14854
diff
changeset
|
123 |
val fconv_rule : (cterm -> thm) -> thm -> thm |
11975 | 124 |
val norm_hhf_eq: thm |
12800 | 125 |
val is_norm_hhf: term -> bool |
126 |
val norm_hhf: Sign.sg -> term -> term |
|
11975 | 127 |
val triv_goal: thm |
128 |
val rev_triv_goal: thm |
|
11815 | 129 |
val implies_intr_goals: cterm list -> thm -> thm |
11975 | 130 |
val freeze_all: thm -> thm |
131 |
val mk_triv_goal: cterm -> thm |
|
132 |
val tvars_of_terms: term list -> (indexname * sort) list |
|
133 |
val vars_of_terms: term list -> (indexname * typ) list |
|
134 |
val tvars_of: thm -> (indexname * sort) list |
|
135 |
val vars_of: thm -> (indexname * typ) list |
|
14081 | 136 |
val rename_bvars: (string * string) list -> thm -> thm |
137 |
val rename_bvars': string option list -> thm -> thm |
|
11975 | 138 |
val unvarifyT: thm -> thm |
139 |
val unvarify: thm -> thm |
|
15797 | 140 |
val tvars_intr_list: string list -> thm -> thm * (string * (indexname * sort)) list |
12297 | 141 |
val remdups_rl: thm |
11975 | 142 |
val conj_intr: thm -> thm -> thm |
143 |
val conj_intr_list: thm list -> thm |
|
144 |
val conj_elim: thm -> thm * thm |
|
145 |
val conj_elim_list: thm -> thm list |
|
12135 | 146 |
val conj_elim_precise: int -> thm -> thm list |
147 |
val conj_intr_thm: thm |
|
13325 | 148 |
val abs_def: thm -> thm |
15797 | 149 |
val read_instantiate_sg': Sign.sg -> (indexname * string) list -> thm -> thm |
150 |
val read_instantiate': (indexname * string) list -> thm -> thm |
|
3766 | 151 |
end; |
0 | 152 |
|
5903 | 153 |
structure Drule: DRULE = |
0 | 154 |
struct |
155 |
||
3991 | 156 |
|
708
8422e50adce0
Pure/drule/cprems_of, cskip_flexpairs, cstrip_imp_prems: new cterm operations
lcp
parents:
668
diff
changeset
|
157 |
(** some cterm->cterm operations: much faster than calling cterm_of! **) |
8422e50adce0
Pure/drule/cprems_of, cskip_flexpairs, cstrip_imp_prems: new cterm operations
lcp
parents:
668
diff
changeset
|
158 |
|
2004
3411fe560611
New operations on cterms. Now same names as in Logic
paulson
parents:
1906
diff
changeset
|
159 |
(** SAME NAMES as in structure Logic: use compound identifiers! **) |
3411fe560611
New operations on cterms. Now same names as in Logic
paulson
parents:
1906
diff
changeset
|
160 |
|
1703
e22ad43bab5f
moved dest_cimplies to drule.ML; added adjust_maxidx
clasohm
parents:
1596
diff
changeset
|
161 |
(*dest_implies for cterms. Note T=prop below*) |
2004
3411fe560611
New operations on cterms. Now same names as in Logic
paulson
parents:
1906
diff
changeset
|
162 |
fun dest_implies ct = |
8328 | 163 |
case term_of ct of |
164 |
(Const("==>", _) $ _ $ _) => |
|
10767
8fa4aafa7314
Thm: dest_comb, dest_abs, capply, cabs no longer global;
wenzelm
parents:
10667
diff
changeset
|
165 |
let val (ct1,ct2) = Thm.dest_comb ct |
8fa4aafa7314
Thm: dest_comb, dest_abs, capply, cabs no longer global;
wenzelm
parents:
10667
diff
changeset
|
166 |
in (#2 (Thm.dest_comb ct1), ct2) end |
2004
3411fe560611
New operations on cterms. Now same names as in Logic
paulson
parents:
1906
diff
changeset
|
167 |
| _ => raise TERM ("dest_implies", [term_of ct]) ; |
1703
e22ad43bab5f
moved dest_cimplies to drule.ML; added adjust_maxidx
clasohm
parents:
1596
diff
changeset
|
168 |
|
10414 | 169 |
fun dest_equals ct = |
170 |
case term_of ct of |
|
171 |
(Const("==", _) $ _ $ _) => |
|
10767
8fa4aafa7314
Thm: dest_comb, dest_abs, capply, cabs no longer global;
wenzelm
parents:
10667
diff
changeset
|
172 |
let val (ct1,ct2) = Thm.dest_comb ct |
8fa4aafa7314
Thm: dest_comb, dest_abs, capply, cabs no longer global;
wenzelm
parents:
10667
diff
changeset
|
173 |
in (#2 (Thm.dest_comb ct1), ct2) end |
10414 | 174 |
| _ => raise TERM ("dest_equals", [term_of ct]) ; |
175 |
||
1703
e22ad43bab5f
moved dest_cimplies to drule.ML; added adjust_maxidx
clasohm
parents:
1596
diff
changeset
|
176 |
|
708
8422e50adce0
Pure/drule/cprems_of, cskip_flexpairs, cstrip_imp_prems: new cterm operations
lcp
parents:
668
diff
changeset
|
177 |
(* 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
|
178 |
fun strip_imp_prems ct = |
3411fe560611
New operations on cterms. Now same names as in Logic
paulson
parents:
1906
diff
changeset
|
179 |
let val (cA,cB) = dest_implies ct |
3411fe560611
New operations on cterms. Now same names as in Logic
paulson
parents:
1906
diff
changeset
|
180 |
in cA :: strip_imp_prems cB end |
708
8422e50adce0
Pure/drule/cprems_of, cskip_flexpairs, cstrip_imp_prems: new cterm operations
lcp
parents:
668
diff
changeset
|
181 |
handle TERM _ => []; |
8422e50adce0
Pure/drule/cprems_of, cskip_flexpairs, cstrip_imp_prems: new cterm operations
lcp
parents:
668
diff
changeset
|
182 |
|
2004
3411fe560611
New operations on cterms. Now same names as in Logic
paulson
parents:
1906
diff
changeset
|
183 |
(* 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
|
184 |
fun strip_imp_concl ct = |
8328 | 185 |
case term_of ct of (Const("==>", _) $ _ $ _) => |
10767
8fa4aafa7314
Thm: dest_comb, dest_abs, capply, cabs no longer global;
wenzelm
parents:
10667
diff
changeset
|
186 |
strip_imp_concl (#2 (Thm.dest_comb ct)) |
2004
3411fe560611
New operations on cterms. Now same names as in Logic
paulson
parents:
1906
diff
changeset
|
187 |
| _ => ct; |
3411fe560611
New operations on cterms. Now same names as in Logic
paulson
parents:
1906
diff
changeset
|
188 |
|
708
8422e50adce0
Pure/drule/cprems_of, cskip_flexpairs, cstrip_imp_prems: new cterm operations
lcp
parents:
668
diff
changeset
|
189 |
(*The premises of a theorem, as a cterm list*) |
13659
3cf622f6b0b2
Removed obsolete functions dealing with flex-flex constraints.
berghofe
parents:
13650
diff
changeset
|
190 |
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
|
191 |
|
15797 | 192 |
fun cterm_fun f ct = |
193 |
let val {t, sign, ...} = Thm.rep_cterm ct |
|
194 |
in Thm.cterm_of sign (f t) end; |
|
195 |
||
196 |
fun ctyp_fun f cT = |
|
197 |
let val {T, sign, ...} = Thm.rep_ctyp cT |
|
198 |
in Thm.ctyp_of sign (f T) end; |
|
199 |
||
9547 | 200 |
val proto_sign = Theory.sign_of ProtoPure.thy; |
201 |
||
202 |
val implies = cterm_of proto_sign Term.implies; |
|
203 |
||
204 |
(*cterm version of mk_implies*) |
|
10767
8fa4aafa7314
Thm: dest_comb, dest_abs, capply, cabs no longer global;
wenzelm
parents:
10667
diff
changeset
|
205 |
fun mk_implies(A,B) = Thm.capply (Thm.capply implies A) B; |
9547 | 206 |
|
207 |
(*cterm version of list_implies: [A1,...,An], B goes to [|A1;==>;An|]==>B *) |
|
208 |
fun list_implies([], B) = B |
|
209 |
| list_implies(A::AS, B) = mk_implies (A, list_implies(AS,B)); |
|
210 |
||
15949 | 211 |
(*cterm version of list_comb: maps (f, [t1,...,tn]) to f(t1,...,tn) *) |
212 |
fun list_comb (f, []) = f |
|
213 |
| list_comb (f, t::ts) = list_comb (Thm.capply f t, ts); |
|
214 |
||
12908
53bfe07a7916
New function strip_comb (cterm version of Term.strip_comb).
berghofe
parents:
12800
diff
changeset
|
215 |
(*cterm version of strip_comb: maps f(t1,...,tn) to (f, [t1,...,tn]) *) |
53bfe07a7916
New function strip_comb (cterm version of Term.strip_comb).
berghofe
parents:
12800
diff
changeset
|
216 |
fun strip_comb ct = |
53bfe07a7916
New function strip_comb (cterm version of Term.strip_comb).
berghofe
parents:
12800
diff
changeset
|
217 |
let |
53bfe07a7916
New function strip_comb (cterm version of Term.strip_comb).
berghofe
parents:
12800
diff
changeset
|
218 |
fun stripc (p as (ct, cts)) = |
53bfe07a7916
New function strip_comb (cterm version of Term.strip_comb).
berghofe
parents:
12800
diff
changeset
|
219 |
let val (ct1, ct2) = Thm.dest_comb ct |
53bfe07a7916
New function strip_comb (cterm version of Term.strip_comb).
berghofe
parents:
12800
diff
changeset
|
220 |
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
|
221 |
in stripc (ct, []) end; |
53bfe07a7916
New function strip_comb (cterm version of Term.strip_comb).
berghofe
parents:
12800
diff
changeset
|
222 |
|
15262 | 223 |
(* cterm version of strip_type: maps [T1,...,Tn]--->T to ([T1,T2,...,Tn], T) *) |
224 |
fun strip_type cT = (case Thm.typ_of cT of |
|
225 |
Type ("fun", _) => |
|
226 |
let |
|
227 |
val [cT1, cT2] = Thm.dest_ctyp cT; |
|
228 |
val (cTs, cT') = strip_type cT2 |
|
229 |
in (cT1 :: cTs, cT') end |
|
230 |
| _ => ([], cT)); |
|
231 |
||
15949 | 232 |
(*Beta-conversion for cterms, where x is an abstraction. Simply returns the rhs |
233 |
of the meta-equality returned by the beta_conversion rule.*) |
|
234 |
fun beta_conv x y = |
|
235 |
#2 (Thm.dest_comb (cprop_of (Thm.beta_conversion false (Thm.capply x y)))); |
|
236 |
||
15875 | 237 |
fun plain_prop_of raw_thm = |
238 |
let |
|
239 |
val thm = Thm.strip_shyps raw_thm; |
|
240 |
fun err msg = raise THM ("plain_prop_of: " ^ msg, 0, [thm]); |
|
241 |
val {hyps, prop, tpairs, ...} = Thm.rep_thm thm; |
|
242 |
in |
|
243 |
if not (null hyps) then |
|
244 |
err "theorem may not contain hypotheses" |
|
245 |
else if not (null (Thm.extra_shyps thm)) then |
|
246 |
err "theorem may not contain sort hypotheses" |
|
247 |
else if not (null tpairs) then |
|
248 |
err "theorem may not contain flex-flex pairs" |
|
249 |
else prop |
|
250 |
end; |
|
251 |
||
252 |
||
708
8422e50adce0
Pure/drule/cprems_of, cskip_flexpairs, cstrip_imp_prems: new cterm operations
lcp
parents:
668
diff
changeset
|
253 |
|
229
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
214
diff
changeset
|
254 |
(** reading of instantiations **) |
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
214
diff
changeset
|
255 |
|
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
214
diff
changeset
|
256 |
fun absent ixn = |
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
214
diff
changeset
|
257 |
error("No such variable in term: " ^ Syntax.string_of_vname ixn); |
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
214
diff
changeset
|
258 |
|
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
214
diff
changeset
|
259 |
fun inst_failure ixn = |
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
214
diff
changeset
|
260 |
error("Instantiation of " ^ Syntax.string_of_vname ixn ^ " fails"); |
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
214
diff
changeset
|
261 |
|
4281
6c6073b13600
Added read_def_cterms for simultaneous reading/typing of terms under
nipkow
parents:
4270
diff
changeset
|
262 |
fun read_insts sign (rtypes,rsorts) (types,sorts) used insts = |
10403 | 263 |
let |
15442
3b75e1b22ff1
Added variants of instantiation functions that operate on pairs of type
berghofe
parents:
15262
diff
changeset
|
264 |
fun is_tv ((a, _), _) = |
3b75e1b22ff1
Added variants of instantiation functions that operate on pairs of type
berghofe
parents:
15262
diff
changeset
|
265 |
(case Symbol.explode a of "'" :: _ => true | _ => false); |
15570 | 266 |
val (tvs, vs) = List.partition is_tv insts; |
15797 | 267 |
fun sort_of ixn = case rsorts ixn of SOME S => S | NONE => absent ixn; |
15442
3b75e1b22ff1
Added variants of instantiation functions that operate on pairs of type
berghofe
parents:
15262
diff
changeset
|
268 |
fun readT (ixn, st) = |
15797 | 269 |
let val S = sort_of ixn; |
4281
6c6073b13600
Added read_def_cterms for simultaneous reading/typing of terms under
nipkow
parents:
4270
diff
changeset
|
270 |
val T = Sign.read_typ (sign,sorts) st; |
10403 | 271 |
in if Sign.typ_instance sign (T, TVar(ixn,S)) then (ixn,T) |
4281
6c6073b13600
Added read_def_cterms for simultaneous reading/typing of terms under
nipkow
parents:
4270
diff
changeset
|
272 |
else inst_failure ixn |
6c6073b13600
Added read_def_cterms for simultaneous reading/typing of terms under
nipkow
parents:
4270
diff
changeset
|
273 |
end |
6c6073b13600
Added read_def_cterms for simultaneous reading/typing of terms under
nipkow
parents:
4270
diff
changeset
|
274 |
val tye = map readT tvs; |
6c6073b13600
Added read_def_cterms for simultaneous reading/typing of terms under
nipkow
parents:
4270
diff
changeset
|
275 |
fun mkty(ixn,st) = (case rtypes ixn of |
15531 | 276 |
SOME T => (ixn,(st,typ_subst_TVars tye T)) |
277 |
| NONE => absent ixn); |
|
4281
6c6073b13600
Added read_def_cterms for simultaneous reading/typing of terms under
nipkow
parents:
4270
diff
changeset
|
278 |
val ixnsTs = map mkty vs; |
6c6073b13600
Added read_def_cterms for simultaneous reading/typing of terms under
nipkow
parents:
4270
diff
changeset
|
279 |
val ixns = map fst ixnsTs |
6c6073b13600
Added read_def_cterms for simultaneous reading/typing of terms under
nipkow
parents:
4270
diff
changeset
|
280 |
and sTs = map snd ixnsTs |
6c6073b13600
Added read_def_cterms for simultaneous reading/typing of terms under
nipkow
parents:
4270
diff
changeset
|
281 |
val (cts,tye2) = read_def_cterms(sign,types,sorts) used false sTs; |
6c6073b13600
Added read_def_cterms for simultaneous reading/typing of terms under
nipkow
parents:
4270
diff
changeset
|
282 |
fun mkcVar(ixn,T) = |
6c6073b13600
Added read_def_cterms for simultaneous reading/typing of terms under
nipkow
parents:
4270
diff
changeset
|
283 |
let val U = typ_subst_TVars tye2 T |
6c6073b13600
Added read_def_cterms for simultaneous reading/typing of terms under
nipkow
parents:
4270
diff
changeset
|
284 |
in cterm_of sign (Var(ixn,U)) end |
6c6073b13600
Added read_def_cterms for simultaneous reading/typing of terms under
nipkow
parents:
4270
diff
changeset
|
285 |
val ixnTs = ListPair.zip(ixns, map snd sTs) |
15797 | 286 |
in (map (fn (ixn, T) => (ctyp_of sign (TVar (ixn, sort_of ixn)), |
287 |
ctyp_of sign T)) (tye2 @ tye), |
|
4281
6c6073b13600
Added read_def_cterms for simultaneous reading/typing of terms under
nipkow
parents:
4270
diff
changeset
|
288 |
ListPair.zip(map mkcVar ixnTs,cts)) |
6c6073b13600
Added read_def_cterms for simultaneous reading/typing of terms under
nipkow
parents:
4270
diff
changeset
|
289 |
end; |
229
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
214
diff
changeset
|
290 |
|
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
214
diff
changeset
|
291 |
|
252
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
292 |
(*** Find the type (sort) associated with a (T)Var or (T)Free in a term |
0 | 293 |
Used for establishing default types (of variables) and sorts (of |
294 |
type variables) when reading another term. |
|
295 |
Index -1 indicates that a (T)Free rather than a (T)Var is wanted. |
|
296 |
***) |
|
297 |
||
298 |
fun types_sorts thm = |
|
15669 | 299 |
let val {prop, hyps, tpairs, ...} = Thm.rep_thm thm; |
300 |
(* bogus term! *) |
|
15949 | 301 |
val big = Term.list_comb |
302 |
(Term.list_comb (prop, hyps), Thm.terms_of_tpairs tpairs); |
|
252
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
303 |
val vars = map dest_Var (term_vars big); |
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
304 |
val frees = map dest_Free (term_frees big); |
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
305 |
val tvars = term_tvars big; |
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
306 |
val tfrees = term_tfrees big; |
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
307 |
fun typ(a,i) = if i<0 then assoc(frees,a) else assoc(vars,(a,i)); |
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
308 |
fun sort(a,i) = if i<0 then assoc(tfrees,a) else assoc(tvars,(a,i)); |
0 | 309 |
in (typ,sort) end; |
310 |
||
15669 | 311 |
fun add_used thm used = |
312 |
let val {prop, hyps, tpairs, ...} = Thm.rep_thm thm in |
|
313 |
add_term_tvarnames (prop, used) |
|
314 |
|> fold (curry add_term_tvarnames) hyps |
|
315 |
|> fold (curry add_term_tvarnames) (Thm.terms_of_tpairs tpairs) |
|
316 |
end; |
|
317 |
||
7636 | 318 |
|
9455 | 319 |
|
320 |
(** basic attributes **) |
|
321 |
||
322 |
(* dependent rules *) |
|
323 |
||
324 |
fun rule_attribute f (x, thm) = (x, (f x thm)); |
|
325 |
||
326 |
||
327 |
(* add / delete tags *) |
|
328 |
||
329 |
fun map_tags f thm = |
|
330 |
Thm.put_name_tags (Thm.name_of_thm thm, f (#2 (Thm.get_name_tags thm))) thm; |
|
331 |
||
332 |
fun tag_rule tg = map_tags (fn tgs => if tg mem tgs then tgs else tgs @ [tg]); |
|
333 |
fun untag_rule s = map_tags (filter_out (equal s o #1)); |
|
334 |
||
335 |
fun tag tg x = rule_attribute (K (tag_rule tg)) x; |
|
336 |
fun untag s x = rule_attribute (K (untag_rule s)) x; |
|
337 |
||
338 |
fun simple_tag name x = tag (name, []) x; |
|
339 |
||
11741 | 340 |
|
341 |
(* theorem kinds *) |
|
342 |
||
343 |
val theoremK = "theorem"; |
|
344 |
val lemmaK = "lemma"; |
|
345 |
val corollaryK = "corollary"; |
|
346 |
val internalK = "internal"; |
|
9455 | 347 |
|
11741 | 348 |
fun get_kind thm = |
349 |
(case Library.assoc (#2 (Thm.get_name_tags thm), "kind") of |
|
15531 | 350 |
SOME (k :: _) => k |
11741 | 351 |
| _ => "unknown"); |
352 |
||
353 |
fun kind_rule k = tag_rule ("kind", [k]) o untag_rule "kind"; |
|
12710 | 354 |
fun kind k x = if k = "" then x else rule_attribute (K (kind_rule k)) x; |
11741 | 355 |
fun kind_internal x = kind internalK x; |
356 |
fun has_internal tags = exists (equal internalK o fst) tags; |
|
9455 | 357 |
|
358 |
||
359 |
||
0 | 360 |
(** Standardization of rules **) |
361 |
||
7636 | 362 |
(*Strip extraneous shyps as far as possible*) |
363 |
fun strip_shyps_warning thm = |
|
364 |
let |
|
14824 | 365 |
val str_of_sort = Pretty.str_of o Sign.pretty_sort (Thm.sign_of_thm thm); |
7636 | 366 |
val thm' = Thm.strip_shyps thm; |
367 |
val xshyps = Thm.extra_shyps thm'; |
|
368 |
in |
|
369 |
if null xshyps then () |
|
370 |
else warning ("Pending sort hypotheses: " ^ commas (map str_of_sort xshyps)); |
|
371 |
thm' |
|
372 |
end; |
|
373 |
||
0 | 374 |
(*Generalization over a list of variables, IGNORING bad ones*) |
375 |
fun forall_intr_list [] th = th |
|
376 |
| forall_intr_list (y::ys) th = |
|
252
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
377 |
let val gth = forall_intr_list ys th |
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
378 |
in forall_intr y gth handle THM _ => gth end; |
0 | 379 |
|
380 |
(*Generalization over all suitable Free variables*) |
|
381 |
fun forall_intr_frees th = |
|
382 |
let val {prop,sign,...} = rep_thm th |
|
383 |
in forall_intr_list |
|
4440 | 384 |
(map (cterm_of sign) (sort (make_ord atless) (term_frees prop))) |
0 | 385 |
th |
386 |
end; |
|
387 |
||
7898 | 388 |
val forall_elim_var = PureThy.forall_elim_var; |
389 |
val forall_elim_vars = PureThy.forall_elim_vars; |
|
0 | 390 |
|
12725 | 391 |
fun gen_all thm = |
12719
41e0d086f8b6
improved forall_elim_vars_safe (no longer invents new indexes);
wenzelm
parents:
12710
diff
changeset
|
392 |
let |
41e0d086f8b6
improved forall_elim_vars_safe (no longer invents new indexes);
wenzelm
parents:
12710
diff
changeset
|
393 |
val {sign, prop, maxidx, ...} = Thm.rep_thm thm; |
41e0d086f8b6
improved forall_elim_vars_safe (no longer invents new indexes);
wenzelm
parents:
12710
diff
changeset
|
394 |
fun elim (th, (x, T)) = Thm.forall_elim (Thm.cterm_of sign (Var ((x, maxidx + 1), T))) th; |
41e0d086f8b6
improved forall_elim_vars_safe (no longer invents new indexes);
wenzelm
parents:
12710
diff
changeset
|
395 |
val vs = Term.strip_all_vars prop; |
15570 | 396 |
in Library.foldl elim (thm, Term.variantlist (map #1 vs, []) ~~ map #2 vs) end; |
9554 | 397 |
|
0 | 398 |
(*Specialization over a list of cterms*) |
15574
b1d1b5bfc464
Removed practically all references to Library.foldr.
skalberg
parents:
15570
diff
changeset
|
399 |
fun forall_elim_list cts th = foldr (uncurry forall_elim) th (rev cts); |
0 | 400 |
|
11815 | 401 |
(* maps A1,...,An |- B to [| A1;...;An |] ==> B *) |
15574
b1d1b5bfc464
Removed practically all references to Library.foldr.
skalberg
parents:
15570
diff
changeset
|
402 |
fun implies_intr_list cAs th = foldr (uncurry implies_intr) th cAs; |
0 | 403 |
|
404 |
(* maps [| A1;...;An |] ==> B and [A1,...,An] to B *) |
|
15570 | 405 |
fun implies_elim_list impth ths = Library.foldl (uncurry implies_elim) (impth,ths); |
0 | 406 |
|
11960 | 407 |
(* maps |- B to A1,...,An |- B *) |
408 |
fun impose_hyps chyps th = |
|
12092 | 409 |
let val chyps' = gen_rems (op aconv o apfst Thm.term_of) (chyps, #hyps (Thm.rep_thm th)) |
410 |
in implies_elim_list (implies_intr_list chyps' th) (map Thm.assume chyps') end; |
|
11960 | 411 |
|
13389 | 412 |
(* maps A1,...,An and A1,...,An |- B to |- B *) |
413 |
fun satisfy_hyps ths th = |
|
414 |
implies_elim_list (implies_intr_list (map (#prop o Thm.crep_thm) ths) th) ths; |
|
415 |
||
0 | 416 |
(*Reset Var indexes to zero, renaming to preserve distinctness*) |
252
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
417 |
fun zero_var_indexes th = |
15545
0efa7126003f
Lucas - fixed bug in zero_var_indexes: it was ignoring vars in the flex-flex pairs. These are now taken into account.
dixon
parents:
15531
diff
changeset
|
418 |
let val {prop,sign,tpairs,...} = rep_thm th; |
0efa7126003f
Lucas - fixed bug in zero_var_indexes: it was ignoring vars in the flex-flex pairs. These are now taken into account.
dixon
parents:
15531
diff
changeset
|
419 |
val (tpair_l, tpair_r) = Library.split_list tpairs; |
15574
b1d1b5bfc464
Removed practically all references to Library.foldr.
skalberg
parents:
15570
diff
changeset
|
420 |
val vars = foldr add_term_vars |
b1d1b5bfc464
Removed practically all references to Library.foldr.
skalberg
parents:
15570
diff
changeset
|
421 |
(foldr add_term_vars (term_vars prop) tpair_l) tpair_r; |
15570 | 422 |
val bs = Library.foldl add_new_id ([], map (fn Var((a,_),_)=>a) vars) |
15545
0efa7126003f
Lucas - fixed bug in zero_var_indexes: it was ignoring vars in the flex-flex pairs. These are now taken into account.
dixon
parents:
15531
diff
changeset
|
423 |
val inrs = |
15574
b1d1b5bfc464
Removed practically all references to Library.foldr.
skalberg
parents:
15570
diff
changeset
|
424 |
foldr add_term_tvars |
b1d1b5bfc464
Removed practically all references to Library.foldr.
skalberg
parents:
15570
diff
changeset
|
425 |
(foldr add_term_tvars (term_tvars prop) tpair_l) tpair_r; |
15570 | 426 |
val nms' = rev(Library.foldl add_new_id ([], map (#1 o #1) inrs)); |
15797 | 427 |
val tye = ListPair.map (fn ((v, rs), a) => (TVar (v, rs), TVar ((a, 0), rs))) |
8328 | 428 |
(inrs, nms') |
15797 | 429 |
val ctye = map (pairself (ctyp_of sign)) tye; |
252
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
430 |
fun varpairs([],[]) = [] |
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
431 |
| varpairs((var as Var(v,T)) :: vars, b::bs) = |
15797 | 432 |
let val T' = typ_subst_atomic tye T |
252
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
433 |
in (cterm_of sign (Var(v,T')), |
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
434 |
cterm_of sign (Var((b,0),T'))) :: varpairs(vars,bs) |
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
435 |
end |
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
436 |
| varpairs _ = raise TERM("varpairs", []); |
8129
29e239c7b8c2
Thm.instantiate no longer normalizes, but Drule.instantiate does
paulson
parents:
8086
diff
changeset
|
437 |
in Thm.instantiate (ctye, varpairs(vars,rev bs)) th end; |
0 | 438 |
|
439 |
||
14394 | 440 |
(** Standard form of object-rule: no hypotheses, flexflex constraints, |
441 |
Frees, or outer quantifiers; all generality expressed by Vars of index 0.**) |
|
10515 | 442 |
|
14394 | 443 |
(*Squash a theorem's flexflex constraints provided it can be done uniquely. |
444 |
This step can lose information.*) |
|
14387
e96d5c42c4b0
Polymorphic treatment of binary arithmetic using axclasses
paulson
parents:
14340
diff
changeset
|
445 |
fun flexflex_unique th = |
e96d5c42c4b0
Polymorphic treatment of binary arithmetic using axclasses
paulson
parents:
14340
diff
changeset
|
446 |
case Seq.chop (2, flexflex_rule th) of |
e96d5c42c4b0
Polymorphic treatment of binary arithmetic using axclasses
paulson
parents:
14340
diff
changeset
|
447 |
([th],_) => th |
e96d5c42c4b0
Polymorphic treatment of binary arithmetic using axclasses
paulson
parents:
14340
diff
changeset
|
448 |
| ([],_) => raise THM("flexflex_unique: impossible constraints", 0, [th]) |
e96d5c42c4b0
Polymorphic treatment of binary arithmetic using axclasses
paulson
parents:
14340
diff
changeset
|
449 |
| _ => raise THM("flexflex_unique: multiple unifiers", 0, [th]); |
e96d5c42c4b0
Polymorphic treatment of binary arithmetic using axclasses
paulson
parents:
14340
diff
changeset
|
450 |
|
10515 | 451 |
fun close_derivation thm = |
452 |
if Thm.get_name_tags thm = ("", []) then Thm.name_thm ("", thm) |
|
453 |
else thm; |
|
454 |
||
11512
da3a96ab5630
Some basic rules are now stored with "open" derivations, to facilitate
berghofe
parents:
11163
diff
changeset
|
455 |
fun standard' th = |
10515 | 456 |
let val {maxidx,...} = rep_thm th in |
457 |
th |
|
14391
bb726050650d
Moved application of flexflex_unique from standard' to standard.
berghofe
parents:
14387
diff
changeset
|
458 |
|> implies_intr_hyps |
10515 | 459 |
|> forall_intr_frees |> forall_elim_vars (maxidx + 1) |
460 |
|> strip_shyps_warning |
|
11512
da3a96ab5630
Some basic rules are now stored with "open" derivations, to facilitate
berghofe
parents:
11163
diff
changeset
|
461 |
|> zero_var_indexes |> Thm.varifyT |> Thm.compress |
1218
59ed8ef1a3a1
modified pretty_thm, standard, eq_thm to handle shyps;
wenzelm
parents:
1194
diff
changeset
|
462 |
end; |
59ed8ef1a3a1
modified pretty_thm, standard, eq_thm to handle shyps;
wenzelm
parents:
1194
diff
changeset
|
463 |
|
14391
bb726050650d
Moved application of flexflex_unique from standard' to standard.
berghofe
parents:
14387
diff
changeset
|
464 |
val standard = close_derivation o standard' o flexflex_unique; |
11512
da3a96ab5630
Some basic rules are now stored with "open" derivations, to facilitate
berghofe
parents:
11163
diff
changeset
|
465 |
|
12005 | 466 |
fun local_standard th = |
12221
cc31140bba16
local_standard: plain strip_shyps instead of strip_shyps_warning;
wenzelm
parents:
12135
diff
changeset
|
467 |
th |> strip_shyps |> zero_var_indexes |
12005 | 468 |
|> Thm.compress |> close_derivation; |
469 |
||
0 | 470 |
|
8328 | 471 |
(*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
|
472 |
reversing that operation. DOES NOT WORK FOR TYPE VARIABLES. |
b1322be47244
Tidying; rotate_prems; moved freeze_thaw from tactic.ML
paulson
parents:
4588
diff
changeset
|
473 |
Similar code in type/freeze_thaw*) |
15495
50fde6f04e4c
new treatment of demodulation in proof reconstruction
paulson
parents:
15442
diff
changeset
|
474 |
|
50fde6f04e4c
new treatment of demodulation in proof reconstruction
paulson
parents:
15442
diff
changeset
|
475 |
fun freeze_thaw_robust th = |
50fde6f04e4c
new treatment of demodulation in proof reconstruction
paulson
parents:
15442
diff
changeset
|
476 |
let val fth = freezeT th |
50fde6f04e4c
new treatment of demodulation in proof reconstruction
paulson
parents:
15442
diff
changeset
|
477 |
val {prop, tpairs, sign, ...} = rep_thm fth |
50fde6f04e4c
new treatment of demodulation in proof reconstruction
paulson
parents:
15442
diff
changeset
|
478 |
in |
15574
b1d1b5bfc464
Removed practically all references to Library.foldr.
skalberg
parents:
15570
diff
changeset
|
479 |
case 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
|
480 |
[] => (fth, fn i => fn x => x) (*No vars: nothing to do!*) |
50fde6f04e4c
new treatment of demodulation in proof reconstruction
paulson
parents:
15442
diff
changeset
|
481 |
| vars => |
50fde6f04e4c
new treatment of demodulation in proof reconstruction
paulson
parents:
15442
diff
changeset
|
482 |
let fun newName (Var(ix,_), pairs) = |
50fde6f04e4c
new treatment of demodulation in proof reconstruction
paulson
parents:
15442
diff
changeset
|
483 |
let val v = gensym (string_of_indexname ix) |
50fde6f04e4c
new treatment of demodulation in proof reconstruction
paulson
parents:
15442
diff
changeset
|
484 |
in ((ix,v)::pairs) end; |
15574
b1d1b5bfc464
Removed practically all references to Library.foldr.
skalberg
parents:
15570
diff
changeset
|
485 |
val alist = foldr newName [] vars |
15495
50fde6f04e4c
new treatment of demodulation in proof reconstruction
paulson
parents:
15442
diff
changeset
|
486 |
fun mk_inst (Var(v,T)) = |
50fde6f04e4c
new treatment of demodulation in proof reconstruction
paulson
parents:
15442
diff
changeset
|
487 |
(cterm_of sign (Var(v,T)), |
15570 | 488 |
cterm_of sign (Free(valOf (assoc(alist,v)), T))) |
15495
50fde6f04e4c
new treatment of demodulation in proof reconstruction
paulson
parents:
15442
diff
changeset
|
489 |
val insts = map mk_inst vars |
50fde6f04e4c
new treatment of demodulation in proof reconstruction
paulson
parents:
15442
diff
changeset
|
490 |
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
|
491 |
th' |> forall_intr_list (map #2 insts) |
50fde6f04e4c
new treatment of demodulation in proof reconstruction
paulson
parents:
15442
diff
changeset
|
492 |
|> forall_elim_list (map (Thm.cterm_incr_indexes i o #1) insts) |
50fde6f04e4c
new treatment of demodulation in proof reconstruction
paulson
parents:
15442
diff
changeset
|
493 |
in (Thm.instantiate ([],insts) fth, thaw) end |
50fde6f04e4c
new treatment of demodulation in proof reconstruction
paulson
parents:
15442
diff
changeset
|
494 |
end; |
50fde6f04e4c
new treatment of demodulation in proof reconstruction
paulson
parents:
15442
diff
changeset
|
495 |
|
50fde6f04e4c
new treatment of demodulation in proof reconstruction
paulson
parents:
15442
diff
changeset
|
496 |
(*Basic version of the function above. No option to rename Vars apart in thaw. |
50fde6f04e4c
new treatment of demodulation in proof reconstruction
paulson
parents:
15442
diff
changeset
|
497 |
The Frees created from Vars have nice names.*) |
4610
b1322be47244
Tidying; rotate_prems; moved freeze_thaw from tactic.ML
paulson
parents:
4588
diff
changeset
|
498 |
fun freeze_thaw th = |
7248
322151fe6f02
new primitive rule permute_prems to underlie defer_tac and rotate_prems
paulson
parents:
6995
diff
changeset
|
499 |
let val fth = freezeT th |
13659
3cf622f6b0b2
Removed obsolete functions dealing with flex-flex constraints.
berghofe
parents:
13650
diff
changeset
|
500 |
val {prop, tpairs, sign, ...} = rep_thm fth |
7248
322151fe6f02
new primitive rule permute_prems to underlie defer_tac and rotate_prems
paulson
parents:
6995
diff
changeset
|
501 |
in |
15574
b1d1b5bfc464
Removed practically all references to Library.foldr.
skalberg
parents:
15570
diff
changeset
|
502 |
case 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
|
503 |
[] => (fth, fn x => x) |
322151fe6f02
new primitive rule permute_prems to underlie defer_tac and rotate_prems
paulson
parents:
6995
diff
changeset
|
504 |
| vars => |
8328 | 505 |
let fun newName (Var(ix,_), (pairs,used)) = |
506 |
let val v = variant used (string_of_indexname ix) |
|
507 |
in ((ix,v)::pairs, v::used) end; |
|
15574
b1d1b5bfc464
Removed practically all references to Library.foldr.
skalberg
parents:
15570
diff
changeset
|
508 |
val (alist, _) = foldr newName ([], Library.foldr add_term_names |
b1d1b5bfc464
Removed practically all references to Library.foldr.
skalberg
parents:
15570
diff
changeset
|
509 |
(prop :: Thm.terms_of_tpairs tpairs, [])) vars |
8328 | 510 |
fun mk_inst (Var(v,T)) = |
511 |
(cterm_of sign (Var(v,T)), |
|
15570 | 512 |
cterm_of sign (Free(valOf (assoc(alist,v)), T))) |
8328 | 513 |
val insts = map mk_inst vars |
514 |
fun thaw th' = |
|
515 |
th' |> forall_intr_list (map #2 insts) |
|
516 |
|> forall_elim_list (map #1 insts) |
|
517 |
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
|
518 |
end; |
4610
b1322be47244
Tidying; rotate_prems; moved freeze_thaw from tactic.ML
paulson
parents:
4588
diff
changeset
|
519 |
|
7248
322151fe6f02
new primitive rule permute_prems to underlie defer_tac and rotate_prems
paulson
parents:
6995
diff
changeset
|
520 |
(*Rotates a rule's premises to the left by k*) |
322151fe6f02
new primitive rule permute_prems to underlie defer_tac and rotate_prems
paulson
parents:
6995
diff
changeset
|
521 |
val rotate_prems = permute_prems 0; |
4610
b1322be47244
Tidying; rotate_prems; moved freeze_thaw from tactic.ML
paulson
parents:
4588
diff
changeset
|
522 |
|
11163 | 523 |
(* permute prems, where the i-th position in the argument list (counting from 0) |
524 |
gives the position within the original thm to be transferred to position i. |
|
525 |
Any remaining trailing positions are left unchanged. *) |
|
526 |
val rearrange_prems = let |
|
527 |
fun rearr new [] thm = thm |
|
11815 | 528 |
| rearr new (p::ps) thm = rearr (new+1) |
11163 | 529 |
(map (fn q => if new<=q andalso q<p then q+1 else q) ps) |
530 |
(permute_prems (new+1) (new-p) (permute_prems new (p-new) thm)) |
|
531 |
in rearr 0 end; |
|
4610
b1322be47244
Tidying; rotate_prems; moved freeze_thaw from tactic.ML
paulson
parents:
4588
diff
changeset
|
532 |
|
252
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
533 |
(*Assume a new formula, read following the same conventions as axioms. |
0 | 534 |
Generalizes over Free variables, |
535 |
creates the assumption, and then strips quantifiers. |
|
536 |
Example is [| ALL x:?A. ?P(x) |] ==> [| ?P(?a) |] |
|
252
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
537 |
[ !(A,P,a)[| ALL x:A. P(x) |] ==> [| P(a) |] ] *) |
0 | 538 |
fun assume_ax thy sP = |
6390 | 539 |
let val sign = Theory.sign_of thy |
4610
b1322be47244
Tidying; rotate_prems; moved freeze_thaw from tactic.ML
paulson
parents:
4588
diff
changeset
|
540 |
val prop = Logic.close_form (term_of (read_cterm sign (sP, propT))) |
229
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
214
diff
changeset
|
541 |
in forall_elim_vars 0 (assume (cterm_of sign prop)) end; |
0 | 542 |
|
252
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
543 |
(*Resolution: exactly one resolvent must be produced.*) |
0 | 544 |
fun tha RSN (i,thb) = |
4270 | 545 |
case Seq.chop (2, biresolution false [(false,tha)] i thb) of |
0 | 546 |
([th],_) => th |
547 |
| ([],_) => raise THM("RSN: no unifiers", i, [tha,thb]) |
|
548 |
| _ => raise THM("RSN: multiple unifiers", i, [tha,thb]); |
|
549 |
||
550 |
(*resolution: P==>Q, Q==>R gives P==>R. *) |
|
551 |
fun tha RS thb = tha RSN (1,thb); |
|
552 |
||
553 |
(*For joining lists of rules*) |
|
252
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
554 |
fun thas RLN (i,thbs) = |
0 | 555 |
let val resolve = biresolution false (map (pair false) thas) i |
4270 | 556 |
fun resb thb = Seq.list_of (resolve thb) handle THM _ => [] |
2672
85d7e800d754
Replaced "flat" by the Basis Library function List.concat
paulson
parents:
2266
diff
changeset
|
557 |
in List.concat (map resb thbs) end; |
0 | 558 |
|
559 |
fun thas RL thbs = thas RLN (1,thbs); |
|
560 |
||
11
d0e17c42dbb4
Added MRS, MRL from ZF/ROOT.ML. These support forward proof, resolving a
lcp
parents:
0
diff
changeset
|
561 |
(*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
|
562 |
makes proof trees*) |
252
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
563 |
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
|
564 |
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
|
565 |
| 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
|
566 |
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
|
567 |
|
d0e17c42dbb4
Added MRS, MRL from ZF/ROOT.ML. These support forward proof, resolving a
lcp
parents:
0
diff
changeset
|
568 |
(*As above, but for rule lists*) |
252
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
569 |
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
|
570 |
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
|
571 |
| 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
|
572 |
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
|
573 |
|
9288
06a55195741b
infix 'OF' is a version of 'MRS' with more appropriate argument order;
wenzelm
parents:
8605
diff
changeset
|
574 |
(*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
|
575 |
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
|
576 |
|
252
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
577 |
(*compose Q and [...,Qi,Q(i+1),...]==>R to [...,Q(i+1),...]==>R |
0 | 578 |
with no lifting or renaming! Q may contain ==> or meta-quants |
579 |
ALWAYS deletes premise i *) |
|
252
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
580 |
fun compose(tha,i,thb) = |
4270 | 581 |
Seq.list_of (bicompose false (false,tha,0) i thb); |
0 | 582 |
|
6946 | 583 |
fun compose_single (tha,i,thb) = |
584 |
(case compose (tha,i,thb) of |
|
585 |
[th] => th |
|
586 |
| _ => raise THM ("compose: unique result expected", i, [tha,thb])); |
|
587 |
||
0 | 588 |
(*compose Q and [Q1,Q2,...,Qk]==>R to [Q2,...,Qk]==>R getting unique result*) |
589 |
fun tha COMP thb = |
|
590 |
case compose(tha,1,thb) of |
|
252
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
591 |
[th] => th |
0 | 592 |
| _ => raise THM("COMP", 1, [tha,thb]); |
593 |
||
13105
3d1e7a199bdc
use eq_thm_prop instead of slightly inadequate eq_thm;
wenzelm
parents:
12908
diff
changeset
|
594 |
|
4016 | 595 |
(** theorem equality **) |
0 | 596 |
|
13650
31bd2a8cdbe2
fixing the cut_tac method to work when there are no instantiations and the
paulson
parents:
13606
diff
changeset
|
597 |
(*True if the two theorems have the same signature.*) |
13105
3d1e7a199bdc
use eq_thm_prop instead of slightly inadequate eq_thm;
wenzelm
parents:
12908
diff
changeset
|
598 |
val eq_thm_sg = Sign.eq_sg o pairself Thm.sign_of_thm; |
13650
31bd2a8cdbe2
fixing the cut_tac method to work when there are no instantiations and the
paulson
parents:
13606
diff
changeset
|
599 |
|
31bd2a8cdbe2
fixing the cut_tac method to work when there are no instantiations and the
paulson
parents:
13606
diff
changeset
|
600 |
(*True if the two theorems have the same prop field, ignoring hyps, der, etc.*) |
13105
3d1e7a199bdc
use eq_thm_prop instead of slightly inadequate eq_thm;
wenzelm
parents:
12908
diff
changeset
|
601 |
val eq_thm_prop = op aconv o pairself Thm.prop_of; |
0 | 602 |
|
603 |
(*Useful "distance" function for BEST_FIRST*) |
|
12800 | 604 |
val size_of_thm = size_of_term o prop_of; |
0 | 605 |
|
9829 | 606 |
(*maintain lists of theorems --- preserving canonical order*) |
13105
3d1e7a199bdc
use eq_thm_prop instead of slightly inadequate eq_thm;
wenzelm
parents:
12908
diff
changeset
|
607 |
fun del_rules rs rules = Library.gen_rems eq_thm_prop (rules, rs); |
9862 | 608 |
fun add_rules rs rules = rs @ del_rules rs rules; |
12373 | 609 |
val del_rule = del_rules o single; |
610 |
val add_rule = add_rules o single; |
|
13105
3d1e7a199bdc
use eq_thm_prop instead of slightly inadequate eq_thm;
wenzelm
parents:
12908
diff
changeset
|
611 |
fun merge_rules (rules1, rules2) = gen_merge_lists' eq_thm_prop rules1 rules2; |
9829 | 612 |
|
1194
563ecd14c1d8
Added weak_eq_thm and forall_intr_vars (thanks to Mark Staples)
lcp
parents:
952
diff
changeset
|
613 |
(** Mark Staples's weaker version of eq_thm: ignores variable renaming and |
563ecd14c1d8
Added weak_eq_thm and forall_intr_vars (thanks to Mark Staples)
lcp
parents:
952
diff
changeset
|
614 |
(some) type variable renaming **) |
563ecd14c1d8
Added weak_eq_thm and forall_intr_vars (thanks to Mark Staples)
lcp
parents:
952
diff
changeset
|
615 |
|
563ecd14c1d8
Added weak_eq_thm and forall_intr_vars (thanks to Mark Staples)
lcp
parents:
952
diff
changeset
|
616 |
(* Can't use term_vars, because it sorts the resulting list of variable names. |
563ecd14c1d8
Added weak_eq_thm and forall_intr_vars (thanks to Mark Staples)
lcp
parents:
952
diff
changeset
|
617 |
We instead need the unique list noramlised by the order of appearance |
563ecd14c1d8
Added weak_eq_thm and forall_intr_vars (thanks to Mark Staples)
lcp
parents:
952
diff
changeset
|
618 |
in the term. *) |
563ecd14c1d8
Added weak_eq_thm and forall_intr_vars (thanks to Mark Staples)
lcp
parents:
952
diff
changeset
|
619 |
fun term_vars' (t as Var(v,T)) = [t] |
563ecd14c1d8
Added weak_eq_thm and forall_intr_vars (thanks to Mark Staples)
lcp
parents:
952
diff
changeset
|
620 |
| term_vars' (Abs(_,_,b)) = term_vars' b |
563ecd14c1d8
Added weak_eq_thm and forall_intr_vars (thanks to Mark Staples)
lcp
parents:
952
diff
changeset
|
621 |
| term_vars' (f$a) = (term_vars' f) @ (term_vars' a) |
563ecd14c1d8
Added weak_eq_thm and forall_intr_vars (thanks to Mark Staples)
lcp
parents:
952
diff
changeset
|
622 |
| term_vars' _ = []; |
563ecd14c1d8
Added weak_eq_thm and forall_intr_vars (thanks to Mark Staples)
lcp
parents:
952
diff
changeset
|
623 |
|
563ecd14c1d8
Added weak_eq_thm and forall_intr_vars (thanks to Mark Staples)
lcp
parents:
952
diff
changeset
|
624 |
fun forall_intr_vars th = |
563ecd14c1d8
Added weak_eq_thm and forall_intr_vars (thanks to Mark Staples)
lcp
parents:
952
diff
changeset
|
625 |
let val {prop,sign,...} = rep_thm th; |
563ecd14c1d8
Added weak_eq_thm and forall_intr_vars (thanks to Mark Staples)
lcp
parents:
952
diff
changeset
|
626 |
val vars = distinct (term_vars' prop); |
563ecd14c1d8
Added weak_eq_thm and forall_intr_vars (thanks to Mark Staples)
lcp
parents:
952
diff
changeset
|
627 |
in forall_intr_list (map (cterm_of sign) vars) th end; |
563ecd14c1d8
Added weak_eq_thm and forall_intr_vars (thanks to Mark Staples)
lcp
parents:
952
diff
changeset
|
628 |
|
13105
3d1e7a199bdc
use eq_thm_prop instead of slightly inadequate eq_thm;
wenzelm
parents:
12908
diff
changeset
|
629 |
val weak_eq_thm = Thm.eq_thm o pairself (forall_intr_vars o freezeT); |
1194
563ecd14c1d8
Added weak_eq_thm and forall_intr_vars (thanks to Mark Staples)
lcp
parents:
952
diff
changeset
|
630 |
|
563ecd14c1d8
Added weak_eq_thm and forall_intr_vars (thanks to Mark Staples)
lcp
parents:
952
diff
changeset
|
631 |
|
0 | 632 |
(*** Meta-Rewriting Rules ***) |
633 |
||
4610
b1322be47244
Tidying; rotate_prems; moved freeze_thaw from tactic.ML
paulson
parents:
4588
diff
changeset
|
634 |
fun read_prop s = read_cterm proto_sign (s, propT); |
b1322be47244
Tidying; rotate_prems; moved freeze_thaw from tactic.ML
paulson
parents:
4588
diff
changeset
|
635 |
|
9455 | 636 |
fun store_thm name thm = hd (PureThy.smart_store_thms (name, [thm])); |
637 |
fun store_standard_thm name thm = store_thm name (standard thm); |
|
12135 | 638 |
fun store_thm_open name thm = hd (PureThy.smart_store_thms_open (name, [thm])); |
639 |
fun store_standard_thm_open name thm = store_thm_open name (standard' thm); |
|
4016 | 640 |
|
0 | 641 |
val reflexive_thm = |
14854 | 642 |
let val cx = cterm_of proto_sign (Var(("x",0),TVar(("'a",0),[]))) |
12135 | 643 |
in store_standard_thm_open "reflexive" (Thm.reflexive cx) end; |
0 | 644 |
|
645 |
val symmetric_thm = |
|
14854 | 646 |
let val xy = read_prop "x == y" |
12135 | 647 |
in store_standard_thm_open "symmetric" (Thm.implies_intr_hyps (Thm.symmetric (Thm.assume xy))) end; |
0 | 648 |
|
649 |
val transitive_thm = |
|
14854 | 650 |
let val xy = read_prop "x == y" |
651 |
val yz = read_prop "y == z" |
|
0 | 652 |
val xythm = Thm.assume xy and yzthm = Thm.assume yz |
12135 | 653 |
in store_standard_thm_open "transitive" (Thm.implies_intr yz (Thm.transitive xythm yzthm)) end; |
0 | 654 |
|
4679 | 655 |
fun symmetric_fun thm = thm RS symmetric_thm; |
656 |
||
11512
da3a96ab5630
Some basic rules are now stored with "open" derivations, to facilitate
berghofe
parents:
11163
diff
changeset
|
657 |
fun extensional eq = |
da3a96ab5630
Some basic rules are now stored with "open" derivations, to facilitate
berghofe
parents:
11163
diff
changeset
|
658 |
let val eq' = |
da3a96ab5630
Some basic rules are now stored with "open" derivations, to facilitate
berghofe
parents:
11163
diff
changeset
|
659 |
abstract_rule "x" (snd (Thm.dest_comb (fst (dest_equals (cprop_of eq))))) eq |
da3a96ab5630
Some basic rules are now stored with "open" derivations, to facilitate
berghofe
parents:
11163
diff
changeset
|
660 |
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
|
661 |
|
10414 | 662 |
val imp_cong = |
663 |
let |
|
664 |
val ABC = read_prop "PROP A ==> PROP B == PROP C" |
|
665 |
val AB = read_prop "PROP A ==> PROP B" |
|
666 |
val AC = read_prop "PROP A ==> PROP C" |
|
667 |
val A = read_prop "PROP A" |
|
668 |
in |
|
12135 | 669 |
store_standard_thm_open "imp_cong" (implies_intr ABC (equal_intr |
10414 | 670 |
(implies_intr AB (implies_intr A |
671 |
(equal_elim (implies_elim (assume ABC) (assume A)) |
|
672 |
(implies_elim (assume AB) (assume A))))) |
|
673 |
(implies_intr AC (implies_intr A |
|
674 |
(equal_elim (symmetric (implies_elim (assume ABC) (assume A))) |
|
675 |
(implies_elim (assume AC) (assume A))))))) |
|
676 |
end; |
|
677 |
||
678 |
val swap_prems_eq = |
|
679 |
let |
|
680 |
val ABC = read_prop "PROP A ==> PROP B ==> PROP C" |
|
681 |
val BAC = read_prop "PROP B ==> PROP A ==> PROP C" |
|
682 |
val A = read_prop "PROP A" |
|
683 |
val B = read_prop "PROP B" |
|
684 |
in |
|
12135 | 685 |
store_standard_thm_open "swap_prems_eq" (equal_intr |
10414 | 686 |
(implies_intr ABC (implies_intr B (implies_intr A |
687 |
(implies_elim (implies_elim (assume ABC) (assume A)) (assume B))))) |
|
688 |
(implies_intr BAC (implies_intr A (implies_intr B |
|
689 |
(implies_elim (implies_elim (assume BAC) (assume B)) (assume A)))))) |
|
690 |
end; |
|
229
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
214
diff
changeset
|
691 |
|
15001
fb2141a9f8c0
Moved conversion rules from MetaSimplifier to Drule. refl_implies removed
skalberg
parents:
14854
diff
changeset
|
692 |
val imp_cong' = combination o combination (reflexive implies) |
0 | 693 |
|
13325 | 694 |
fun abs_def thm = |
695 |
let |
|
696 |
val (_, cvs) = strip_comb (fst (dest_equals (cprop_of thm))); |
|
15574
b1d1b5bfc464
Removed practically all references to Library.foldr.
skalberg
parents:
15570
diff
changeset
|
697 |
val thm' = foldr (fn (ct, thm) => Thm.abstract_rule |
13325 | 698 |
(case term_of ct of Var ((a, _), _) => a | Free (a, _) => a | _ => "x") |
15574
b1d1b5bfc464
Removed practically all references to Library.foldr.
skalberg
parents:
15570
diff
changeset
|
699 |
ct thm) thm cvs |
13325 | 700 |
in transitive |
701 |
(symmetric (eta_conversion (fst (dest_equals (cprop_of thm'))))) thm' |
|
702 |
end; |
|
703 |
||
0 | 704 |
|
15001
fb2141a9f8c0
Moved conversion rules from MetaSimplifier to Drule. refl_implies removed
skalberg
parents:
14854
diff
changeset
|
705 |
local |
fb2141a9f8c0
Moved conversion rules from MetaSimplifier to Drule. refl_implies removed
skalberg
parents:
14854
diff
changeset
|
706 |
val dest_eq = dest_equals o cprop_of |
fb2141a9f8c0
Moved conversion rules from MetaSimplifier to Drule. refl_implies removed
skalberg
parents:
14854
diff
changeset
|
707 |
val rhs_of = snd o dest_eq |
fb2141a9f8c0
Moved conversion rules from MetaSimplifier to Drule. refl_implies removed
skalberg
parents:
14854
diff
changeset
|
708 |
in |
fb2141a9f8c0
Moved conversion rules from MetaSimplifier to Drule. refl_implies removed
skalberg
parents:
14854
diff
changeset
|
709 |
fun beta_eta_conversion t = |
fb2141a9f8c0
Moved conversion rules from MetaSimplifier to Drule. refl_implies removed
skalberg
parents:
14854
diff
changeset
|
710 |
let val thm = beta_conversion true t |
fb2141a9f8c0
Moved conversion rules from MetaSimplifier to Drule. refl_implies removed
skalberg
parents:
14854
diff
changeset
|
711 |
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
|
712 |
end; |
fb2141a9f8c0
Moved conversion rules from MetaSimplifier to Drule. refl_implies removed
skalberg
parents:
14854
diff
changeset
|
713 |
|
15925 | 714 |
fun eta_long_conversion ct = transitive (beta_eta_conversion ct) |
715 |
(symmetric (beta_eta_conversion (cterm_fun (Pattern.eta_long []) ct))); |
|
716 |
||
15001
fb2141a9f8c0
Moved conversion rules from MetaSimplifier to Drule. refl_implies removed
skalberg
parents:
14854
diff
changeset
|
717 |
(*In [A1,...,An]==>B, rewrite the selected A's only -- for rewrite_goals_tac*) |
fb2141a9f8c0
Moved conversion rules from MetaSimplifier to Drule. refl_implies removed
skalberg
parents:
14854
diff
changeset
|
718 |
fun goals_conv pred cv = |
fb2141a9f8c0
Moved conversion rules from MetaSimplifier to Drule. refl_implies removed
skalberg
parents:
14854
diff
changeset
|
719 |
let fun gconv i ct = |
fb2141a9f8c0
Moved conversion rules from MetaSimplifier to Drule. refl_implies removed
skalberg
parents:
14854
diff
changeset
|
720 |
let val (A,B) = dest_implies ct |
fb2141a9f8c0
Moved conversion rules from MetaSimplifier to Drule. refl_implies removed
skalberg
parents:
14854
diff
changeset
|
721 |
in imp_cong' (if pred i then cv A else reflexive A) (gconv (i+1) B) end |
fb2141a9f8c0
Moved conversion rules from MetaSimplifier to Drule. refl_implies removed
skalberg
parents:
14854
diff
changeset
|
722 |
handle TERM _ => reflexive ct |
fb2141a9f8c0
Moved conversion rules from MetaSimplifier to Drule. refl_implies removed
skalberg
parents:
14854
diff
changeset
|
723 |
in gconv 1 end |
fb2141a9f8c0
Moved conversion rules from MetaSimplifier to Drule. refl_implies removed
skalberg
parents:
14854
diff
changeset
|
724 |
|
fb2141a9f8c0
Moved conversion rules from MetaSimplifier to Drule. refl_implies removed
skalberg
parents:
14854
diff
changeset
|
725 |
(* Rewrite A in !!x1,...,xn. A *) |
fb2141a9f8c0
Moved conversion rules from MetaSimplifier to Drule. refl_implies removed
skalberg
parents:
14854
diff
changeset
|
726 |
fun forall_conv cv ct = |
fb2141a9f8c0
Moved conversion rules from MetaSimplifier to Drule. refl_implies removed
skalberg
parents:
14854
diff
changeset
|
727 |
let val p as (ct1, ct2) = Thm.dest_comb ct |
fb2141a9f8c0
Moved conversion rules from MetaSimplifier to Drule. refl_implies removed
skalberg
parents:
14854
diff
changeset
|
728 |
in (case pairself term_of p of |
fb2141a9f8c0
Moved conversion rules from MetaSimplifier to Drule. refl_implies removed
skalberg
parents:
14854
diff
changeset
|
729 |
(Const ("all", _), Abs (s, _, _)) => |
15531 | 730 |
let val (v, ct') = Thm.dest_abs (SOME "@") ct2; |
15001
fb2141a9f8c0
Moved conversion rules from MetaSimplifier to Drule. refl_implies removed
skalberg
parents:
14854
diff
changeset
|
731 |
in Thm.combination (Thm.reflexive ct1) |
fb2141a9f8c0
Moved conversion rules from MetaSimplifier to Drule. refl_implies removed
skalberg
parents:
14854
diff
changeset
|
732 |
(Thm.abstract_rule s v (forall_conv cv ct')) |
fb2141a9f8c0
Moved conversion rules from MetaSimplifier to Drule. refl_implies removed
skalberg
parents:
14854
diff
changeset
|
733 |
end |
fb2141a9f8c0
Moved conversion rules from MetaSimplifier to Drule. refl_implies removed
skalberg
parents:
14854
diff
changeset
|
734 |
| _ => cv ct) |
fb2141a9f8c0
Moved conversion rules from MetaSimplifier to Drule. refl_implies removed
skalberg
parents:
14854
diff
changeset
|
735 |
end handle TERM _ => cv ct; |
fb2141a9f8c0
Moved conversion rules from MetaSimplifier to Drule. refl_implies removed
skalberg
parents:
14854
diff
changeset
|
736 |
|
fb2141a9f8c0
Moved conversion rules from MetaSimplifier to Drule. refl_implies removed
skalberg
parents:
14854
diff
changeset
|
737 |
(*Use a conversion to transform a theorem*) |
fb2141a9f8c0
Moved conversion rules from MetaSimplifier to Drule. refl_implies removed
skalberg
parents:
14854
diff
changeset
|
738 |
fun fconv_rule cv th = equal_elim (cv (cprop_of th)) th; |
fb2141a9f8c0
Moved conversion rules from MetaSimplifier to Drule. refl_implies removed
skalberg
parents:
14854
diff
changeset
|
739 |
|
15669 | 740 |
(*** Some useful meta-theorems ***) |
0 | 741 |
|
742 |
(*The rule V/V, obtains assumption solving for eresolve_tac*) |
|
12135 | 743 |
val asm_rl = store_standard_thm_open "asm_rl" (Thm.trivial (read_prop "PROP ?psi")); |
7380 | 744 |
val _ = store_thm "_" asm_rl; |
0 | 745 |
|
746 |
(*Meta-level cut rule: [| V==>W; V |] ==> W *) |
|
4016 | 747 |
val cut_rl = |
12135 | 748 |
store_standard_thm_open "cut_rl" |
9455 | 749 |
(Thm.trivial (read_prop "PROP ?psi ==> PROP ?theta")); |
0 | 750 |
|
252
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
751 |
(*Generalized elim rule for one conclusion; cut_rl with reversed premises: |
0 | 752 |
[| PROP V; PROP V ==> PROP W |] ==> PROP W *) |
753 |
val revcut_rl = |
|
4610
b1322be47244
Tidying; rotate_prems; moved freeze_thaw from tactic.ML
paulson
parents:
4588
diff
changeset
|
754 |
let val V = read_prop "PROP V" |
b1322be47244
Tidying; rotate_prems; moved freeze_thaw from tactic.ML
paulson
parents:
4588
diff
changeset
|
755 |
and VW = read_prop "PROP V ==> PROP W"; |
4016 | 756 |
in |
12135 | 757 |
store_standard_thm_open "revcut_rl" |
4016 | 758 |
(implies_intr V (implies_intr VW (implies_elim (assume VW) (assume V)))) |
0 | 759 |
end; |
760 |
||
668 | 761 |
(*for deleting an unwanted assumption*) |
762 |
val thin_rl = |
|
4610
b1322be47244
Tidying; rotate_prems; moved freeze_thaw from tactic.ML
paulson
parents:
4588
diff
changeset
|
763 |
let val V = read_prop "PROP V" |
b1322be47244
Tidying; rotate_prems; moved freeze_thaw from tactic.ML
paulson
parents:
4588
diff
changeset
|
764 |
and W = read_prop "PROP W"; |
12135 | 765 |
in store_standard_thm_open "thin_rl" (implies_intr V (implies_intr W (assume W))) end; |
668 | 766 |
|
0 | 767 |
(* (!!x. PROP ?V) == PROP ?V Allows removal of redundant parameters*) |
768 |
val triv_forall_equality = |
|
4610
b1322be47244
Tidying; rotate_prems; moved freeze_thaw from tactic.ML
paulson
parents:
4588
diff
changeset
|
769 |
let val V = read_prop "PROP V" |
b1322be47244
Tidying; rotate_prems; moved freeze_thaw from tactic.ML
paulson
parents:
4588
diff
changeset
|
770 |
and QV = read_prop "!!x::'a. PROP V" |
8086 | 771 |
and x = read_cterm proto_sign ("x", TypeInfer.logicT); |
4016 | 772 |
in |
12135 | 773 |
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
|
774 |
(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
|
775 |
(implies_intr V (forall_intr x (assume V)))) |
0 | 776 |
end; |
777 |
||
1756 | 778 |
(* (PROP ?PhiA ==> PROP ?PhiB ==> PROP ?Psi) ==> |
779 |
(PROP ?PhiB ==> PROP ?PhiA ==> PROP ?Psi) |
|
780 |
`thm COMP swap_prems_rl' swaps the first two premises of `thm' |
|
781 |
*) |
|
782 |
val swap_prems_rl = |
|
4610
b1322be47244
Tidying; rotate_prems; moved freeze_thaw from tactic.ML
paulson
parents:
4588
diff
changeset
|
783 |
let val cmajor = read_prop "PROP PhiA ==> PROP PhiB ==> PROP Psi"; |
1756 | 784 |
val major = assume cmajor; |
4610
b1322be47244
Tidying; rotate_prems; moved freeze_thaw from tactic.ML
paulson
parents:
4588
diff
changeset
|
785 |
val cminor1 = read_prop "PROP PhiA"; |
1756 | 786 |
val minor1 = assume cminor1; |
4610
b1322be47244
Tidying; rotate_prems; moved freeze_thaw from tactic.ML
paulson
parents:
4588
diff
changeset
|
787 |
val cminor2 = read_prop "PROP PhiB"; |
1756 | 788 |
val minor2 = assume cminor2; |
12135 | 789 |
in store_standard_thm_open "swap_prems_rl" |
1756 | 790 |
(implies_intr cmajor (implies_intr cminor2 (implies_intr cminor1 |
791 |
(implies_elim (implies_elim major minor1) minor2)))) |
|
792 |
end; |
|
793 |
||
3653 | 794 |
(* [| PROP ?phi ==> PROP ?psi; PROP ?psi ==> PROP ?phi |] |
795 |
==> PROP ?phi == PROP ?psi |
|
8328 | 796 |
Introduction rule for == as a meta-theorem. |
3653 | 797 |
*) |
798 |
val equal_intr_rule = |
|
4610
b1322be47244
Tidying; rotate_prems; moved freeze_thaw from tactic.ML
paulson
parents:
4588
diff
changeset
|
799 |
let val PQ = read_prop "PROP phi ==> PROP psi" |
b1322be47244
Tidying; rotate_prems; moved freeze_thaw from tactic.ML
paulson
parents:
4588
diff
changeset
|
800 |
and QP = read_prop "PROP psi ==> PROP phi" |
4016 | 801 |
in |
12135 | 802 |
store_standard_thm_open "equal_intr_rule" |
4016 | 803 |
(implies_intr PQ (implies_intr QP (equal_intr (assume PQ) (assume QP)))) |
3653 | 804 |
end; |
805 |
||
13368 | 806 |
(* [| PROP ?phi == PROP ?psi; PROP ?phi |] ==> PROP ?psi *) |
807 |
val equal_elim_rule1 = |
|
808 |
let val eq = read_prop "PROP phi == PROP psi" |
|
809 |
and P = read_prop "PROP phi" |
|
810 |
in store_standard_thm_open "equal_elim_rule1" |
|
811 |
(Thm.equal_elim (assume eq) (assume P) |> implies_intr_list [eq, P]) |
|
812 |
end; |
|
4285 | 813 |
|
12297 | 814 |
(* "[| PROP ?phi; PROP ?phi; PROP ?psi |] ==> PROP ?psi" *) |
815 |
||
816 |
val remdups_rl = |
|
817 |
let val P = read_prop "PROP phi" and Q = read_prop "PROP psi"; |
|
818 |
in store_standard_thm_open "remdups_rl" (implies_intr_list [P, P, Q] (Thm.assume Q)) end; |
|
819 |
||
820 |
||
9554 | 821 |
(*(PROP ?phi ==> (!!x. PROP ?psi(x))) == (!!x. PROP ?phi ==> PROP ?psi(x)) |
12297 | 822 |
Rewrite rule for HHF normalization.*) |
9554 | 823 |
|
824 |
val norm_hhf_eq = |
|
825 |
let |
|
826 |
val cert = Thm.cterm_of proto_sign; |
|
14854 | 827 |
val aT = TFree ("'a", []); |
9554 | 828 |
val all = Term.all aT; |
829 |
val x = Free ("x", aT); |
|
830 |
val phi = Free ("phi", propT); |
|
831 |
val psi = Free ("psi", aT --> propT); |
|
832 |
||
833 |
val cx = cert x; |
|
834 |
val cphi = cert phi; |
|
835 |
val lhs = cert (Logic.mk_implies (phi, all $ Abs ("x", aT, psi $ Bound 0))); |
|
836 |
val rhs = cert (all $ Abs ("x", aT, Logic.mk_implies (phi, psi $ Bound 0))); |
|
837 |
in |
|
838 |
Thm.equal_intr |
|
839 |
(Thm.implies_elim (Thm.assume lhs) (Thm.assume cphi) |
|
840 |
|> Thm.forall_elim cx |
|
841 |
|> Thm.implies_intr cphi |
|
842 |
|> Thm.forall_intr cx |
|
843 |
|> Thm.implies_intr lhs) |
|
844 |
(Thm.implies_elim |
|
845 |
(Thm.assume rhs |> Thm.forall_elim cx) (Thm.assume cphi) |
|
846 |
|> Thm.forall_intr cx |
|
847 |
|> Thm.implies_intr cphi |
|
848 |
|> Thm.implies_intr rhs) |
|
12135 | 849 |
|> store_standard_thm_open "norm_hhf_eq" |
9554 | 850 |
end; |
851 |
||
12800 | 852 |
fun is_norm_hhf tm = |
853 |
let |
|
854 |
fun is_norm (Const ("==>", _) $ _ $ (Const ("all", _) $ _)) = false |
|
855 |
| is_norm (t $ u) = is_norm t andalso is_norm u |
|
856 |
| is_norm (Abs (_, _, t)) = is_norm t |
|
857 |
| is_norm _ = true; |
|
858 |
in is_norm (Pattern.beta_eta_contract tm) end; |
|
859 |
||
860 |
fun norm_hhf sg t = |
|
861 |
if is_norm_hhf t then t |
|
13198 | 862 |
else Pattern.rewrite_term (Sign.tsig_of sg) [Logic.dest_equals (prop_of norm_hhf_eq)] [] t; |
12800 | 863 |
|
9554 | 864 |
|
8129
29e239c7b8c2
Thm.instantiate no longer normalizes, but Drule.instantiate does
paulson
parents:
8086
diff
changeset
|
865 |
(*** Instantiate theorem th, reading instantiations under signature sg ****) |
29e239c7b8c2
Thm.instantiate no longer normalizes, but Drule.instantiate does
paulson
parents:
8086
diff
changeset
|
866 |
|
29e239c7b8c2
Thm.instantiate no longer normalizes, but Drule.instantiate does
paulson
parents:
8086
diff
changeset
|
867 |
(*Version that normalizes the result: Thm.instantiate no longer does that*) |
29e239c7b8c2
Thm.instantiate no longer normalizes, but Drule.instantiate does
paulson
parents:
8086
diff
changeset
|
868 |
fun instantiate instpair th = Thm.instantiate instpair th COMP asm_rl; |
29e239c7b8c2
Thm.instantiate no longer normalizes, but Drule.instantiate does
paulson
parents:
8086
diff
changeset
|
869 |
|
15797 | 870 |
fun read_instantiate_sg' sg sinsts th = |
8129
29e239c7b8c2
Thm.instantiate no longer normalizes, but Drule.instantiate does
paulson
parents:
8086
diff
changeset
|
871 |
let val ts = types_sorts th; |
15669 | 872 |
val used = add_used th []; |
15797 | 873 |
in instantiate (read_insts sg ts ts used sinsts) th end; |
874 |
||
875 |
fun read_instantiate_sg sg sinsts th = |
|
876 |
read_instantiate_sg' sg (map (apfst Syntax.indexname) sinsts) th; |
|
8129
29e239c7b8c2
Thm.instantiate no longer normalizes, but Drule.instantiate does
paulson
parents:
8086
diff
changeset
|
877 |
|
29e239c7b8c2
Thm.instantiate no longer normalizes, but Drule.instantiate does
paulson
parents:
8086
diff
changeset
|
878 |
(*Instantiate theorem th, reading instantiations under theory of th*) |
29e239c7b8c2
Thm.instantiate no longer normalizes, but Drule.instantiate does
paulson
parents:
8086
diff
changeset
|
879 |
fun read_instantiate sinsts th = |
14643 | 880 |
read_instantiate_sg (Thm.sign_of_thm th) sinsts th; |
8129
29e239c7b8c2
Thm.instantiate no longer normalizes, but Drule.instantiate does
paulson
parents:
8086
diff
changeset
|
881 |
|
15797 | 882 |
fun read_instantiate' sinsts th = |
883 |
read_instantiate_sg' (Thm.sign_of_thm th) sinsts th; |
|
884 |
||
8129
29e239c7b8c2
Thm.instantiate no longer normalizes, but Drule.instantiate does
paulson
parents:
8086
diff
changeset
|
885 |
|
29e239c7b8c2
Thm.instantiate no longer normalizes, but Drule.instantiate does
paulson
parents:
8086
diff
changeset
|
886 |
(*Left-to-right replacements: tpairs = [...,(vi,ti),...]. |
29e239c7b8c2
Thm.instantiate no longer normalizes, but Drule.instantiate does
paulson
parents:
8086
diff
changeset
|
887 |
Instantiates distinct Vars by terms, inferring type instantiations. *) |
29e239c7b8c2
Thm.instantiate no longer normalizes, but Drule.instantiate does
paulson
parents:
8086
diff
changeset
|
888 |
local |
29e239c7b8c2
Thm.instantiate no longer normalizes, but Drule.instantiate does
paulson
parents:
8086
diff
changeset
|
889 |
fun add_types ((ct,cu), (sign,tye,maxidx)) = |
29e239c7b8c2
Thm.instantiate no longer normalizes, but Drule.instantiate does
paulson
parents:
8086
diff
changeset
|
890 |
let val {sign=signt, t=t, T= T, maxidx=maxt,...} = rep_cterm ct |
29e239c7b8c2
Thm.instantiate no longer normalizes, but Drule.instantiate does
paulson
parents:
8086
diff
changeset
|
891 |
and {sign=signu, t=u, T= U, maxidx=maxu,...} = rep_cterm cu; |
29e239c7b8c2
Thm.instantiate no longer normalizes, but Drule.instantiate does
paulson
parents:
8086
diff
changeset
|
892 |
val maxi = Int.max(maxidx, Int.max(maxt, maxu)); |
29e239c7b8c2
Thm.instantiate no longer normalizes, but Drule.instantiate does
paulson
parents:
8086
diff
changeset
|
893 |
val sign' = Sign.merge(sign, Sign.merge(signt, signu)) |
14643 | 894 |
val (tye',maxi') = Type.unify (Sign.tsig_of sign') (tye, maxi) (T, U) |
10403 | 895 |
handle Type.TUNIFY => raise TYPE("Ill-typed instantiation", [T,U], [t,u]) |
8129
29e239c7b8c2
Thm.instantiate no longer normalizes, but Drule.instantiate does
paulson
parents:
8086
diff
changeset
|
896 |
in (sign', tye', maxi') end; |
29e239c7b8c2
Thm.instantiate no longer normalizes, but Drule.instantiate does
paulson
parents:
8086
diff
changeset
|
897 |
in |
29e239c7b8c2
Thm.instantiate no longer normalizes, but Drule.instantiate does
paulson
parents:
8086
diff
changeset
|
898 |
fun cterm_instantiate ctpairs0 th = |
15574
b1d1b5bfc464
Removed practically all references to Library.foldr.
skalberg
parents:
15570
diff
changeset
|
899 |
let val (sign,tye,_) = foldr add_types (Thm.sign_of_thm th, Vartab.empty, 0) ctpairs0 |
14340
bc93ffa674cc
correction to cterm_instantiate by Christoph Leuth
paulson
parents:
14081
diff
changeset
|
900 |
fun instT(ct,cu) = |
15797 | 901 |
let val inst = cterm_of sign o Envir.subst_TVars tye o term_of |
14340
bc93ffa674cc
correction to cterm_instantiate by Christoph Leuth
paulson
parents:
14081
diff
changeset
|
902 |
in (inst ct, inst cu) end |
15797 | 903 |
fun ctyp2 (ixn, (S, T)) = (ctyp_of sign (TVar (ixn, S)), ctyp_of sign T) |
8406
a217b0cd304d
Type.unify and Type.typ_match now use Vartab instead of association lists.
berghofe
parents:
8365
diff
changeset
|
904 |
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
|
905 |
handle TERM _ => |
29e239c7b8c2
Thm.instantiate no longer normalizes, but Drule.instantiate does
paulson
parents:
8086
diff
changeset
|
906 |
raise THM("cterm_instantiate: incompatible signatures",0,[th]) |
29e239c7b8c2
Thm.instantiate no longer normalizes, but Drule.instantiate does
paulson
parents:
8086
diff
changeset
|
907 |
| TYPE (msg, _, _) => raise THM(msg, 0, [th]) |
29e239c7b8c2
Thm.instantiate no longer normalizes, but Drule.instantiate does
paulson
parents:
8086
diff
changeset
|
908 |
end; |
29e239c7b8c2
Thm.instantiate no longer normalizes, but Drule.instantiate does
paulson
parents:
8086
diff
changeset
|
909 |
|
29e239c7b8c2
Thm.instantiate no longer normalizes, but Drule.instantiate does
paulson
parents:
8086
diff
changeset
|
910 |
|
29e239c7b8c2
Thm.instantiate no longer normalizes, but Drule.instantiate does
paulson
parents:
8086
diff
changeset
|
911 |
(** Derived rules mainly for METAHYPS **) |
29e239c7b8c2
Thm.instantiate no longer normalizes, but Drule.instantiate does
paulson
parents:
8086
diff
changeset
|
912 |
|
29e239c7b8c2
Thm.instantiate no longer normalizes, but Drule.instantiate does
paulson
parents:
8086
diff
changeset
|
913 |
(*Given the term "a", takes (%x.t)==(%x.u) to t[a/x]==u[a/x]*) |
29e239c7b8c2
Thm.instantiate no longer normalizes, but Drule.instantiate does
paulson
parents:
8086
diff
changeset
|
914 |
fun equal_abs_elim ca eqth = |
29e239c7b8c2
Thm.instantiate no longer normalizes, but Drule.instantiate does
paulson
parents:
8086
diff
changeset
|
915 |
let val {sign=signa, t=a, ...} = rep_cterm ca |
29e239c7b8c2
Thm.instantiate no longer normalizes, but Drule.instantiate does
paulson
parents:
8086
diff
changeset
|
916 |
and combth = combination eqth (reflexive ca) |
29e239c7b8c2
Thm.instantiate no longer normalizes, but Drule.instantiate does
paulson
parents:
8086
diff
changeset
|
917 |
val {sign,prop,...} = rep_thm eqth |
29e239c7b8c2
Thm.instantiate no longer normalizes, but Drule.instantiate does
paulson
parents:
8086
diff
changeset
|
918 |
val (abst,absu) = Logic.dest_equals prop |
29e239c7b8c2
Thm.instantiate no longer normalizes, but Drule.instantiate does
paulson
parents:
8086
diff
changeset
|
919 |
val cterm = cterm_of (Sign.merge (sign,signa)) |
10414 | 920 |
in transitive (symmetric (beta_conversion false (cterm (abst$a)))) |
921 |
(transitive combth (beta_conversion false (cterm (absu$a)))) |
|
8129
29e239c7b8c2
Thm.instantiate no longer normalizes, but Drule.instantiate does
paulson
parents:
8086
diff
changeset
|
922 |
end |
29e239c7b8c2
Thm.instantiate no longer normalizes, but Drule.instantiate does
paulson
parents:
8086
diff
changeset
|
923 |
handle THM _ => raise THM("equal_abs_elim", 0, [eqth]); |
29e239c7b8c2
Thm.instantiate no longer normalizes, but Drule.instantiate does
paulson
parents:
8086
diff
changeset
|
924 |
|
29e239c7b8c2
Thm.instantiate no longer normalizes, but Drule.instantiate does
paulson
parents:
8086
diff
changeset
|
925 |
(*Calling equal_abs_elim with multiple terms*) |
15574
b1d1b5bfc464
Removed practically all references to Library.foldr.
skalberg
parents:
15570
diff
changeset
|
926 |
fun equal_abs_elim_list cts th = foldr (uncurry equal_abs_elim) th (rev cts); |
8129
29e239c7b8c2
Thm.instantiate no longer normalizes, but Drule.instantiate does
paulson
parents:
8086
diff
changeset
|
927 |
|
29e239c7b8c2
Thm.instantiate no longer normalizes, but Drule.instantiate does
paulson
parents:
8086
diff
changeset
|
928 |
|
10667 | 929 |
(*** Goal (PROP A) <==> PROP A ***) |
4789 | 930 |
|
931 |
local |
|
10667 | 932 |
val cert = Thm.cterm_of proto_sign; |
933 |
val A = Free ("A", propT); |
|
934 |
val G = Logic.mk_goal A; |
|
4789 | 935 |
val (G_def, _) = freeze_thaw ProtoPure.Goal_def; |
936 |
in |
|
11741 | 937 |
val triv_goal = store_thm "triv_goal" (kind_rule internalK (standard |
10667 | 938 |
(Thm.equal_elim (Thm.symmetric G_def) (Thm.assume (cert A))))); |
11741 | 939 |
val rev_triv_goal = store_thm "rev_triv_goal" (kind_rule internalK (standard |
10667 | 940 |
(Thm.equal_elim G_def (Thm.assume (cert G))))); |
4789 | 941 |
end; |
942 |
||
9460 | 943 |
val mk_cgoal = Thm.capply (Thm.cterm_of proto_sign Logic.goal_const); |
6995 | 944 |
fun assume_goal ct = Thm.assume (mk_cgoal ct) RS rev_triv_goal; |
945 |
||
11815 | 946 |
fun implies_intr_goals cprops thm = |
947 |
implies_elim_list (implies_intr_list cprops thm) (map assume_goal cprops) |
|
948 |
|> implies_intr_list (map mk_cgoal cprops); |
|
949 |
||
4789 | 950 |
|
4285 | 951 |
|
5688 | 952 |
(** variations on instantiate **) |
4285 | 953 |
|
8550
b44c185f8018
new meta-rule "inst", a shorthand for read_instantiate_sg
paulson
parents:
8496
diff
changeset
|
954 |
(*shorthand for instantiating just one variable in the current theory*) |
b44c185f8018
new meta-rule "inst", a shorthand for read_instantiate_sg
paulson
parents:
8496
diff
changeset
|
955 |
fun inst x t = read_instantiate_sg (sign_of (the_context())) [(x,t)]; |
b44c185f8018
new meta-rule "inst", a shorthand for read_instantiate_sg
paulson
parents:
8496
diff
changeset
|
956 |
|
b44c185f8018
new meta-rule "inst", a shorthand for read_instantiate_sg
paulson
parents:
8496
diff
changeset
|
957 |
|
12495 | 958 |
(* collect vars in left-to-right order *) |
4285 | 959 |
|
15570 | 960 |
fun tvars_of_terms ts = rev (Library.foldl Term.add_tvars ([], ts)); |
961 |
fun vars_of_terms ts = rev (Library.foldl Term.add_vars ([], ts)); |
|
5903 | 962 |
|
12800 | 963 |
fun tvars_of thm = tvars_of_terms [prop_of thm]; |
964 |
fun vars_of thm = vars_of_terms [prop_of thm]; |
|
4285 | 965 |
|
966 |
||
967 |
(* instantiate by left-to-right occurrence of variables *) |
|
968 |
||
969 |
fun instantiate' cTs cts thm = |
|
970 |
let |
|
971 |
fun err msg = |
|
972 |
raise TYPE ("instantiate': " ^ msg, |
|
15570 | 973 |
List.mapPartial (Option.map Thm.typ_of) cTs, |
974 |
List.mapPartial (Option.map Thm.term_of) cts); |
|
4285 | 975 |
|
976 |
fun inst_of (v, ct) = |
|
977 |
(Thm.cterm_of (#sign (Thm.rep_cterm ct)) (Var v), ct) |
|
978 |
handle TYPE (msg, _, _) => err msg; |
|
979 |
||
15797 | 980 |
fun tyinst_of (v, cT) = |
981 |
(Thm.ctyp_of (#sign (Thm.rep_ctyp cT)) (TVar v), cT) |
|
982 |
handle TYPE (msg, _, _) => err msg; |
|
983 |
||
4285 | 984 |
fun zip_vars _ [] = [] |
15531 | 985 |
| zip_vars (_ :: vs) (NONE :: opt_ts) = zip_vars vs opt_ts |
986 |
| zip_vars (v :: vs) (SOME t :: opt_ts) = (v, t) :: zip_vars vs opt_ts |
|
4285 | 987 |
| zip_vars [] _ = err "more instantiations than variables in thm"; |
988 |
||
989 |
(*instantiate types first!*) |
|
990 |
val thm' = |
|
991 |
if forall is_none cTs then thm |
|
15797 | 992 |
else Thm.instantiate (map tyinst_of (zip_vars (tvars_of thm) cTs), []) thm; |
4285 | 993 |
in |
994 |
if forall is_none cts then thm' |
|
995 |
else Thm.instantiate ([], map inst_of (zip_vars (vars_of thm') cts)) thm' |
|
996 |
end; |
|
997 |
||
998 |
||
14081 | 999 |
|
1000 |
(** renaming of bound variables **) |
|
1001 |
||
1002 |
(* replace bound variables x_i in thm by y_i *) |
|
1003 |
(* where vs = [(x_1, y_1), ..., (x_n, y_n)] *) |
|
1004 |
||
1005 |
fun rename_bvars [] thm = thm |
|
1006 |
| rename_bvars vs thm = |
|
1007 |
let |
|
1008 |
val {sign, prop, ...} = rep_thm thm; |
|
15570 | 1009 |
fun ren (Abs (x, T, t)) = Abs (getOpt (assoc (vs, x), x), T, ren t) |
14081 | 1010 |
| ren (t $ u) = ren t $ ren u |
1011 |
| ren t = t; |
|
1012 |
in equal_elim (reflexive (cterm_of sign (ren prop))) thm end; |
|
1013 |
||
1014 |
||
1015 |
(* renaming in left-to-right order *) |
|
1016 |
||
1017 |
fun rename_bvars' xs thm = |
|
1018 |
let |
|
1019 |
val {sign, prop, ...} = rep_thm thm; |
|
1020 |
fun rename [] t = ([], t) |
|
1021 |
| rename (x' :: xs) (Abs (x, T, t)) = |
|
1022 |
let val (xs', t') = rename xs t |
|
15570 | 1023 |
in (xs', Abs (getOpt (x',x), T, t')) end |
14081 | 1024 |
| rename xs (t $ u) = |
1025 |
let |
|
1026 |
val (xs', t') = rename xs t; |
|
1027 |
val (xs'', u') = rename xs' u |
|
1028 |
in (xs'', t' $ u') end |
|
1029 |
| rename xs t = (xs, t); |
|
1030 |
in case rename xs prop of |
|
1031 |
([], prop') => equal_elim (reflexive (cterm_of sign prop')) thm |
|
1032 |
| _ => error "More names than abstractions in theorem" |
|
1033 |
end; |
|
1034 |
||
1035 |
||
1036 |
||
5688 | 1037 |
(* unvarify(T) *) |
1038 |
||
1039 |
(*assume thm in standard form, i.e. no frees, 0 var indexes*) |
|
1040 |
||
1041 |
fun unvarifyT thm = |
|
1042 |
let |
|
1043 |
val cT = Thm.ctyp_of (Thm.sign_of_thm thm); |
|
15531 | 1044 |
val tfrees = map (fn ((x, _), S) => SOME (cT (TFree (x, S)))) (tvars_of thm); |
5688 | 1045 |
in instantiate' tfrees [] thm end; |
1046 |
||
1047 |
fun unvarify raw_thm = |
|
1048 |
let |
|
1049 |
val thm = unvarifyT raw_thm; |
|
1050 |
val ct = Thm.cterm_of (Thm.sign_of_thm thm); |
|
15531 | 1051 |
val frees = map (fn ((x, _), T) => SOME (ct (Free (x, T)))) (vars_of thm); |
5688 | 1052 |
in instantiate' [] frees thm end; |
1053 |
||
1054 |
||
8605 | 1055 |
(* tvars_intr_list *) |
1056 |
||
1057 |
fun tfrees_of thm = |
|
1058 |
let val {hyps, prop, ...} = Thm.rep_thm thm |
|
15797 | 1059 |
in foldr Term.add_term_tfrees [] (prop :: hyps) end; |
8605 | 1060 |
|
1061 |
fun tvars_intr_list tfrees thm = |
|
15797 | 1062 |
apsnd (map (fn ((s, S), ixn) => (s, (ixn, S)))) (Thm.varifyT' |
1063 |
(gen_rems (op = o apfst fst) (tfrees_of thm, tfrees)) thm); |
|
8605 | 1064 |
|
1065 |
||
6435 | 1066 |
(* increment var indexes *) |
1067 |
||
1068 |
fun incr_indexes_wrt is cTs cts thms = |
|
1069 |
let |
|
1070 |
val maxidx = |
|
15570 | 1071 |
Library.foldl Int.max (~1, is @ |
6435 | 1072 |
map (maxidx_of_typ o #T o Thm.rep_ctyp) cTs @ |
1073 |
map (#maxidx o Thm.rep_cterm) cts @ |
|
1074 |
map (#maxidx o Thm.rep_thm) thms); |
|
10414 | 1075 |
in Thm.incr_indexes (maxidx + 1) end; |
6435 | 1076 |
|
1077 |
||
8328 | 1078 |
(* freeze_all *) |
1079 |
||
1080 |
(*freeze all (T)Vars; assumes thm in standard form*) |
|
1081 |
||
1082 |
fun freeze_all_TVars thm = |
|
1083 |
(case tvars_of thm of |
|
1084 |
[] => thm |
|
1085 |
| tvars => |
|
1086 |
let val cert = Thm.ctyp_of (Thm.sign_of_thm thm) |
|
15531 | 1087 |
in instantiate' (map (fn ((x, _), S) => SOME (cert (TFree (x, S)))) tvars) [] thm end); |
8328 | 1088 |
|
1089 |
fun freeze_all_Vars thm = |
|
1090 |
(case vars_of thm of |
|
1091 |
[] => thm |
|
1092 |
| vars => |
|
1093 |
let val cert = Thm.cterm_of (Thm.sign_of_thm thm) |
|
15531 | 1094 |
in instantiate' [] (map (fn ((x, _), T) => SOME (cert (Free (x, T)))) vars) thm end); |
8328 | 1095 |
|
1096 |
val freeze_all = freeze_all_Vars o freeze_all_TVars; |
|
1097 |
||
1098 |
||
5688 | 1099 |
(* mk_triv_goal *) |
1100 |
||
1101 |
(*make an initial proof state, "PROP A ==> (PROP A)" *) |
|
15531 | 1102 |
fun mk_triv_goal ct = instantiate' [] [SOME ct] triv_goal; |
5311
f3f71669878e
Rule mk_triv_goal for making instances of triv_goal
paulson
parents:
5079
diff
changeset
|
1103 |
|
11975 | 1104 |
|
1105 |
||
1106 |
(** meta-level conjunction **) |
|
1107 |
||
1108 |
local |
|
1109 |
val A = read_prop "PROP A"; |
|
1110 |
val B = read_prop "PROP B"; |
|
1111 |
val C = read_prop "PROP C"; |
|
1112 |
val ABC = read_prop "PROP A ==> PROP B ==> PROP C"; |
|
1113 |
||
1114 |
val proj1 = |
|
1115 |
forall_intr_list [A, B] (implies_intr_list [A, B] (Thm.assume A)) |
|
1116 |
|> forall_elim_vars 0; |
|
1117 |
||
1118 |
val proj2 = |
|
1119 |
forall_intr_list [A, B] (implies_intr_list [A, B] (Thm.assume B)) |
|
1120 |
|> forall_elim_vars 0; |
|
1121 |
||
1122 |
val conj_intr_rule = |
|
1123 |
forall_intr_list [A, B] (implies_intr_list [A, B] |
|
1124 |
(Thm.forall_intr C (Thm.implies_intr ABC |
|
1125 |
(implies_elim_list (Thm.assume ABC) [Thm.assume A, Thm.assume B])))) |
|
1126 |
|> forall_elim_vars 0; |
|
1127 |
||
1128 |
val incr = incr_indexes_wrt [] [] []; |
|
1129 |
in |
|
1130 |
||
1131 |
fun conj_intr tha thb = thb COMP (tha COMP incr [tha, thb] conj_intr_rule); |
|
12756
08bf3d911968
conj_intr_list and conj_elim_precise: cover 0 conjuncts;
wenzelm
parents:
12725
diff
changeset
|
1132 |
|
08bf3d911968
conj_intr_list and conj_elim_precise: cover 0 conjuncts;
wenzelm
parents:
12725
diff
changeset
|
1133 |
fun conj_intr_list [] = asm_rl |
08bf3d911968
conj_intr_list and conj_elim_precise: cover 0 conjuncts;
wenzelm
parents:
12725
diff
changeset
|
1134 |
| conj_intr_list ths = foldr1 (uncurry conj_intr) ths; |
11975 | 1135 |
|
1136 |
fun conj_elim th = |
|
1137 |
let val th' = forall_elim_var (#maxidx (Thm.rep_thm th) + 1) th |
|
1138 |
in (incr [th'] proj1 COMP th', incr [th'] proj2 COMP th') end; |
|
1139 |
||
1140 |
fun conj_elim_list th = |
|
1141 |
let val (th1, th2) = conj_elim th |
|
1142 |
in conj_elim_list th1 @ conj_elim_list th2 end handle THM _ => [th]; |
|
1143 |
||
12756
08bf3d911968
conj_intr_list and conj_elim_precise: cover 0 conjuncts;
wenzelm
parents:
12725
diff
changeset
|
1144 |
fun conj_elim_precise 0 _ = [] |
08bf3d911968
conj_intr_list and conj_elim_precise: cover 0 conjuncts;
wenzelm
parents:
12725
diff
changeset
|
1145 |
| conj_elim_precise 1 th = [th] |
12135 | 1146 |
| conj_elim_precise n th = |
1147 |
let val (th1, th2) = conj_elim th |
|
1148 |
in th1 :: conj_elim_precise (n - 1) th2 end; |
|
1149 |
||
1150 |
val conj_intr_thm = store_standard_thm_open "conjunctionI" |
|
1151 |
(implies_intr_list [A, B] (conj_intr (Thm.assume A) (Thm.assume B))); |
|
1152 |
||
0 | 1153 |
end; |
252
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
1154 |
|
11975 | 1155 |
end; |
5903 | 1156 |
|
1157 |
structure BasicDrule: BASIC_DRULE = Drule; |
|
1158 |
open BasicDrule; |