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