author | wenzelm |
Fri, 25 Jul 1997 11:47:09 +0200 | |
changeset 3575 | 4e9beacb5339 |
parent 3555 | 5a720f6b9f38 |
child 3653 | 6d5b3d5ff132 |
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 |
||
6 |
Derived rules and other operations on theorems and theories |
|
7 |
*) |
|
8 |
||
11
d0e17c42dbb4
Added MRS, MRL from ZF/ROOT.ML. These support forward proof, resolving a
lcp
parents:
0
diff
changeset
|
9 |
infix 0 RS RSN RL RLN MRS MRL COMP; |
0 | 10 |
|
11 |
signature DRULE = |
|
12 |
sig |
|
1460 | 13 |
val add_defs : (string * string) list -> theory -> theory |
14 |
val add_defs_i : (string * term) list -> theory -> theory |
|
15 |
val asm_rl : thm |
|
16 |
val assume_ax : theory -> string -> thm |
|
17 |
val COMP : thm * thm -> thm |
|
18 |
val compose : thm * int * thm -> thm list |
|
19 |
val cprems_of : thm -> cterm list |
|
20 |
val cterm_instantiate : (cterm*cterm)list -> thm -> thm |
|
21 |
val cut_rl : thm |
|
22 |
val equal_abs_elim : cterm -> thm -> thm |
|
229
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
214
diff
changeset
|
23 |
val equal_abs_elim_list: cterm list -> thm -> thm |
1460 | 24 |
val eq_thm : thm * thm -> bool |
25 |
val same_thm : thm * thm -> bool |
|
26 |
val eq_thm_sg : thm * thm -> bool |
|
229
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
214
diff
changeset
|
27 |
val flexpair_abs_elim_list: cterm list -> thm -> thm |
1460 | 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 implies_elim_list : thm -> thm list -> thm |
|
35 |
val implies_intr_list : cterm list -> thm -> thm |
|
2004
3411fe560611
New operations on cterms. Now same names as in Logic
paulson
parents:
1906
diff
changeset
|
36 |
val dest_implies : cterm -> cterm * cterm |
1460 | 37 |
val MRL : thm list list * thm list -> thm list |
38 |
val MRS : thm list * thm -> thm |
|
39 |
val read_instantiate : (string*string)list -> thm -> thm |
|
0 | 40 |
val read_instantiate_sg: Sign.sg -> (string*string)list -> thm -> thm |
1460 | 41 |
val read_insts : |
229
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
214
diff
changeset
|
42 |
Sign.sg -> (indexname -> typ option) * (indexname -> sort option) |
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
214
diff
changeset
|
43 |
-> (indexname -> typ option) * (indexname -> sort option) |
949
83c588d6fee9
Changed treatment of during type inference internally generated type
nipkow
parents:
922
diff
changeset
|
44 |
-> string list -> (string*string)list |
229
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
214
diff
changeset
|
45 |
-> (indexname*ctyp)list * (cterm*cterm)list |
1460 | 46 |
val reflexive_thm : thm |
2004
3411fe560611
New operations on cterms. Now same names as in Logic
paulson
parents:
1906
diff
changeset
|
47 |
val refl_implies : thm |
1460 | 48 |
val revcut_rl : thm |
3555 | 49 |
val rewrite_goal_rule : bool * bool -> (meta_simpset -> thm -> thm option) |
214
ed6a3e2b1a33
added new parameter to the simplification tactics which indicates if
nipkow
parents:
211
diff
changeset
|
50 |
-> meta_simpset -> int -> thm -> thm |
3575
4e9beacb5339
improved rewrite_thm / rewrite_goals to handle conditional eqns;
wenzelm
parents:
3555
diff
changeset
|
51 |
val rewrite_goals_rule_aux: (meta_simpset -> thm -> thm option) -> thm list -> thm -> thm |
4e9beacb5339
improved rewrite_thm / rewrite_goals to handle conditional eqns;
wenzelm
parents:
3555
diff
changeset
|
52 |
val rewrite_rule_aux : (meta_simpset -> thm -> thm option) -> thm list -> thm -> thm |
3555 | 53 |
val rewrite_thm : bool * bool -> (meta_simpset -> thm -> thm option) |
54 |
-> meta_simpset -> thm -> thm |
|
1460 | 55 |
val RS : thm * thm -> thm |
56 |
val RSN : thm * (int * thm) -> thm |
|
57 |
val RL : thm list * thm list -> thm list |
|
58 |
val RLN : thm list * (int * thm list) -> thm list |
|
59 |
val size_of_thm : thm -> int |
|
2004
3411fe560611
New operations on cterms. Now same names as in Logic
paulson
parents:
1906
diff
changeset
|
60 |
val skip_flexpairs : cterm -> cterm |
1460 | 61 |
val standard : thm -> thm |
2004
3411fe560611
New operations on cterms. Now same names as in Logic
paulson
parents:
1906
diff
changeset
|
62 |
val strip_imp_prems : cterm -> cterm list |
1756 | 63 |
val swap_prems_rl : thm |
1460 | 64 |
val symmetric_thm : thm |
65 |
val thin_rl : thm |
|
66 |
val transitive_thm : thm |
|
0 | 67 |
val triv_forall_equality: thm |
68 |
val types_sorts: thm -> (indexname-> typ option) * (indexname-> sort option) |
|
1460 | 69 |
val zero_var_indexes : thm -> thm |
0 | 70 |
end; |
71 |
||
668 | 72 |
|
1499 | 73 |
structure Drule : DRULE = |
0 | 74 |
struct |
75 |
||
561 | 76 |
(**** Extend Theories ****) |
77 |
||
78 |
(** add constant definitions **) |
|
79 |
||
80 |
(* all_axioms_of *) |
|
81 |
||
82 |
(*results may contain duplicates!*) |
|
83 |
||
84 |
fun ancestry_of thy = |
|
2672
85d7e800d754
Replaced "flat" by the Basis Library function List.concat
paulson
parents:
2266
diff
changeset
|
85 |
thy :: List.concat (map ancestry_of (parents_of thy)); |
561 | 86 |
|
1237 | 87 |
val all_axioms_of = |
2672
85d7e800d754
Replaced "flat" by the Basis Library function List.concat
paulson
parents:
2266
diff
changeset
|
88 |
List.concat o map (Symtab.dest o #new_axioms o rep_theory) o ancestry_of; |
561 | 89 |
|
90 |
||
91 |
(* clash_types, clash_consts *) |
|
92 |
||
93 |
(*check if types have common instance (ignoring sorts)*) |
|
94 |
||
95 |
fun clash_types ty1 ty2 = |
|
96 |
let |
|
97 |
val ty1' = Type.varifyT ty1; |
|
98 |
val ty2' = incr_tvar (maxidx_of_typ ty1' + 1) (Type.varifyT ty2); |
|
99 |
in |
|
100 |
Type.raw_unify (ty1', ty2') |
|
101 |
end; |
|
102 |
||
103 |
fun clash_consts (c1, ty1) (c2, ty2) = |
|
104 |
c1 = c2 andalso clash_types ty1 ty2; |
|
105 |
||
106 |
||
107 |
(* clash_defns *) |
|
108 |
||
109 |
fun clash_defn c_ty (name, tm) = |
|
110 |
let val (c, ty') = dest_Const (head_of (fst (Logic.dest_equals tm))) in |
|
111 |
if clash_consts c_ty (c, ty') then Some (name, ty') else None |
|
112 |
end handle TERM _ => None; |
|
113 |
||
114 |
fun clash_defns c_ty axms = |
|
115 |
distinct (mapfilter (clash_defn c_ty) axms); |
|
116 |
||
117 |
||
118 |
(* dest_defn *) |
|
119 |
||
120 |
fun dest_defn tm = |
|
121 |
let |
|
122 |
fun err msg = raise_term msg [tm]; |
|
123 |
||
3530 | 124 |
val (lhs, rhs) = Logic.dest_equals (Logic.strip_imp_concl tm) |
561 | 125 |
handle TERM _ => err "Not a meta-equality (==)"; |
126 |
val (head, args) = strip_comb lhs; |
|
127 |
val (c, ty) = dest_Const head |
|
128 |
handle TERM _ => err "Head of lhs not a constant"; |
|
129 |
||
655 | 130 |
fun occs_const (Const c_ty') = (c_ty' = (c, ty)) |
561 | 131 |
| occs_const (Abs (_, _, t)) = occs_const t |
132 |
| occs_const (t $ u) = occs_const t orelse occs_const u |
|
133 |
| occs_const _ = false; |
|
641 | 134 |
|
135 |
val show_frees = commas_quote o map (fst o dest_Free); |
|
136 |
val show_tfrees = commas_quote o map fst; |
|
137 |
||
138 |
val lhs_dups = duplicates args; |
|
139 |
val rhs_extras = gen_rems (op =) (term_frees rhs, args); |
|
140 |
val rhs_extrasT = gen_rems (op =) (term_tfrees rhs, typ_tfrees ty); |
|
561 | 141 |
in |
142 |
if not (forall is_Free args) then |
|
1906 | 143 |
err "Arguments (on lhs) must be variables" |
641 | 144 |
else if not (null lhs_dups) then |
145 |
err ("Duplicate variables on lhs: " ^ show_frees lhs_dups) |
|
146 |
else if not (null rhs_extras) then |
|
147 |
err ("Extra variables on rhs: " ^ show_frees rhs_extras) |
|
148 |
else if not (null rhs_extrasT) then |
|
149 |
err ("Extra type variables on rhs: " ^ show_tfrees rhs_extrasT) |
|
561 | 150 |
else if occs_const rhs then |
655 | 151 |
err ("Constant to be defined occurs on rhs") |
561 | 152 |
else (c, ty) |
153 |
end; |
|
154 |
||
155 |
||
156 |
(* check_defn *) |
|
157 |
||
641 | 158 |
fun err_in_defn name msg = |
159 |
(writeln msg; error ("The error(s) above occurred in definition " ^ quote name)); |
|
561 | 160 |
|
161 |
fun check_defn sign (axms, (name, tm)) = |
|
162 |
let |
|
163 |
fun show_const (c, ty) = quote (Pretty.string_of (Pretty.block |
|
164 |
[Pretty.str (c ^ " ::"), Pretty.brk 1, Sign.pretty_typ sign ty])); |
|
165 |
||
166 |
fun show_defn c (dfn, ty') = show_const (c, ty') ^ " in " ^ dfn; |
|
1439 | 167 |
fun show_defns c = cat_lines o map (show_defn c); |
561 | 168 |
|
169 |
val (c, ty) = dest_defn tm |
|
641 | 170 |
handle TERM (msg, _) => err_in_defn name msg; |
561 | 171 |
val defns = clash_defns (c, ty) axms; |
172 |
in |
|
173 |
if not (null defns) then |
|
641 | 174 |
err_in_defn name ("Definition of " ^ show_const (c, ty) ^ |
1439 | 175 |
"\nclashes with " ^ show_defns c defns) |
561 | 176 |
else (name, tm) :: axms |
177 |
end; |
|
178 |
||
179 |
||
180 |
(* add_defs *) |
|
181 |
||
182 |
fun ext_defns prep_axm raw_axms thy = |
|
183 |
let |
|
184 |
val axms = map (prep_axm (sign_of thy)) raw_axms; |
|
185 |
val all_axms = all_axioms_of thy; |
|
186 |
in |
|
187 |
foldl (check_defn (sign_of thy)) (all_axms, axms); |
|
188 |
add_axioms_i axms thy |
|
189 |
end; |
|
190 |
||
191 |
val add_defs_i = ext_defns cert_axm; |
|
192 |
val add_defs = ext_defns read_axm; |
|
193 |
||
194 |
||
195 |
||
0 | 196 |
(**** More derived rules and operations on theorems ****) |
197 |
||
708
8422e50adce0
Pure/drule/cprems_of, cskip_flexpairs, cstrip_imp_prems: new cterm operations
lcp
parents:
668
diff
changeset
|
198 |
(** some cterm->cterm operations: much faster than calling cterm_of! **) |
8422e50adce0
Pure/drule/cprems_of, cskip_flexpairs, cstrip_imp_prems: new cterm operations
lcp
parents:
668
diff
changeset
|
199 |
|
2004
3411fe560611
New operations on cterms. Now same names as in Logic
paulson
parents:
1906
diff
changeset
|
200 |
(** SAME NAMES as in structure Logic: use compound identifiers! **) |
3411fe560611
New operations on cterms. Now same names as in Logic
paulson
parents:
1906
diff
changeset
|
201 |
|
1703
e22ad43bab5f
moved dest_cimplies to drule.ML; added adjust_maxidx
clasohm
parents:
1596
diff
changeset
|
202 |
(*dest_implies for cterms. Note T=prop below*) |
2004
3411fe560611
New operations on cterms. Now same names as in Logic
paulson
parents:
1906
diff
changeset
|
203 |
fun dest_implies ct = |
3411fe560611
New operations on cterms. Now same names as in Logic
paulson
parents:
1906
diff
changeset
|
204 |
case term_of ct of |
3411fe560611
New operations on cterms. Now same names as in Logic
paulson
parents:
1906
diff
changeset
|
205 |
(Const("==>", _) $ _ $ _) => |
3411fe560611
New operations on cterms. Now same names as in Logic
paulson
parents:
1906
diff
changeset
|
206 |
let val (ct1,ct2) = dest_comb ct |
3411fe560611
New operations on cterms. Now same names as in Logic
paulson
parents:
1906
diff
changeset
|
207 |
in (#2 (dest_comb ct1), ct2) end |
3411fe560611
New operations on cterms. Now same names as in Logic
paulson
parents:
1906
diff
changeset
|
208 |
| _ => raise TERM ("dest_implies", [term_of ct]) ; |
1703
e22ad43bab5f
moved dest_cimplies to drule.ML; added adjust_maxidx
clasohm
parents:
1596
diff
changeset
|
209 |
|
e22ad43bab5f
moved dest_cimplies to drule.ML; added adjust_maxidx
clasohm
parents:
1596
diff
changeset
|
210 |
|
708
8422e50adce0
Pure/drule/cprems_of, cskip_flexpairs, cstrip_imp_prems: new cterm operations
lcp
parents:
668
diff
changeset
|
211 |
(*Discard flexflex pairs; return a cterm*) |
2004
3411fe560611
New operations on cterms. Now same names as in Logic
paulson
parents:
1906
diff
changeset
|
212 |
fun skip_flexpairs ct = |
708
8422e50adce0
Pure/drule/cprems_of, cskip_flexpairs, cstrip_imp_prems: new cterm operations
lcp
parents:
668
diff
changeset
|
213 |
case term_of ct of |
1460 | 214 |
(Const("==>", _) $ (Const("=?=",_)$_$_) $ _) => |
2004
3411fe560611
New operations on cterms. Now same names as in Logic
paulson
parents:
1906
diff
changeset
|
215 |
skip_flexpairs (#2 (dest_implies ct)) |
708
8422e50adce0
Pure/drule/cprems_of, cskip_flexpairs, cstrip_imp_prems: new cterm operations
lcp
parents:
668
diff
changeset
|
216 |
| _ => ct; |
8422e50adce0
Pure/drule/cprems_of, cskip_flexpairs, cstrip_imp_prems: new cterm operations
lcp
parents:
668
diff
changeset
|
217 |
|
8422e50adce0
Pure/drule/cprems_of, cskip_flexpairs, cstrip_imp_prems: new cterm operations
lcp
parents:
668
diff
changeset
|
218 |
(* 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
|
219 |
fun strip_imp_prems ct = |
3411fe560611
New operations on cterms. Now same names as in Logic
paulson
parents:
1906
diff
changeset
|
220 |
let val (cA,cB) = dest_implies ct |
3411fe560611
New operations on cterms. Now same names as in Logic
paulson
parents:
1906
diff
changeset
|
221 |
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
|
222 |
handle TERM _ => []; |
8422e50adce0
Pure/drule/cprems_of, cskip_flexpairs, cstrip_imp_prems: new cterm operations
lcp
parents:
668
diff
changeset
|
223 |
|
2004
3411fe560611
New operations on cterms. Now same names as in Logic
paulson
parents:
1906
diff
changeset
|
224 |
(* 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
|
225 |
fun strip_imp_concl ct = |
3411fe560611
New operations on cterms. Now same names as in Logic
paulson
parents:
1906
diff
changeset
|
226 |
case term_of ct of (Const("==>", _) $ _ $ _) => |
3411fe560611
New operations on cterms. Now same names as in Logic
paulson
parents:
1906
diff
changeset
|
227 |
strip_imp_concl (#2 (dest_comb ct)) |
3411fe560611
New operations on cterms. Now same names as in Logic
paulson
parents:
1906
diff
changeset
|
228 |
| _ => ct; |
3411fe560611
New operations on cterms. Now same names as in Logic
paulson
parents:
1906
diff
changeset
|
229 |
|
708
8422e50adce0
Pure/drule/cprems_of, cskip_flexpairs, cstrip_imp_prems: new cterm operations
lcp
parents:
668
diff
changeset
|
230 |
(*The premises of a theorem, as a cterm list*) |
2004
3411fe560611
New operations on cterms. Now same names as in Logic
paulson
parents:
1906
diff
changeset
|
231 |
val cprems_of = strip_imp_prems o skip_flexpairs o cprop_of; |
708
8422e50adce0
Pure/drule/cprems_of, cskip_flexpairs, cstrip_imp_prems: new cterm operations
lcp
parents:
668
diff
changeset
|
232 |
|
8422e50adce0
Pure/drule/cprems_of, cskip_flexpairs, cstrip_imp_prems: new cterm operations
lcp
parents:
668
diff
changeset
|
233 |
|
229
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
214
diff
changeset
|
234 |
(** reading of instantiations **) |
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
214
diff
changeset
|
235 |
|
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
214
diff
changeset
|
236 |
fun indexname cs = case Syntax.scan_varname cs of (v,[]) => v |
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
214
diff
changeset
|
237 |
| _ => error("Lexical error in variable name " ^ quote (implode cs)); |
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
214
diff
changeset
|
238 |
|
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
214
diff
changeset
|
239 |
fun absent ixn = |
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
214
diff
changeset
|
240 |
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
|
241 |
|
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
214
diff
changeset
|
242 |
fun inst_failure ixn = |
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
214
diff
changeset
|
243 |
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
|
244 |
|
952
9e10962866b0
Removed an old bug which made some simultaneous instantiations fail if they
nipkow
parents:
949
diff
changeset
|
245 |
(* this code is a bit of a mess. add_cterm could be simplified greatly if |
9e10962866b0
Removed an old bug which made some simultaneous instantiations fail if they
nipkow
parents:
949
diff
changeset
|
246 |
simultaneous instantiations were read or at least type checked |
9e10962866b0
Removed an old bug which made some simultaneous instantiations fail if they
nipkow
parents:
949
diff
changeset
|
247 |
simultaneously rather than one after the other. This would make the tricky |
9e10962866b0
Removed an old bug which made some simultaneous instantiations fail if they
nipkow
parents:
949
diff
changeset
|
248 |
composition of implicit type instantiations (parameter tye) superfluous. |
9e10962866b0
Removed an old bug which made some simultaneous instantiations fail if they
nipkow
parents:
949
diff
changeset
|
249 |
*) |
949
83c588d6fee9
Changed treatment of during type inference internally generated type
nipkow
parents:
922
diff
changeset
|
250 |
fun read_insts sign (rtypes,rsorts) (types,sorts) used insts = |
229
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
214
diff
changeset
|
251 |
let val {tsig,...} = Sign.rep_sg sign |
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
214
diff
changeset
|
252 |
fun split([],tvs,vs) = (tvs,vs) |
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
214
diff
changeset
|
253 |
| split((sv,st)::l,tvs,vs) = (case explode sv of |
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
214
diff
changeset
|
254 |
"'"::cs => split(l,(indexname cs,st)::tvs,vs) |
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
214
diff
changeset
|
255 |
| cs => split(l,tvs,(indexname cs,st)::vs)); |
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
214
diff
changeset
|
256 |
val (tvs,vs) = split(insts,[],[]); |
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
214
diff
changeset
|
257 |
fun readT((a,i),st) = |
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
214
diff
changeset
|
258 |
let val ixn = ("'" ^ a,i); |
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
214
diff
changeset
|
259 |
val S = case rsorts ixn of Some S => S | None => absent ixn; |
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
214
diff
changeset
|
260 |
val T = Sign.read_typ (sign,sorts) st; |
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
214
diff
changeset
|
261 |
in if Type.typ_instance(tsig,T,TVar(ixn,S)) then (ixn,T) |
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
214
diff
changeset
|
262 |
else inst_failure ixn |
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
214
diff
changeset
|
263 |
end |
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
214
diff
changeset
|
264 |
val tye = map readT tvs; |
949
83c588d6fee9
Changed treatment of during type inference internally generated type
nipkow
parents:
922
diff
changeset
|
265 |
fun add_cterm ((cts,tye,used), (ixn,st)) = |
229
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
214
diff
changeset
|
266 |
let val T = case rtypes ixn of |
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
214
diff
changeset
|
267 |
Some T => typ_subst_TVars tye T |
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
214
diff
changeset
|
268 |
| None => absent ixn; |
949
83c588d6fee9
Changed treatment of during type inference internally generated type
nipkow
parents:
922
diff
changeset
|
269 |
val (ct,tye2) = read_def_cterm(sign,types,sorts) used false (st,T); |
952
9e10962866b0
Removed an old bug which made some simultaneous instantiations fail if they
nipkow
parents:
949
diff
changeset
|
270 |
val cts' = (ixn,T,ct)::cts |
9e10962866b0
Removed an old bug which made some simultaneous instantiations fail if they
nipkow
parents:
949
diff
changeset
|
271 |
fun inst(ixn,T,ct) = (ixn,typ_subst_TVars tye2 T,ct) |
949
83c588d6fee9
Changed treatment of during type inference internally generated type
nipkow
parents:
922
diff
changeset
|
272 |
val used' = add_term_tvarnames(term_of ct,used); |
952
9e10962866b0
Removed an old bug which made some simultaneous instantiations fail if they
nipkow
parents:
949
diff
changeset
|
273 |
in (map inst cts',tye2 @ tye,used') end |
949
83c588d6fee9
Changed treatment of during type inference internally generated type
nipkow
parents:
922
diff
changeset
|
274 |
val (cterms,tye',_) = foldl add_cterm (([],tye,used), vs); |
952
9e10962866b0
Removed an old bug which made some simultaneous instantiations fail if they
nipkow
parents:
949
diff
changeset
|
275 |
in (map (fn (ixn,T) => (ixn,ctyp_of sign T)) tye', |
9e10962866b0
Removed an old bug which made some simultaneous instantiations fail if they
nipkow
parents:
949
diff
changeset
|
276 |
map (fn (ixn,T,ct) => (cterm_of sign (Var(ixn,T)), ct)) cterms) |
9e10962866b0
Removed an old bug which made some simultaneous instantiations fail if they
nipkow
parents:
949
diff
changeset
|
277 |
end; |
229
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
214
diff
changeset
|
278 |
|
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
214
diff
changeset
|
279 |
|
252
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
280 |
(*** Find the type (sort) associated with a (T)Var or (T)Free in a term |
0 | 281 |
Used for establishing default types (of variables) and sorts (of |
282 |
type variables) when reading another term. |
|
283 |
Index -1 indicates that a (T)Free rather than a (T)Var is wanted. |
|
284 |
***) |
|
285 |
||
286 |
fun types_sorts thm = |
|
287 |
let val {prop,hyps,...} = rep_thm thm; |
|
252
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
288 |
val big = list_comb(prop,hyps); (* bogus term! *) |
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
289 |
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
|
290 |
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
|
291 |
val tvars = term_tvars big; |
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
292 |
val tfrees = term_tfrees big; |
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
293 |
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
|
294 |
fun sort(a,i) = if i<0 then assoc(tfrees,a) else assoc(tvars,(a,i)); |
0 | 295 |
in (typ,sort) end; |
296 |
||
297 |
(** Standardization of rules **) |
|
298 |
||
299 |
(*Generalization over a list of variables, IGNORING bad ones*) |
|
300 |
fun forall_intr_list [] th = th |
|
301 |
| forall_intr_list (y::ys) th = |
|
252
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
302 |
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
|
303 |
in forall_intr y gth handle THM _ => gth end; |
0 | 304 |
|
305 |
(*Generalization over all suitable Free variables*) |
|
306 |
fun forall_intr_frees th = |
|
307 |
let val {prop,sign,...} = rep_thm th |
|
308 |
in forall_intr_list |
|
252
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
309 |
(map (cterm_of sign) (sort atless (term_frees prop))) |
0 | 310 |
th |
311 |
end; |
|
312 |
||
313 |
(*Replace outermost quantified variable by Var of given index. |
|
314 |
Could clash with Vars already present.*) |
|
252
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
315 |
fun forall_elim_var i th = |
0 | 316 |
let val {prop,sign,...} = rep_thm th |
317 |
in case prop of |
|
252
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
318 |
Const("all",_) $ Abs(a,T,_) => |
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
319 |
forall_elim (cterm_of sign (Var((a,i), T))) th |
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
320 |
| _ => raise THM("forall_elim_var", i, [th]) |
0 | 321 |
end; |
322 |
||
323 |
(*Repeat forall_elim_var until all outer quantifiers are removed*) |
|
252
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
324 |
fun forall_elim_vars i th = |
0 | 325 |
forall_elim_vars i (forall_elim_var i th) |
252
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
326 |
handle THM _ => th; |
0 | 327 |
|
328 |
(*Specialization over a list of cterms*) |
|
329 |
fun forall_elim_list cts th = foldr (uncurry forall_elim) (rev cts, th); |
|
330 |
||
331 |
(* maps [A1,...,An], B to [| A1;...;An |] ==> B *) |
|
332 |
fun implies_intr_list cAs th = foldr (uncurry implies_intr) (cAs,th); |
|
333 |
||
334 |
(* maps [| A1;...;An |] ==> B and [A1,...,An] to B *) |
|
335 |
fun implies_elim_list impth ths = foldl (uncurry implies_elim) (impth,ths); |
|
336 |
||
337 |
(*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
|
338 |
fun zero_var_indexes th = |
0 | 339 |
let val {prop,sign,...} = rep_thm th; |
340 |
val vars = term_vars prop |
|
341 |
val bs = foldl add_new_id ([], map (fn Var((a,_),_)=>a) vars) |
|
252
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
342 |
val inrs = add_term_tvars(prop,[]); |
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
343 |
val nms' = rev(foldl add_new_id ([], map (#1 o #1) inrs)); |
2266 | 344 |
val tye = ListPair.map (fn ((v,rs),a) => (v, TVar((a,0),rs))) |
345 |
(inrs, nms') |
|
252
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
346 |
val ctye = map (fn (v,T) => (v,ctyp_of sign T)) tye; |
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
347 |
fun varpairs([],[]) = [] |
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
348 |
| varpairs((var as Var(v,T)) :: vars, b::bs) = |
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
349 |
let val T' = typ_subst_TVars tye T |
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
350 |
in (cterm_of sign (Var(v,T')), |
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
351 |
cterm_of sign (Var((b,0),T'))) :: varpairs(vars,bs) |
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
352 |
end |
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
353 |
| varpairs _ = raise TERM("varpairs", []); |
0 | 354 |
in instantiate (ctye, varpairs(vars,rev bs)) th end; |
355 |
||
356 |
||
357 |
(*Standard form of object-rule: no hypotheses, Frees, or outer quantifiers; |
|
358 |
all generality expressed by Vars having index 0.*) |
|
359 |
fun standard th = |
|
1218
59ed8ef1a3a1
modified pretty_thm, standard, eq_thm to handle shyps;
wenzelm
parents:
1194
diff
changeset
|
360 |
let val {maxidx,...} = rep_thm th |
1237 | 361 |
in |
1218
59ed8ef1a3a1
modified pretty_thm, standard, eq_thm to handle shyps;
wenzelm
parents:
1194
diff
changeset
|
362 |
th |> implies_intr_hyps |
1412 | 363 |
|> forall_intr_frees |> forall_elim_vars (maxidx + 1) |
1439 | 364 |
|> Thm.strip_shyps |> Thm.implies_intr_shyps |
1412 | 365 |
|> zero_var_indexes |> Thm.varifyT |> Thm.compress |
1218
59ed8ef1a3a1
modified pretty_thm, standard, eq_thm to handle shyps;
wenzelm
parents:
1194
diff
changeset
|
366 |
end; |
59ed8ef1a3a1
modified pretty_thm, standard, eq_thm to handle shyps;
wenzelm
parents:
1194
diff
changeset
|
367 |
|
0 | 368 |
|
252
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
369 |
(*Assume a new formula, read following the same conventions as axioms. |
0 | 370 |
Generalizes over Free variables, |
371 |
creates the assumption, and then strips quantifiers. |
|
372 |
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
|
373 |
[ !(A,P,a)[| ALL x:A. P(x) |] ==> [| P(a) |] ] *) |
0 | 374 |
fun assume_ax thy sP = |
375 |
let val sign = sign_of thy |
|
252
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
376 |
val prop = Logic.close_form (term_of (read_cterm sign |
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
377 |
(sP, propT))) |
229
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
214
diff
changeset
|
378 |
in forall_elim_vars 0 (assume (cterm_of sign prop)) end; |
0 | 379 |
|
252
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
380 |
(*Resolution: exactly one resolvent must be produced.*) |
0 | 381 |
fun tha RSN (i,thb) = |
382 |
case Sequence.chop (2, biresolution false [(false,tha)] i thb) of |
|
383 |
([th],_) => th |
|
384 |
| ([],_) => raise THM("RSN: no unifiers", i, [tha,thb]) |
|
385 |
| _ => raise THM("RSN: multiple unifiers", i, [tha,thb]); |
|
386 |
||
387 |
(*resolution: P==>Q, Q==>R gives P==>R. *) |
|
388 |
fun tha RS thb = tha RSN (1,thb); |
|
389 |
||
390 |
(*For joining lists of rules*) |
|
252
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
391 |
fun thas RLN (i,thbs) = |
0 | 392 |
let val resolve = biresolution false (map (pair false) thas) i |
393 |
fun resb thb = Sequence.list_of_s (resolve thb) handle THM _ => [] |
|
2672
85d7e800d754
Replaced "flat" by the Basis Library function List.concat
paulson
parents:
2266
diff
changeset
|
394 |
in List.concat (map resb thbs) end; |
0 | 395 |
|
396 |
fun thas RL thbs = thas RLN (1,thbs); |
|
397 |
||
11
d0e17c42dbb4
Added MRS, MRL from ZF/ROOT.ML. These support forward proof, resolving a
lcp
parents:
0
diff
changeset
|
398 |
(*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
|
399 |
makes proof trees*) |
252
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
400 |
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
|
401 |
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
|
402 |
| 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
|
403 |
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
|
404 |
|
d0e17c42dbb4
Added MRS, MRL from ZF/ROOT.ML. These support forward proof, resolving a
lcp
parents:
0
diff
changeset
|
405 |
(*As above, but for rule lists*) |
252
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
406 |
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
|
407 |
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
|
408 |
| 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
|
409 |
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
|
410 |
|
252
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
411 |
(*compose Q and [...,Qi,Q(i+1),...]==>R to [...,Q(i+1),...]==>R |
0 | 412 |
with no lifting or renaming! Q may contain ==> or meta-quants |
413 |
ALWAYS deletes premise i *) |
|
252
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
414 |
fun compose(tha,i,thb) = |
0 | 415 |
Sequence.list_of_s (bicompose false (false,tha,0) i thb); |
416 |
||
417 |
(*compose Q and [Q1,Q2,...,Qk]==>R to [Q2,...,Qk]==>R getting unique result*) |
|
418 |
fun tha COMP thb = |
|
419 |
case compose(tha,1,thb) of |
|
252
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
420 |
[th] => th |
0 | 421 |
| _ => raise THM("COMP", 1, [tha,thb]); |
422 |
||
423 |
(*Instantiate theorem th, reading instantiations under signature sg*) |
|
424 |
fun read_instantiate_sg sg sinsts th = |
|
425 |
let val ts = types_sorts th; |
|
952
9e10962866b0
Removed an old bug which made some simultaneous instantiations fail if they
nipkow
parents:
949
diff
changeset
|
426 |
val used = add_term_tvarnames(#prop(rep_thm th),[]); |
9e10962866b0
Removed an old bug which made some simultaneous instantiations fail if they
nipkow
parents:
949
diff
changeset
|
427 |
in instantiate (read_insts sg ts ts used sinsts) th end; |
0 | 428 |
|
429 |
(*Instantiate theorem th, reading instantiations under theory of th*) |
|
430 |
fun read_instantiate sinsts th = |
|
431 |
read_instantiate_sg (#sign (rep_thm th)) sinsts th; |
|
432 |
||
433 |
||
434 |
(*Left-to-right replacements: tpairs = [...,(vi,ti),...]. |
|
435 |
Instantiates distinct Vars by terms, inferring type instantiations. *) |
|
436 |
local |
|
1435
aefcd255ed4a
Removed bug in type unification. Negative indexes are not used any longer.
nipkow
parents:
1412
diff
changeset
|
437 |
fun add_types ((ct,cu), (sign,tye,maxidx)) = |
2152 | 438 |
let val {sign=signt, t=t, T= T, maxidx=maxt,...} = rep_cterm ct |
439 |
and {sign=signu, t=u, T= U, maxidx=maxu,...} = rep_cterm cu; |
|
440 |
val maxi = Int.max(maxidx, Int.max(maxt, maxu)); |
|
0 | 441 |
val sign' = Sign.merge(sign, Sign.merge(signt, signu)) |
1435
aefcd255ed4a
Removed bug in type unification. Negative indexes are not used any longer.
nipkow
parents:
1412
diff
changeset
|
442 |
val (tye',maxi') = Type.unify (#tsig(Sign.rep_sg sign')) maxi tye (T,U) |
252
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
443 |
handle Type.TUNIFY => raise TYPE("add_types", [T,U], [t,u]) |
1435
aefcd255ed4a
Removed bug in type unification. Negative indexes are not used any longer.
nipkow
parents:
1412
diff
changeset
|
444 |
in (sign', tye', maxi') end; |
0 | 445 |
in |
252
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
446 |
fun cterm_instantiate ctpairs0 th = |
1435
aefcd255ed4a
Removed bug in type unification. Negative indexes are not used any longer.
nipkow
parents:
1412
diff
changeset
|
447 |
let val (sign,tye,_) = foldr add_types (ctpairs0, (#sign(rep_thm th),[],0)) |
0 | 448 |
val tsig = #tsig(Sign.rep_sg sign); |
449 |
fun instT(ct,cu) = let val inst = subst_TVars tye |
|
252
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
450 |
in (cterm_fun inst ct, cterm_fun inst cu) end |
229
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
214
diff
changeset
|
451 |
fun ctyp2 (ix,T) = (ix, ctyp_of sign T) |
0 | 452 |
in instantiate (map ctyp2 tye, map instT ctpairs0) th end |
252
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
453 |
handle TERM _ => |
0 | 454 |
raise THM("cterm_instantiate: incompatible signatures",0,[th]) |
455 |
| TYPE _ => raise THM("cterm_instantiate: types", 0, [th]) |
|
456 |
end; |
|
457 |
||
458 |
||
459 |
(** theorem equality test is exported and used by BEST_FIRST **) |
|
460 |
||
252
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
461 |
(*equality of theorems uses equality of signatures and |
0 | 462 |
the a-convertible test for terms*) |
252
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
463 |
fun eq_thm (th1,th2) = |
1218
59ed8ef1a3a1
modified pretty_thm, standard, eq_thm to handle shyps;
wenzelm
parents:
1194
diff
changeset
|
464 |
let val {sign=sg1, shyps=shyps1, hyps=hyps1, prop=prop1, ...} = rep_thm th1 |
59ed8ef1a3a1
modified pretty_thm, standard, eq_thm to handle shyps;
wenzelm
parents:
1194
diff
changeset
|
465 |
and {sign=sg2, shyps=shyps2, hyps=hyps2, prop=prop2, ...} = rep_thm th2 |
252
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
466 |
in Sign.eq_sg (sg1,sg2) andalso |
2180
934572a94139
Removal of polymorphic equality via mem, subset, eq_set, etc
paulson
parents:
2152
diff
changeset
|
467 |
eq_set_sort (shyps1, shyps2) andalso |
252
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
468 |
aconvs(hyps1,hyps2) andalso |
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
469 |
prop1 aconv prop2 |
0 | 470 |
end; |
471 |
||
1241 | 472 |
(*equality of theorems using similarity of signatures, |
473 |
i.e. the theorems belong to the same theory but not necessarily to the same |
|
474 |
version of this theory*) |
|
475 |
fun same_thm (th1,th2) = |
|
476 |
let val {sign=sg1, shyps=shyps1, hyps=hyps1, prop=prop1, ...} = rep_thm th1 |
|
477 |
and {sign=sg2, shyps=shyps2, hyps=hyps2, prop=prop2, ...} = rep_thm th2 |
|
478 |
in Sign.same_sg (sg1,sg2) andalso |
|
2180
934572a94139
Removal of polymorphic equality via mem, subset, eq_set, etc
paulson
parents:
2152
diff
changeset
|
479 |
eq_set_sort (shyps1, shyps2) andalso |
1241 | 480 |
aconvs(hyps1,hyps2) andalso |
481 |
prop1 aconv prop2 |
|
482 |
end; |
|
483 |
||
0 | 484 |
(*Do the two theorems have the same signature?*) |
252
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
485 |
fun eq_thm_sg (th1,th2) = Sign.eq_sg(#sign(rep_thm th1), #sign(rep_thm th2)); |
0 | 486 |
|
487 |
(*Useful "distance" function for BEST_FIRST*) |
|
488 |
val size_of_thm = size_of_term o #prop o rep_thm; |
|
489 |
||
490 |
||
1194
563ecd14c1d8
Added weak_eq_thm and forall_intr_vars (thanks to Mark Staples)
lcp
parents:
952
diff
changeset
|
491 |
(** 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
|
492 |
(some) type variable renaming **) |
563ecd14c1d8
Added weak_eq_thm and forall_intr_vars (thanks to Mark Staples)
lcp
parents:
952
diff
changeset
|
493 |
|
563ecd14c1d8
Added weak_eq_thm and forall_intr_vars (thanks to Mark Staples)
lcp
parents:
952
diff
changeset
|
494 |
(* 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
|
495 |
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
|
496 |
in the term. *) |
563ecd14c1d8
Added weak_eq_thm and forall_intr_vars (thanks to Mark Staples)
lcp
parents:
952
diff
changeset
|
497 |
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
|
498 |
| 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
|
499 |
| 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
|
500 |
| term_vars' _ = []; |
563ecd14c1d8
Added weak_eq_thm and forall_intr_vars (thanks to Mark Staples)
lcp
parents:
952
diff
changeset
|
501 |
|
563ecd14c1d8
Added weak_eq_thm and forall_intr_vars (thanks to Mark Staples)
lcp
parents:
952
diff
changeset
|
502 |
fun forall_intr_vars th = |
563ecd14c1d8
Added weak_eq_thm and forall_intr_vars (thanks to Mark Staples)
lcp
parents:
952
diff
changeset
|
503 |
let val {prop,sign,...} = rep_thm th; |
563ecd14c1d8
Added weak_eq_thm and forall_intr_vars (thanks to Mark Staples)
lcp
parents:
952
diff
changeset
|
504 |
val vars = distinct (term_vars' prop); |
563ecd14c1d8
Added weak_eq_thm and forall_intr_vars (thanks to Mark Staples)
lcp
parents:
952
diff
changeset
|
505 |
in forall_intr_list (map (cterm_of sign) vars) th end; |
563ecd14c1d8
Added weak_eq_thm and forall_intr_vars (thanks to Mark Staples)
lcp
parents:
952
diff
changeset
|
506 |
|
1237 | 507 |
fun weak_eq_thm (tha,thb) = |
1194
563ecd14c1d8
Added weak_eq_thm and forall_intr_vars (thanks to Mark Staples)
lcp
parents:
952
diff
changeset
|
508 |
eq_thm(forall_intr_vars (freezeT tha), forall_intr_vars (freezeT thb)); |
563ecd14c1d8
Added weak_eq_thm and forall_intr_vars (thanks to Mark Staples)
lcp
parents:
952
diff
changeset
|
509 |
|
563ecd14c1d8
Added weak_eq_thm and forall_intr_vars (thanks to Mark Staples)
lcp
parents:
952
diff
changeset
|
510 |
|
563ecd14c1d8
Added weak_eq_thm and forall_intr_vars (thanks to Mark Staples)
lcp
parents:
952
diff
changeset
|
511 |
|
0 | 512 |
(*** Meta-Rewriting Rules ***) |
513 |
||
514 |
val reflexive_thm = |
|
922
196ca0973a6d
added CPure (curried functions) and ProtoPure (ancestor of Pure and CPure)
clasohm
parents:
843
diff
changeset
|
515 |
let val cx = cterm_of Sign.proto_pure (Var(("x",0),TVar(("'a",0),logicS))) |
0 | 516 |
in Thm.reflexive cx end; |
517 |
||
518 |
val symmetric_thm = |
|
922
196ca0973a6d
added CPure (curried functions) and ProtoPure (ancestor of Pure and CPure)
clasohm
parents:
843
diff
changeset
|
519 |
let val xy = read_cterm Sign.proto_pure ("x::'a::logic == y",propT) |
0 | 520 |
in standard(Thm.implies_intr_hyps(Thm.symmetric(Thm.assume xy))) end; |
521 |
||
522 |
val transitive_thm = |
|
922
196ca0973a6d
added CPure (curried functions) and ProtoPure (ancestor of Pure and CPure)
clasohm
parents:
843
diff
changeset
|
523 |
let val xy = read_cterm Sign.proto_pure ("x::'a::logic == y",propT) |
196ca0973a6d
added CPure (curried functions) and ProtoPure (ancestor of Pure and CPure)
clasohm
parents:
843
diff
changeset
|
524 |
val yz = read_cterm Sign.proto_pure ("y::'a::logic == z",propT) |
0 | 525 |
val xythm = Thm.assume xy and yzthm = Thm.assume yz |
526 |
in standard(Thm.implies_intr yz (Thm.transitive xythm yzthm)) end; |
|
527 |
||
229
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
214
diff
changeset
|
528 |
(** Below, a "conversion" has type cterm -> thm **) |
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
214
diff
changeset
|
529 |
|
2004
3411fe560611
New operations on cterms. Now same names as in Logic
paulson
parents:
1906
diff
changeset
|
530 |
val refl_implies = reflexive (cterm_of Sign.proto_pure implies); |
0 | 531 |
|
532 |
(*In [A1,...,An]==>B, rewrite the selected A's only -- for rewrite_goals_tac*) |
|
214
ed6a3e2b1a33
added new parameter to the simplification tactics which indicates if
nipkow
parents:
211
diff
changeset
|
533 |
(*Do not rewrite flex-flex pairs*) |
252
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
534 |
fun goals_conv pred cv = |
229
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
214
diff
changeset
|
535 |
let fun gconv i ct = |
2004
3411fe560611
New operations on cterms. Now same names as in Logic
paulson
parents:
1906
diff
changeset
|
536 |
let val (A,B) = dest_implies ct |
229
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
214
diff
changeset
|
537 |
val (thA,j) = case term_of A of |
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
214
diff
changeset
|
538 |
Const("=?=",_)$_$_ => (reflexive A, i) |
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
214
diff
changeset
|
539 |
| _ => (if pred i then cv A else reflexive A, i+1) |
2004
3411fe560611
New operations on cterms. Now same names as in Logic
paulson
parents:
1906
diff
changeset
|
540 |
in combination (combination refl_implies thA) (gconv j B) end |
229
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
214
diff
changeset
|
541 |
handle TERM _ => reflexive ct |
0 | 542 |
in gconv 1 end; |
543 |
||
544 |
(*Use a conversion to transform a theorem*) |
|
229
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
214
diff
changeset
|
545 |
fun fconv_rule cv th = equal_elim (cv (cprop_of th)) th; |
0 | 546 |
|
547 |
(*rewriting conversion*) |
|
229
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
214
diff
changeset
|
548 |
fun rew_conv mode prover mss = rewrite_cterm mode mss prover; |
0 | 549 |
|
550 |
(*Rewrite a theorem*) |
|
3575
4e9beacb5339
improved rewrite_thm / rewrite_goals to handle conditional eqns;
wenzelm
parents:
3555
diff
changeset
|
551 |
fun rewrite_rule_aux _ [] th = th |
4e9beacb5339
improved rewrite_thm / rewrite_goals to handle conditional eqns;
wenzelm
parents:
3555
diff
changeset
|
552 |
| rewrite_rule_aux prover thms th = |
4e9beacb5339
improved rewrite_thm / rewrite_goals to handle conditional eqns;
wenzelm
parents:
3555
diff
changeset
|
553 |
fconv_rule (rew_conv (true,false) prover (Thm.mss_of thms)) th; |
0 | 554 |
|
3555 | 555 |
fun rewrite_thm mode prover mss = fconv_rule (rew_conv mode prover mss); |
556 |
||
0 | 557 |
(*Rewrite the subgoals of a proof state (represented by a theorem) *) |
3575
4e9beacb5339
improved rewrite_thm / rewrite_goals to handle conditional eqns;
wenzelm
parents:
3555
diff
changeset
|
558 |
fun rewrite_goals_rule_aux _ [] th = th |
4e9beacb5339
improved rewrite_thm / rewrite_goals to handle conditional eqns;
wenzelm
parents:
3555
diff
changeset
|
559 |
| rewrite_goals_rule_aux prover thms th = |
4e9beacb5339
improved rewrite_thm / rewrite_goals to handle conditional eqns;
wenzelm
parents:
3555
diff
changeset
|
560 |
fconv_rule (goals_conv (K true) (rew_conv (true, true) prover |
4e9beacb5339
improved rewrite_thm / rewrite_goals to handle conditional eqns;
wenzelm
parents:
3555
diff
changeset
|
561 |
(Thm.mss_of thms))) th; |
0 | 562 |
|
563 |
(*Rewrite the subgoal of a proof state (represented by a theorem) *) |
|
214
ed6a3e2b1a33
added new parameter to the simplification tactics which indicates if
nipkow
parents:
211
diff
changeset
|
564 |
fun rewrite_goal_rule mode prover mss i thm = |
ed6a3e2b1a33
added new parameter to the simplification tactics which indicates if
nipkow
parents:
211
diff
changeset
|
565 |
if 0 < i andalso i <= nprems_of thm |
ed6a3e2b1a33
added new parameter to the simplification tactics which indicates if
nipkow
parents:
211
diff
changeset
|
566 |
then fconv_rule (goals_conv (fn j => j=i) (rew_conv mode prover mss)) thm |
ed6a3e2b1a33
added new parameter to the simplification tactics which indicates if
nipkow
parents:
211
diff
changeset
|
567 |
else raise THM("rewrite_goal_rule",i,[thm]); |
0 | 568 |
|
569 |
||
570 |
(** Derived rules mainly for METAHYPS **) |
|
571 |
||
572 |
(*Given the term "a", takes (%x.t)==(%x.u) to t[a/x]==u[a/x]*) |
|
573 |
fun equal_abs_elim ca eqth = |
|
229
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
214
diff
changeset
|
574 |
let val {sign=signa, t=a, ...} = rep_cterm ca |
0 | 575 |
and combth = combination eqth (reflexive ca) |
576 |
val {sign,prop,...} = rep_thm eqth |
|
577 |
val (abst,absu) = Logic.dest_equals prop |
|
229
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
214
diff
changeset
|
578 |
val cterm = cterm_of (Sign.merge (sign,signa)) |
0 | 579 |
in transitive (symmetric (beta_conversion (cterm (abst$a)))) |
580 |
(transitive combth (beta_conversion (cterm (absu$a)))) |
|
581 |
end |
|
582 |
handle THM _ => raise THM("equal_abs_elim", 0, [eqth]); |
|
583 |
||
584 |
(*Calling equal_abs_elim with multiple terms*) |
|
585 |
fun equal_abs_elim_list cts th = foldr (uncurry equal_abs_elim) (rev cts, th); |
|
586 |
||
587 |
local |
|
588 |
val alpha = TVar(("'a",0), []) (* type ?'a::{} *) |
|
589 |
fun err th = raise THM("flexpair_inst: ", 0, [th]) |
|
590 |
fun flexpair_inst def th = |
|
591 |
let val {prop = Const _ $ t $ u, sign,...} = rep_thm th |
|
252
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
592 |
val cterm = cterm_of sign |
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
593 |
fun cvar a = cterm(Var((a,0),alpha)) |
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
594 |
val def' = cterm_instantiate [(cvar"t", cterm t), (cvar"u", cterm u)] |
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
595 |
def |
0 | 596 |
in equal_elim def' th |
597 |
end |
|
598 |
handle THM _ => err th | bind => err th |
|
599 |
in |
|
600 |
val flexpair_intr = flexpair_inst (symmetric flexpair_def) |
|
601 |
and flexpair_elim = flexpair_inst flexpair_def |
|
602 |
end; |
|
603 |
||
604 |
(*Version for flexflex pairs -- this supports lifting.*) |
|
252
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
605 |
fun flexpair_abs_elim_list cts = |
0 | 606 |
flexpair_intr o equal_abs_elim_list cts o flexpair_elim; |
607 |
||
608 |
||
609 |
(*** Some useful meta-theorems ***) |
|
610 |
||
611 |
(*The rule V/V, obtains assumption solving for eresolve_tac*) |
|
922
196ca0973a6d
added CPure (curried functions) and ProtoPure (ancestor of Pure and CPure)
clasohm
parents:
843
diff
changeset
|
612 |
val asm_rl = trivial(read_cterm Sign.proto_pure ("PROP ?psi",propT)); |
0 | 613 |
|
614 |
(*Meta-level cut rule: [| V==>W; V |] ==> W *) |
|
922
196ca0973a6d
added CPure (curried functions) and ProtoPure (ancestor of Pure and CPure)
clasohm
parents:
843
diff
changeset
|
615 |
val cut_rl = trivial(read_cterm Sign.proto_pure |
252
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
616 |
("PROP ?psi ==> PROP ?theta", propT)); |
0 | 617 |
|
252
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
618 |
(*Generalized elim rule for one conclusion; cut_rl with reversed premises: |
0 | 619 |
[| PROP V; PROP V ==> PROP W |] ==> PROP W *) |
620 |
val revcut_rl = |
|
922
196ca0973a6d
added CPure (curried functions) and ProtoPure (ancestor of Pure and CPure)
clasohm
parents:
843
diff
changeset
|
621 |
let val V = read_cterm Sign.proto_pure ("PROP V", propT) |
196ca0973a6d
added CPure (curried functions) and ProtoPure (ancestor of Pure and CPure)
clasohm
parents:
843
diff
changeset
|
622 |
and VW = read_cterm Sign.proto_pure ("PROP V ==> PROP W", propT); |
252
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
623 |
in standard (implies_intr V |
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
624 |
(implies_intr VW |
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
625 |
(implies_elim (assume VW) (assume V)))) |
0 | 626 |
end; |
627 |
||
668 | 628 |
(*for deleting an unwanted assumption*) |
629 |
val thin_rl = |
|
922
196ca0973a6d
added CPure (curried functions) and ProtoPure (ancestor of Pure and CPure)
clasohm
parents:
843
diff
changeset
|
630 |
let val V = read_cterm Sign.proto_pure ("PROP V", propT) |
196ca0973a6d
added CPure (curried functions) and ProtoPure (ancestor of Pure and CPure)
clasohm
parents:
843
diff
changeset
|
631 |
and W = read_cterm Sign.proto_pure ("PROP W", propT); |
668 | 632 |
in standard (implies_intr V (implies_intr W (assume W))) |
633 |
end; |
|
634 |
||
0 | 635 |
(* (!!x. PROP ?V) == PROP ?V Allows removal of redundant parameters*) |
636 |
val triv_forall_equality = |
|
922
196ca0973a6d
added CPure (curried functions) and ProtoPure (ancestor of Pure and CPure)
clasohm
parents:
843
diff
changeset
|
637 |
let val V = read_cterm Sign.proto_pure ("PROP V", propT) |
196ca0973a6d
added CPure (curried functions) and ProtoPure (ancestor of Pure and CPure)
clasohm
parents:
843
diff
changeset
|
638 |
and QV = read_cterm Sign.proto_pure ("!!x::'a. PROP V", propT) |
196ca0973a6d
added CPure (curried functions) and ProtoPure (ancestor of Pure and CPure)
clasohm
parents:
843
diff
changeset
|
639 |
and x = read_cterm Sign.proto_pure ("x", TFree("'a",logicS)); |
0 | 640 |
in standard (equal_intr (implies_intr QV (forall_elim x (assume QV))) |
252
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
641 |
(implies_intr V (forall_intr x (assume V)))) |
0 | 642 |
end; |
643 |
||
1756 | 644 |
(* (PROP ?PhiA ==> PROP ?PhiB ==> PROP ?Psi) ==> |
645 |
(PROP ?PhiB ==> PROP ?PhiA ==> PROP ?Psi) |
|
646 |
`thm COMP swap_prems_rl' swaps the first two premises of `thm' |
|
647 |
*) |
|
648 |
val swap_prems_rl = |
|
649 |
let val cmajor = read_cterm Sign.proto_pure |
|
650 |
("PROP PhiA ==> PROP PhiB ==> PROP Psi", propT); |
|
651 |
val major = assume cmajor; |
|
652 |
val cminor1 = read_cterm Sign.proto_pure ("PROP PhiA", propT); |
|
653 |
val minor1 = assume cminor1; |
|
654 |
val cminor2 = read_cterm Sign.proto_pure ("PROP PhiB", propT); |
|
655 |
val minor2 = assume cminor2; |
|
656 |
in standard |
|
657 |
(implies_intr cmajor (implies_intr cminor2 (implies_intr cminor1 |
|
658 |
(implies_elim (implies_elim major minor1) minor2)))) |
|
659 |
end; |
|
660 |
||
0 | 661 |
end; |
252
7532f95d7f44
removed eq_sg, pprint_sg, print_sg (now in sign.ML);
wenzelm
parents:
229
diff
changeset
|
662 |
|
1499 | 663 |
open Drule; |