author  paulson 
Wed, 18 Jun 1997 15:31:31 +0200  
changeset 3446  a14e5451f613 
parent 3282  c31e6239d4c9 
child 3448  8a79e27ac53b 
permissions  rwrr 
1465  1 
(* Title: HOL/simpdata.ML 
923  2 
ID: $Id$ 
1465  3 
Author: Tobias Nipkow 
923  4 
Copyright 1991 University of Cambridge 
5 

6 
Instantiation of the generic simplifier 

7 
*) 

8 

1984  9 
section "Simplifier"; 
10 

923  11 
open Simplifier; 
12 

1984  13 
(*** Addition of rules to simpsets and clasets simultaneously ***) 
14 

15 
(*Takes UNCONDITIONAL theorems of the form A<>B to 

2031  16 
the Safe Intr rule B==>A and 
17 
the Safe Destruct rule A==>B. 

1984  18 
Also ~A goes to the Safe Elim rule A ==> ?R 
19 
Failing other cases, A is added as a Safe Intr rule*) 

20 
local 

21 
val iff_const = HOLogic.eq_const HOLogic.boolT; 

22 

23 
fun addIff th = 

24 
(case HOLogic.dest_Trueprop (#prop(rep_thm th)) of 

2718  25 
(Const("Not",_) $ A) => 
2031  26 
AddSEs [zero_var_indexes (th RS notE)] 
27 
 (con $ _ $ _) => 

28 
if con=iff_const 

29 
then (AddSIs [zero_var_indexes (th RS iffD2)]; 

30 
AddSDs [zero_var_indexes (th RS iffD1)]) 

31 
else AddSIs [th] 

32 
 _ => AddSIs [th]; 

1984  33 
Addsimps [th]) 
34 
handle _ => error ("AddIffs: theorem must be unconditional\n" ^ 

2031  35 
string_of_thm th) 
1984  36 

37 
fun delIff th = 

38 
(case HOLogic.dest_Trueprop (#prop(rep_thm th)) of 

2718  39 
(Const("Not",_) $ A) => 
2031  40 
Delrules [zero_var_indexes (th RS notE)] 
41 
 (con $ _ $ _) => 

42 
if con=iff_const 

43 
then Delrules [zero_var_indexes (th RS iffD2), 

44 
zero_var_indexes (th RS iffD1)] 

45 
else Delrules [th] 

46 
 _ => Delrules [th]; 

1984  47 
Delsimps [th]) 
48 
handle _ => warning("DelIffs: ignoring conditional theorem\n" ^ 

2031  49 
string_of_thm th) 
1984  50 
in 
51 
val AddIffs = seq addIff 

52 
val DelIffs = seq delIff 

53 
end; 

54 

55 

923  56 
local 
57 

2935  58 
fun prover s = prove_goal HOL.thy s (fn _ => [blast_tac HOL_cs 1]); 
923  59 

1922  60 
val P_imp_P_iff_True = prover "P > (P = True)" RS mp; 
61 
val P_imp_P_eq_True = P_imp_P_iff_True RS eq_reflection; 

923  62 

1922  63 
val not_P_imp_P_iff_F = prover "~P > (P = False)" RS mp; 
64 
val not_P_imp_P_eq_False = not_P_imp_P_iff_F RS eq_reflection; 

923  65 

1922  66 
fun atomize pairs = 
67 
let fun atoms th = 

2031  68 
(case concl_of th of 
69 
Const("Trueprop",_) $ p => 

70 
(case head_of p of 

71 
Const(a,_) => 

72 
(case assoc(pairs,a) of 

73 
Some(rls) => flat (map atoms ([th] RL rls)) 

74 
 None => [th]) 

75 
 _ => [th]) 

76 
 _ => [th]) 

1922  77 
in atoms end; 
923  78 

2134  79 
fun gen_all th = forall_elim_vars (#maxidx(rep_thm th)+1) th; 
80 

81 
in 

82 

1922  83 
fun mk_meta_eq r = case concl_of r of 
2031  84 
Const("==",_)$_$_ => r 
1922  85 
 _$(Const("op =",_)$_$_) => r RS eq_reflection 
2718  86 
 _$(Const("Not",_)$_) => r RS not_P_imp_P_eq_False 
1922  87 
 _ => r RS P_imp_P_eq_True; 
88 
(* last 2 lines requires all formulae to be of the from Trueprop(.) *) 

923  89 

2082  90 
val simp_thms = map prover 
91 
[ "(x=x) = True", 

92 
"(~True) = False", "(~False) = True", "(~ ~ P) = P", 

93 
"(~P) ~= P", "P ~= (~P)", "(P ~= Q) = (P = (~Q))", 

94 
"(True=P) = P", "(P=True) = P", 

95 
"(True > P) = P", "(False > P) = True", 

96 
"(P > True) = True", "(P > P) = True", 

97 
"(P > False) = (~P)", "(P > ~P) = (~P)", 

98 
"(P & True) = P", "(True & P) = P", 

2800  99 
"(P & False) = False", "(False & P) = False", 
100 
"(P & P) = P", "(P & (P & Q)) = (P & Q)", 

2082  101 
"(P  True) = True", "(True  P) = True", 
2800  102 
"(P  False) = P", "(False  P) = P", 
103 
"(P  P) = P", "(P  (P  Q)) = (P  Q)", 

2082  104 
"((~P) = (~Q)) = (P=Q)", 
2129  105 
"(!x.P) = P", "(? x.P) = P", "? x. x=t", "? x. t=x", 
2082  106 
"(? x. x=t & P(x)) = P(t)", "(? x. t=x & P(x)) = P(t)", 
107 
"(! x. x=t > P(x)) = P(t)", "(! x. t=x > P(x)) = P(t)" ]; 

923  108 

988  109 
(*Add congruence rules for = (instead of ==) *) 
2636
4b30dbe4a020
added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents:
2595
diff
changeset

110 
infix 4 addcongs delcongs; 
923  111 
fun ss addcongs congs = ss addeqcongs (congs RL [eq_reflection]); 
2636
4b30dbe4a020
added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents:
2595
diff
changeset

112 
fun ss delcongs congs = ss deleqcongs (congs RL [eq_reflection]); 
923  113 

1264  114 
fun Addcongs congs = (simpset := !simpset addcongs congs); 
2636
4b30dbe4a020
added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents:
2595
diff
changeset

115 
fun Delcongs congs = (simpset := !simpset delcongs congs); 
1264  116 

923  117 
fun mksimps pairs = map mk_meta_eq o atomize pairs o gen_all; 
118 

1922  119 
val imp_cong = impI RSN 
120 
(2, prove_goal HOL.thy "(P=P')> (P'> (Q=Q'))> ((P>Q) = (P'>Q'))" 

2935  121 
(fn _=> [blast_tac HOL_cs 1]) RS mp RS mp); 
1922  122 

1948
78e5bfcbc1e9
Added miniscoping to the simplifier: quantifiers are now pushed in
paulson
parents:
1922
diff
changeset

123 
(*Miniscoping: pushing in existential quantifiers*) 
78e5bfcbc1e9
Added miniscoping to the simplifier: quantifiers are now pushed in
paulson
parents:
1922
diff
changeset

124 
val ex_simps = map prover 
2031  125 
["(EX x. P x & Q) = ((EX x.P x) & Q)", 
126 
"(EX x. P & Q x) = (P & (EX x.Q x))", 

127 
"(EX x. P x  Q) = ((EX x.P x)  Q)", 

128 
"(EX x. P  Q x) = (P  (EX x.Q x))", 

129 
"(EX x. P x > Q) = ((ALL x.P x) > Q)", 

130 
"(EX x. P > Q x) = (P > (EX x.Q x))"]; 

1948
78e5bfcbc1e9
Added miniscoping to the simplifier: quantifiers are now pushed in
paulson
parents:
1922
diff
changeset

131 

78e5bfcbc1e9
Added miniscoping to the simplifier: quantifiers are now pushed in
paulson
parents:
1922
diff
changeset

132 
(*Miniscoping: pushing in universal quantifiers*) 
78e5bfcbc1e9
Added miniscoping to the simplifier: quantifiers are now pushed in
paulson
parents:
1922
diff
changeset

133 
val all_simps = map prover 
2031  134 
["(ALL x. P x & Q) = ((ALL x.P x) & Q)", 
135 
"(ALL x. P & Q x) = (P & (ALL x.Q x))", 

136 
"(ALL x. P x  Q) = ((ALL x.P x)  Q)", 

137 
"(ALL x. P  Q x) = (P  (ALL x.Q x))", 

138 
"(ALL x. P x > Q) = ((EX x.P x) > Q)", 

139 
"(ALL x. P > Q x) = (P > (ALL x.Q x))"]; 

1948
78e5bfcbc1e9
Added miniscoping to the simplifier: quantifiers are now pushed in
paulson
parents:
1922
diff
changeset

140 

1722  141 

923  142 

2022  143 
(* elimination of existential quantifiers in assumptions *) 
923  144 

145 
val ex_all_equiv = 

146 
let val lemma1 = prove_goal HOL.thy 

147 
"(? x. P(x) ==> PROP Q) ==> (!!x. P(x) ==> PROP Q)" 

148 
(fn prems => [resolve_tac prems 1, etac exI 1]); 

149 
val lemma2 = prove_goalw HOL.thy [Ex_def] 

150 
"(!!x. P(x) ==> PROP Q) ==> (? x. P(x) ==> PROP Q)" 

151 
(fn prems => [REPEAT(resolve_tac prems 1)]) 

152 
in equal_intr lemma1 lemma2 end; 

153 

154 
end; 

155 

2935  156 
fun prove nm thm = qed_goal nm HOL.thy thm (fn _ => [blast_tac HOL_cs 1]); 
923  157 

158 
prove "conj_commute" "(P&Q) = (Q&P)"; 

159 
prove "conj_left_commute" "(P&(Q&R)) = (Q&(P&R))"; 

160 
val conj_comms = [conj_commute, conj_left_commute]; 

2134  161 
prove "conj_assoc" "((P&Q)&R) = (P&(Q&R))"; 
923  162 

1922  163 
prove "disj_commute" "(PQ) = (QP)"; 
164 
prove "disj_left_commute" "(P(QR)) = (Q(PR))"; 

165 
val disj_comms = [disj_commute, disj_left_commute]; 

2134  166 
prove "disj_assoc" "((PQ)R) = (P(QR))"; 
1922  167 

923  168 
prove "conj_disj_distribL" "(P&(QR)) = (P&Q  P&R)"; 
169 
prove "conj_disj_distribR" "((PQ)&R) = (P&R  Q&R)"; 

1485
240cc98b94a7
Added qed_spec_mp to avoid renaming of bound vars in 'th RS spec'
nipkow
parents:
1465
diff
changeset

170 

1892  171 
prove "disj_conj_distribL" "(P(Q&R)) = ((PQ) & (PR))"; 
172 
prove "disj_conj_distribR" "((P&Q)R) = ((PR) & (QR))"; 

173 

2134  174 
prove "imp_conjR" "(P > (Q&R)) = ((P>Q) & (P>R))"; 
175 
prove "imp_conjL" "((P&Q) >R) = (P > (Q > R))"; 

176 
prove "imp_disjL" "((PQ) > R) = ((P>R)&(Q>R))"; 

1892  177 

1485
240cc98b94a7
Added qed_spec_mp to avoid renaming of bound vars in 'th RS spec'
nipkow
parents:
1465
diff
changeset

178 
prove "de_Morgan_disj" "(~(P  Q)) = (~P & ~Q)"; 
240cc98b94a7
Added qed_spec_mp to avoid renaming of bound vars in 'th RS spec'
nipkow
parents:
1465
diff
changeset

179 
prove "de_Morgan_conj" "(~(P & Q)) = (~P  ~Q)"; 
3446
a14e5451f613
Addition of not_imp (which pushes negation into implication) as a default
paulson
parents:
3282
diff
changeset

180 
prove "not_imp" "(~(P > Q)) = (P & ~Q)"; 
1922  181 
prove "not_iff" "(P~=Q) = (P = (~Q))"; 
1485
240cc98b94a7
Added qed_spec_mp to avoid renaming of bound vars in 'th RS spec'
nipkow
parents:
1465
diff
changeset

182 

2134  183 
(*Avoids duplication of subgoals after expand_if, when the true and false 
184 
cases boil down to the same thing.*) 

185 
prove "cases_simp" "((P > Q) & (~P > Q)) = Q"; 

186 

1660  187 
prove "not_all" "(~ (! x.P(x))) = (? x.~P(x))"; 
1922  188 
prove "imp_all" "((! x. P x) > Q) = (? x. P x > Q)"; 
1660  189 
prove "not_ex" "(~ (? x.P(x))) = (! x.~P(x))"; 
1922  190 
prove "imp_ex" "((? x. P x) > Q) = (! x. P x > Q)"; 
1660  191 

1655  192 
prove "ex_disj_distrib" "(? x. P(x)  Q(x)) = ((? x. P(x))  (? x. Q(x)))"; 
193 
prove "all_conj_distrib" "(!x. P(x) & Q(x)) = ((! x. P(x)) & (! x. Q(x)))"; 

194 

2134  195 
(* '&' congruence rule: not included by default! 
196 
May slow rewrite proofs down by as much as 50% *) 

197 

198 
let val th = prove_goal HOL.thy 

199 
"(P=P')> (P'> (Q=Q'))> ((P&Q) = (P'&Q'))" 

2935  200 
(fn _=> [blast_tac HOL_cs 1]) 
2134  201 
in bind_thm("conj_cong",standard (impI RSN (2, th RS mp RS mp))) end; 
202 

203 
let val th = prove_goal HOL.thy 

204 
"(Q=Q')> (Q'> (P=P'))> ((P&Q) = (P'&Q'))" 

2935  205 
(fn _=> [blast_tac HOL_cs 1]) 
2134  206 
in bind_thm("rev_conj_cong",standard (impI RSN (2, th RS mp RS mp))) end; 
207 

208 
(* '' congruence rule: not included by default! *) 

209 

210 
let val th = prove_goal HOL.thy 

211 
"(P=P')> (~P'> (Q=Q'))> ((PQ) = (P'Q'))" 

2935  212 
(fn _=> [blast_tac HOL_cs 1]) 
2134  213 
in bind_thm("disj_cong",standard (impI RSN (2, th RS mp RS mp))) end; 
214 

215 
prove "eq_sym_conv" "(x=y) = (y=x)"; 

216 

217 
qed_goalw "o_apply" HOL.thy [o_def] "(f o g) x = f (g x)" 

218 
(fn _ => [rtac refl 1]); 

219 

220 
qed_goal "meta_eq_to_obj_eq" HOL.thy "x==y ==> x=y" 

221 
(fn [prem] => [rewtac prem, rtac refl 1]); 

222 

223 
qed_goalw "if_True" HOL.thy [if_def] "(if True then x else y) = x" 

2935  224 
(fn _=>[blast_tac (HOL_cs addIs [select_equality]) 1]); 
2134  225 

226 
qed_goalw "if_False" HOL.thy [if_def] "(if False then x else y) = y" 

2935  227 
(fn _=>[blast_tac (HOL_cs addIs [select_equality]) 1]); 
2134  228 

229 
qed_goal "if_P" HOL.thy "P ==> (if P then x else y) = x" 

230 
(fn [prem] => [ stac (prem RS eqTrueI) 1, rtac if_True 1 ]); 

231 
(* 

232 
qed_goal "if_not_P" HOL.thy "~P ==> (if P then x else y) = y" 

233 
(fn [prem] => [ stac (prem RS not_P_imp_P_iff_F) 1, rtac if_False 1 ]); 

234 
*) 

235 
qed_goalw "if_not_P" HOL.thy [if_def] "!!P. ~P ==> (if P then x else y) = y" 

2935  236 
(fn _ => [blast_tac (HOL_cs addIs [select_equality]) 1]); 
2134  237 

238 
qed_goal "expand_if" HOL.thy 

239 
"P(if Q then x else y) = ((Q > P(x)) & (~Q > P(y)))" 

240 
(fn _=> [ (res_inst_tac [("Q","Q")] (excluded_middle RS disjE) 1), 

241 
stac if_P 2, 

242 
stac if_not_P 1, 

2935  243 
REPEAT(blast_tac HOL_cs 1) ]); 
2134  244 

245 
qed_goal "if_bool_eq" HOL.thy 

246 
"(if P then Q else R) = ((P>Q) & (~P>R))" 

247 
(fn _ => [rtac expand_if 1]); 

248 

2263  249 
local val mktac = mk_case_split_tac (meta_eq_to_obj_eq RS iffD2) 
250 
in 

251 
fun split_tac splits = mktac (map mk_meta_eq splits) 

252 
end; 

253 

254 
local val mktac = mk_case_split_inside_tac (meta_eq_to_obj_eq RS iffD2) 

255 
in 

256 
fun split_inside_tac splits = mktac (map mk_meta_eq splits) 

257 
end; 

258 

259 

2251  260 
qed_goal "if_cancel" HOL.thy "(if c then x else x) = x" 
2935  261 
(fn _ => [split_tac [expand_if] 1, blast_tac HOL_cs 1]); 
2251  262 

2134  263 
(** 'if' congruence rules: neither included by default! *) 
264 

265 
(*Simplifies x assuming c and y assuming ~c*) 

266 
qed_goal "if_cong" HOL.thy 

267 
"[ b=c; c ==> x=u; ~c ==> y=v ] ==>\ 

268 
\ (if b then x else y) = (if c then u else v)" 

269 
(fn rew::prems => 

270 
[stac rew 1, stac expand_if 1, stac expand_if 1, 

2935  271 
blast_tac (HOL_cs addDs prems) 1]); 
2134  272 

273 
(*Prevents simplification of x and y: much faster*) 

274 
qed_goal "if_weak_cong" HOL.thy 

275 
"b=c ==> (if b then x else y) = (if c then x else y)" 

276 
(fn [prem] => [rtac (prem RS arg_cong) 1]); 

277 

278 
(*Prevents simplification of t: much faster*) 

279 
qed_goal "let_weak_cong" HOL.thy 

280 
"a = b ==> (let x=a in t(x)) = (let x=b in t(x))" 

281 
(fn [prem] => [rtac (prem RS arg_cong) 1]); 

282 

283 
(*In general it seems wrong to add distributive laws by default: they 

284 
might cause exponential blowup. But imp_disjL has been in for a while 

285 
and cannot be removed without affecting existing proofs. Moreover, 

286 
rewriting by "(PQ > R) = ((P>R)&(Q>R))" might be justified on the 

287 
grounds that it allows simplification of R in the two cases.*) 

288 

289 
val mksimps_pairs = 

290 
[("op >", [mp]), ("op &", [conjunct1,conjunct2]), 

291 
("All", [spec]), ("True", []), ("False", []), 

292 
("If", [if_bool_eq RS iffD1])]; 

1758  293 

2636
4b30dbe4a020
added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents:
2595
diff
changeset

294 
fun unsafe_solver prems = FIRST'[resolve_tac (TrueI::refl::prems), 
4b30dbe4a020
added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents:
2595
diff
changeset

295 
atac, etac FalseE]; 
4b30dbe4a020
added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents:
2595
diff
changeset

296 
(*No premature instantiation of variables during simplification*) 
4b30dbe4a020
added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents:
2595
diff
changeset

297 
fun safe_solver prems = FIRST'[match_tac (TrueI::refl::prems), 
4b30dbe4a020
added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents:
2595
diff
changeset

298 
eq_assume_tac, ematch_tac [FalseE]]; 
2443
a81d4c219c3c
factored out HOL_base_ss and val HOL_min_ss, added HOL_safe_min_ss
oheimb
parents:
2263
diff
changeset

299 

2636
4b30dbe4a020
added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents:
2595
diff
changeset

300 
val HOL_basic_ss = empty_ss setsubgoaler asm_simp_tac 
4b30dbe4a020
added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents:
2595
diff
changeset

301 
setSSolver safe_solver 
4b30dbe4a020
added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents:
2595
diff
changeset

302 
setSolver unsafe_solver 
4b30dbe4a020
added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents:
2595
diff
changeset

303 
setmksimps (mksimps mksimps_pairs); 
2443
a81d4c219c3c
factored out HOL_base_ss and val HOL_min_ss, added HOL_safe_min_ss
oheimb
parents:
2263
diff
changeset

304 

3446
a14e5451f613
Addition of not_imp (which pushes negation into implication) as a default
paulson
parents:
3282
diff
changeset

305 
val HOL_ss = 
a14e5451f613
Addition of not_imp (which pushes negation into implication) as a default
paulson
parents:
3282
diff
changeset

306 
HOL_basic_ss addsimps 
a14e5451f613
Addition of not_imp (which pushes negation into implication) as a default
paulson
parents:
3282
diff
changeset

307 
([triv_forall_equality, (* prunes params *) 
a14e5451f613
Addition of not_imp (which pushes negation into implication) as a default
paulson
parents:
3282
diff
changeset

308 
if_True, if_False, if_cancel, 
a14e5451f613
Addition of not_imp (which pushes negation into implication) as a default
paulson
parents:
3282
diff
changeset

309 
o_apply, imp_disjL, conj_assoc, disj_assoc, 
a14e5451f613
Addition of not_imp (which pushes negation into implication) as a default
paulson
parents:
3282
diff
changeset

310 
de_Morgan_conj, de_Morgan_disj, not_imp, 
a14e5451f613
Addition of not_imp (which pushes negation into implication) as a default
paulson
parents:
3282
diff
changeset

311 
not_all, not_ex, cases_simp] 
a14e5451f613
Addition of not_imp (which pushes negation into implication) as a default
paulson
parents:
3282
diff
changeset

312 
@ ex_simps @ all_simps @ simp_thms) 
a14e5451f613
Addition of not_imp (which pushes negation into implication) as a default
paulson
parents:
3282
diff
changeset

313 
addcongs [imp_cong]; 
2082  314 

1655  315 
qed_goal "if_distrib" HOL.thy 
316 
"f(if c then x else y) = (if c then f x else f y)" 

317 
(fn _ => [simp_tac (HOL_ss setloop (split_tac [expand_if])) 1]); 

318 

2097  319 
qed_goalw "o_assoc" HOL.thy [o_def] "f o (g o h) = f o g o h" 
2098
2bfc0675c92f
corrected `correction` of o_assoc (of version 1.14),
oheimb
parents:
2097
diff
changeset

320 
(fn _ => [rtac ext 1, rtac refl 1]); 
1984  321 

322 

2948
f18035b1d531
Moved expand_case_tac from Auth/Message.ML to simpdata.ML
paulson
parents:
2935
diff
changeset

323 
val prems = goal HOL.thy "[ P ==> Q(True); ~P ==> Q(False) ] ==> Q(P)"; 
f18035b1d531
Moved expand_case_tac from Auth/Message.ML to simpdata.ML
paulson
parents:
2935
diff
changeset

324 
by (case_tac "P" 1); 
f18035b1d531
Moved expand_case_tac from Auth/Message.ML to simpdata.ML
paulson
parents:
2935
diff
changeset

325 
by (ALLGOALS (asm_simp_tac (HOL_ss addsimps prems))); 
f18035b1d531
Moved expand_case_tac from Auth/Message.ML to simpdata.ML
paulson
parents:
2935
diff
changeset

326 
val expand_case = result(); 
f18035b1d531
Moved expand_case_tac from Auth/Message.ML to simpdata.ML
paulson
parents:
2935
diff
changeset

327 

f18035b1d531
Moved expand_case_tac from Auth/Message.ML to simpdata.ML
paulson
parents:
2935
diff
changeset

328 
fun expand_case_tac P i = 
f18035b1d531
Moved expand_case_tac from Auth/Message.ML to simpdata.ML
paulson
parents:
2935
diff
changeset

329 
res_inst_tac [("P",P)] expand_case i THEN 
f18035b1d531
Moved expand_case_tac from Auth/Message.ML to simpdata.ML
paulson
parents:
2935
diff
changeset

330 
Simp_tac (i+1) THEN 
f18035b1d531
Moved expand_case_tac from Auth/Message.ML to simpdata.ML
paulson
parents:
2935
diff
changeset

331 
Simp_tac i; 
f18035b1d531
Moved expand_case_tac from Auth/Message.ML to simpdata.ML
paulson
parents:
2935
diff
changeset

332 

f18035b1d531
Moved expand_case_tac from Auth/Message.ML to simpdata.ML
paulson
parents:
2935
diff
changeset

333 

1984  334 

335 

336 
(*** Install simpsets and datatypes in theory structure ***) 

337 

2251  338 
simpset := HOL_ss; 
1984  339 

340 
exception SS_DATA of simpset; 

341 

342 
let fun merge [] = SS_DATA empty_ss 

343 
 merge ss = let val ss = map (fn SS_DATA x => x) ss; 

344 
in SS_DATA (foldl merge_ss (hd ss, tl ss)) end; 

345 

346 
fun put (SS_DATA ss) = simpset := ss; 

347 

348 
fun get () = SS_DATA (!simpset); 

349 
in add_thydata "HOL" 

350 
("simpset", ThyMethods {merge = merge, put = put, get = get}) 

351 
end; 

352 

3040
7d48671753da
Introduced a generic "induct_tac" which picks up the right induction scheme
nipkow
parents:
2948
diff
changeset

353 
type dtype_info = {case_const:term, 
7d48671753da
Introduced a generic "induct_tac" which picks up the right induction scheme
nipkow
parents:
2948
diff
changeset

354 
case_rewrites:thm list, 
7d48671753da
Introduced a generic "induct_tac" which picks up the right induction scheme
nipkow
parents:
2948
diff
changeset

355 
constructors:term list, 
7d48671753da
Introduced a generic "induct_tac" which picks up the right induction scheme
nipkow
parents:
2948
diff
changeset

356 
induct_tac: string > int > tactic, 
3282
c31e6239d4c9
Added exhaustion thm and exhaust_tac for each datatype.
nipkow
parents:
3206
diff
changeset

357 
nchotomy: thm, 
c31e6239d4c9
Added exhaustion thm and exhaust_tac for each datatype.
nipkow
parents:
3206
diff
changeset

358 
exhaustion: thm, 
c31e6239d4c9
Added exhaustion thm and exhaust_tac for each datatype.
nipkow
parents:
3206
diff
changeset

359 
exhaust_tac: string > int > tactic, 
3040
7d48671753da
Introduced a generic "induct_tac" which picks up the right induction scheme
nipkow
parents:
2948
diff
changeset

360 
case_cong:thm}; 
1984  361 

362 
exception DT_DATA of (string * dtype_info) list; 

363 
val datatypes = ref [] : (string * dtype_info) list ref; 

364 

365 
let fun merge [] = DT_DATA [] 

366 
 merge ds = 

367 
let val ds = map (fn DT_DATA x => x) ds; 

368 
in DT_DATA (foldl (gen_union eq_fst) (hd ds, tl ds)) end; 

369 

370 
fun put (DT_DATA ds) = datatypes := ds; 

371 

372 
fun get () = DT_DATA (!datatypes); 

373 
in add_thydata "HOL" 

374 
("datatypes", ThyMethods {merge = merge, put = put, get = get}) 

375 
end; 

376 

377 

378 
add_thy_reader_file "thy_data.ML"; 

2636
4b30dbe4a020
added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents:
2595
diff
changeset

379 

4b30dbe4a020
added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents:
2595
diff
changeset

380 

4b30dbe4a020
added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents:
2595
diff
changeset

381 

4b30dbe4a020
added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents:
2595
diff
changeset

382 

4b30dbe4a020
added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents:
2595
diff
changeset

383 
(*** Integration of simplifier with classical reasoner ***) 
4b30dbe4a020
added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents:
2595
diff
changeset

384 

4b30dbe4a020
added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents:
2595
diff
changeset

385 
(* rot_eq_tac rotates the first equality premise of subgoal i to the front, 
4b30dbe4a020
added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents:
2595
diff
changeset

386 
fails if there is no equaliy or if an equality is already at the front *) 
2805  387 
fun rot_eq_tac i = 
388 
let fun is_eq (Const ("Trueprop", _) $ (Const("op =",_) $ _ $ _)) = true 

389 
 is_eq _ = false; 

390 
fun find_eq n [] = None 

391 
 find_eq n (t :: ts) = if (is_eq t) then Some n 

392 
else find_eq (n + 1) ts; 

393 
fun rot_eq state = 

394 
let val (_, _, Bi, _) = dest_state (state, i) 

395 
in case find_eq 0 (Logic.strip_assums_hyp Bi) of 

396 
None => no_tac 

397 
 Some 0 => no_tac 

398 
 Some n => rotate_tac n i 

399 
end; 

400 
in STATE rot_eq end; 

2636
4b30dbe4a020
added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents:
2595
diff
changeset

401 

4b30dbe4a020
added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents:
2595
diff
changeset

402 
(*an unsatisfactory fix for the incomplete asm_full_simp_tac! 
4b30dbe4a020
added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents:
2595
diff
changeset

403 
better: asm_really_full_simp_tac, a yet to be implemented version of 
4b30dbe4a020
added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents:
2595
diff
changeset

404 
asm_full_simp_tac that applies all equalities in the 
4b30dbe4a020
added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents:
2595
diff
changeset

405 
premises to all the premises *) 
4b30dbe4a020
added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents:
2595
diff
changeset

406 
fun safe_asm_more_full_simp_tac ss = TRY o rot_eq_tac THEN' 
4b30dbe4a020
added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents:
2595
diff
changeset

407 
safe_asm_full_simp_tac ss; 
4b30dbe4a020
added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents:
2595
diff
changeset

408 

4b30dbe4a020
added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents:
2595
diff
changeset

409 
(*Add a simpset to a classical set!*) 
3206
a3de7f32728c
renamed addss to addSss, unsafe_addss to addss, extended auto_tac
oheimb
parents:
3040
diff
changeset

410 
infix 4 addSss addss; 
a3de7f32728c
renamed addss to addSss, unsafe_addss to addss, extended auto_tac
oheimb
parents:
3040
diff
changeset

411 
fun cs addSss ss = cs addSaltern (CHANGED o (safe_asm_more_full_simp_tac ss)); 
a3de7f32728c
renamed addss to addSss, unsafe_addss to addss, extended auto_tac
oheimb
parents:
3040
diff
changeset

412 
fun cs addss ss = cs addbefore asm_full_simp_tac ss; 
2636
4b30dbe4a020
added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents:
2595
diff
changeset

413 

4b30dbe4a020
added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents:
2595
diff
changeset

414 
fun Addss ss = (claset := !claset addss ss); 
4b30dbe4a020
added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents:
2595
diff
changeset

415 

4b30dbe4a020
added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents:
2595
diff
changeset

416 
(*Designed to be idempotent, except if best_tac instantiates variables 
4b30dbe4a020
added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents:
2595
diff
changeset

417 
in some of the subgoals*) 
4b30dbe4a020
added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents:
2595
diff
changeset

418 

4b30dbe4a020
added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents:
2595
diff
changeset

419 
type clasimpset = (claset * simpset); 
4b30dbe4a020
added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents:
2595
diff
changeset

420 

4b30dbe4a020
added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents:
2595
diff
changeset

421 
val HOL_css = (HOL_cs, HOL_ss); 
4b30dbe4a020
added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents:
2595
diff
changeset

422 

4b30dbe4a020
added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents:
2595
diff
changeset

423 
fun pair_upd1 f ((a,b),x) = (f(a,x), b); 
4b30dbe4a020
added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents:
2595
diff
changeset

424 
fun pair_upd2 f ((a,b),x) = (a, f(b,x)); 
4b30dbe4a020
added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents:
2595
diff
changeset

425 

4b30dbe4a020
added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents:
2595
diff
changeset

426 
infix 4 addSIs2 addSEs2 addSDs2 addIs2 addEs2 addDs2 
4b30dbe4a020
added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents:
2595
diff
changeset

427 
addsimps2 delsimps2 addcongs2 delcongs2; 
2748
3ae9ccdd701e
Etaexpanded some declarations for compatibility with value polymorphism
paulson
parents:
2718
diff
changeset

428 
fun op addSIs2 arg = pair_upd1 (op addSIs) arg; 
3ae9ccdd701e
Etaexpanded some declarations for compatibility with value polymorphism
paulson
parents:
2718
diff
changeset

429 
fun op addSEs2 arg = pair_upd1 (op addSEs) arg; 
3ae9ccdd701e
Etaexpanded some declarations for compatibility with value polymorphism
paulson
parents:
2718
diff
changeset

430 
fun op addSDs2 arg = pair_upd1 (op addSDs) arg; 
3ae9ccdd701e
Etaexpanded some declarations for compatibility with value polymorphism
paulson
parents:
2718
diff
changeset

431 
fun op addIs2 arg = pair_upd1 (op addIs ) arg; 
3ae9ccdd701e
Etaexpanded some declarations for compatibility with value polymorphism
paulson
parents:
2718
diff
changeset

432 
fun op addEs2 arg = pair_upd1 (op addEs ) arg; 
3ae9ccdd701e
Etaexpanded some declarations for compatibility with value polymorphism
paulson
parents:
2718
diff
changeset

433 
fun op addDs2 arg = pair_upd1 (op addDs ) arg; 
3ae9ccdd701e
Etaexpanded some declarations for compatibility with value polymorphism
paulson
parents:
2718
diff
changeset

434 
fun op addsimps2 arg = pair_upd2 (op addsimps) arg; 
3ae9ccdd701e
Etaexpanded some declarations for compatibility with value polymorphism
paulson
parents:
2718
diff
changeset

435 
fun op delsimps2 arg = pair_upd2 (op delsimps) arg; 
3ae9ccdd701e
Etaexpanded some declarations for compatibility with value polymorphism
paulson
parents:
2718
diff
changeset

436 
fun op addcongs2 arg = pair_upd2 (op addcongs) arg; 
3ae9ccdd701e
Etaexpanded some declarations for compatibility with value polymorphism
paulson
parents:
2718
diff
changeset

437 
fun op delcongs2 arg = pair_upd2 (op delcongs) arg; 
2636
4b30dbe4a020
added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents:
2595
diff
changeset

438 

2805  439 
fun auto_tac (cs,ss) = 
440 
let val cs' = cs addss ss 

441 
in EVERY [TRY (safe_tac cs'), 

442 
REPEAT (FIRSTGOAL (fast_tac cs')), 

3206
a3de7f32728c
renamed addss to addSss, unsafe_addss to addss, extended auto_tac
oheimb
parents:
3040
diff
changeset

443 
TRY (safe_tac (cs addSss ss)), 
2805  444 
prune_params_tac] 
445 
end; 

2636
4b30dbe4a020
added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents:
2595
diff
changeset

446 

4b30dbe4a020
added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents:
2595
diff
changeset

447 
fun Auto_tac () = auto_tac (!claset, !simpset); 
4b30dbe4a020
added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents:
2595
diff
changeset

448 

4b30dbe4a020
added delcongs, Delcongs, unsafe_solver, safe_solver, HOL_basic_ss,
oheimb
parents:
2595
diff
changeset

449 
fun auto () = by (Auto_tac ()); 