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