author  nipkow 
Mon, 17 Dec 2001 14:27:18 +0100  
changeset 12526  1b9db2581fe2 
parent 12038  343a9888e875 
child 12720  f8a134b9a57f 
permissions  rwrr 
9889  1 
(* Title: FOL/simpdata.ML 
0  2 
ID: $Id$ 
1459  3 
Author: Lawrence C Paulson, Cambridge University Computer Laboratory 
282  4 
Copyright 1994 University of Cambridge 
0  5 

9889  6 
Simplification data for FOL. 
0  7 
*) 
8 

9300  9 

5496  10 
(* Elimination of True from asumptions: *) 
11 

12038  12 
bind_thm ("True_implies_equals", prove_goal IFOL.thy 
5496  13 
"(True ==> PROP P) == PROP P" 
14 
(K [rtac equal_intr_rule 1, atac 2, 

15 
METAHYPS (fn prems => resolve_tac prems 1) 1, 

12038  16 
rtac TrueI 1])); 
5496  17 

18 

0  19 
(*** Rewrite rules ***) 
20 

10431  21 
fun int_prove_fun s = 
22 
(writeln s; 

282  23 
prove_goal IFOL.thy s 
10431  24 
(fn prems => [ (cut_facts_tac prems 1), 
2601
b301958c465d
Renamed structure Int (intuitionistic prover) to IntPr to prevent clash
paulson
parents:
2469
diff
changeset

25 
(IntPr.fast_tac 1) ])); 
0  26 

12038  27 
bind_thms ("conj_simps", map int_prove_fun 
1459  28 
["P & True <> P", "True & P <> P", 
0  29 
"P & False <> False", "False & P <> False", 
2801  30 
"P & P <> P", "P & P & Q <> P & Q", 
1459  31 
"P & ~P <> False", "~P & P <> False", 
12038  32 
"(P & Q) & R <> P & (Q & R)"]); 
0  33 

12038  34 
bind_thms ("disj_simps", map int_prove_fun 
1459  35 
["P  True <> True", "True  P <> True", 
36 
"P  False <> P", "False  P <> P", 

2801  37 
"P  P <> P", "P  P  Q <> P  Q", 
12038  38 
"(P  Q)  R <> P  (Q  R)"]); 
0  39 

12038  40 
bind_thms ("not_simps", map int_prove_fun 
282  41 
["~(PQ) <> ~P & ~Q", 
12038  42 
"~ False <> True", "~ True <> False"]); 
0  43 

12038  44 
bind_thms ("imp_simps", map int_prove_fun 
1459  45 
["(P > False) <> ~P", "(P > True) <> True", 
10431  46 
"(False > P) <> True", "(True > P) <> P", 
12038  47 
"(P > P) <> True", "(P > ~P) <> ~P"]); 
0  48 

12038  49 
bind_thms ("iff_simps", map int_prove_fun 
1459  50 
["(True <> P) <> P", "(P <> True) <> P", 
0  51 
"(P <> P) <> True", 
12038  52 
"(False <> P) <> ~P", "(P <> False) <> ~P"]); 
0  53 

4349
50403e5a44c0
Instantiated the onepointrule quantifier simpprocs for FOL
paulson
parents:
4325
diff
changeset

54 
(*The x=t versions are needed for the simplification procedures*) 
12038  55 
bind_thms ("quant_simps", map int_prove_fun 
10431  56 
["(ALL x. P) <> P", 
4349
50403e5a44c0
Instantiated the onepointrule quantifier simpprocs for FOL
paulson
parents:
4325
diff
changeset

57 
"(ALL x. x=t > P(x)) <> P(t)", 
50403e5a44c0
Instantiated the onepointrule quantifier simpprocs for FOL
paulson
parents:
4325
diff
changeset

58 
"(ALL x. t=x > P(x)) <> P(t)", 
50403e5a44c0
Instantiated the onepointrule quantifier simpprocs for FOL
paulson
parents:
4325
diff
changeset

59 
"(EX x. P) <> P", 
10431  60 
"(EX x. x=t & P(x)) <> P(t)", 
12038  61 
"(EX x. t=x & P(x)) <> P(t)"]); 
0  62 

63 
(*These are NOT supplied by default!*) 

12038  64 
bind_thms ("distrib_simps", map int_prove_fun 
10431  65 
["P & (Q  R) <> P&Q  P&R", 
282  66 
"(Q  R) & P <> Q&P  R&P", 
12038  67 
"(P  Q > R) <> (P > R) & (Q > R)"]); 
0  68 

282  69 
(** Conversion into rewrite rules **) 
0  70 

53  71 
fun gen_all th = forall_elim_vars (#maxidx(rep_thm th)+1) th; 
72 

12038  73 
bind_thm ("P_iff_F", int_prove_fun "~P ==> (P <> False)"); 
74 
bind_thm ("iff_reflection_F", P_iff_F RS iff_reflection); 

282  75 

12038  76 
bind_thm ("P_iff_T", int_prove_fun "P ==> (P <> True)"); 
77 
bind_thm ("iff_reflection_T", P_iff_T RS iff_reflection); 

282  78 

79 
(*Make metaequalities. The operator below is Trueprop*) 

5555  80 

282  81 
fun mk_meta_eq th = case concl_of th of 
5555  82 
_ $ (Const("op =",_)$_$_) => th RS eq_reflection 
83 
 _ $ (Const("op <>",_)$_$_) => th RS iff_reflection 

10431  84 
 _ => 
5555  85 
error("conclusion must be a =equality or <>");; 
86 

87 
fun mk_eq th = case concl_of th of 

394
432bb9995893
Modified mk_meta_eq to leave metaequlities on unchanged.
nipkow
parents:
371
diff
changeset

88 
Const("==",_)$_$_ => th 
5555  89 
 _ $ (Const("op =",_)$_$_) => mk_meta_eq th 
90 
 _ $ (Const("op <>",_)$_$_) => mk_meta_eq th 

282  91 
 _ $ (Const("Not",_)$_) => th RS iff_reflection_F 
92 
 _ => th RS iff_reflection_T; 

0  93 

6114
45958e54d72e
congruence rules finally use == instead of = and <>
paulson
parents:
5555
diff
changeset

94 
(*Replace premises x=y, X<>Y by X==Y*) 
10431  95 
val mk_meta_prems = 
96 
rule_by_tactic 

6114
45958e54d72e
congruence rules finally use == instead of = and <>
paulson
parents:
5555
diff
changeset

97 
(REPEAT_FIRST (resolve_tac [meta_eq_to_obj_eq, def_imp_iff])); 
45958e54d72e
congruence rules finally use == instead of = and <>
paulson
parents:
5555
diff
changeset

98 

9713  99 
(*Congruence rules for = or <> (instead of ==)*) 
6114
45958e54d72e
congruence rules finally use == instead of = and <>
paulson
parents:
5555
diff
changeset

100 
fun mk_meta_cong rl = 
45958e54d72e
congruence rules finally use == instead of = and <>
paulson
parents:
5555
diff
changeset

101 
standard(mk_meta_eq (mk_meta_prems rl)) 
45958e54d72e
congruence rules finally use == instead of = and <>
paulson
parents:
5555
diff
changeset

102 
handle THM _ => 
45958e54d72e
congruence rules finally use == instead of = and <>
paulson
parents:
5555
diff
changeset

103 
error("Premises and conclusion of congruence rules must use =equality or <>"); 
5555  104 

5304  105 
val mksimps_pairs = 
106 
[("op >", [mp]), ("op &", [conjunct1,conjunct2]), 

107 
("All", [spec]), ("True", []), ("False", [])]; 

108 

5555  109 
(* ###FIXME: move to Provers/simplifier.ML 
5304  110 
val mk_atomize: (string * thm list) list > thm > thm list 
111 
*) 

5555  112 
(* ###FIXME: move to Provers/simplifier.ML *) 
5304  113 
fun mk_atomize pairs = 
114 
let fun atoms th = 

115 
(case concl_of th of 

116 
Const("Trueprop",_) $ p => 

117 
(case head_of p of 

118 
Const(a,_) => 

119 
(case assoc(pairs,a) of 

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

121 
 None => [th]) 

122 
 _ => [th]) 

123 
 _ => [th]) 

124 
in atoms end; 

125 

5555  126 
fun mksimps pairs = (map mk_eq o mk_atomize pairs o gen_all); 
981  127 

2074
30a65172e003
Added the de Morgan laws (incl quantifier versions) to basic simpset
paulson
parents:
2065
diff
changeset

128 
(*** Classical laws ***) 
282  129 

10431  130 
fun prove_fun s = 
131 
(writeln s; 

7355
4c43090659ca
proper bootstrap of IFOL/FOL theories and packages;
wenzelm
parents:
6391
diff
changeset

132 
prove_goal (the_context ()) s 
10431  133 
(fn prems => [ (cut_facts_tac prems 1), 
1459  134 
(Cla.fast_tac FOL_cs 1) ])); 
745  135 

10431  136 
(*Avoids duplication of subgoals after expand_if, when the true and false 
137 
cases boil down to the same thing.*) 

12038  138 
bind_thm ("cases_simp", prove_fun "(P > Q) & (~P > Q) <> Q"); 
1953  139 

4349
50403e5a44c0
Instantiated the onepointrule quantifier simpprocs for FOL
paulson
parents:
4325
diff
changeset

140 

50403e5a44c0
Instantiated the onepointrule quantifier simpprocs for FOL
paulson
parents:
4325
diff
changeset

141 
(*** Miniscoping: pushing quantifiers in 
50403e5a44c0
Instantiated the onepointrule quantifier simpprocs for FOL
paulson
parents:
4325
diff
changeset

142 
We do NOT distribute of ALL over &, or dually that of EX over  
10431  143 
Baaz and Leitsch, On Skolemization and Proof Complexity (1994) 
4349
50403e5a44c0
Instantiated the onepointrule quantifier simpprocs for FOL
paulson
parents:
4325
diff
changeset

144 
show that this step can increase proof length! 
50403e5a44c0
Instantiated the onepointrule quantifier simpprocs for FOL
paulson
parents:
4325
diff
changeset

145 
***) 
50403e5a44c0
Instantiated the onepointrule quantifier simpprocs for FOL
paulson
parents:
4325
diff
changeset

146 

50403e5a44c0
Instantiated the onepointrule quantifier simpprocs for FOL
paulson
parents:
4325
diff
changeset

147 
(*existential miniscoping*) 
12038  148 
bind_thms ("int_ex_simps", map int_prove_fun 
149 
["(EX x. P(x) & Q) <> (EX x. P(x)) & Q", 

150 
"(EX x. P & Q(x)) <> P & (EX x. Q(x))", 

151 
"(EX x. P(x)  Q) <> (EX x. P(x))  Q", 

152 
"(EX x. P  Q(x)) <> P  (EX x. Q(x))"]); 

4349
50403e5a44c0
Instantiated the onepointrule quantifier simpprocs for FOL
paulson
parents:
4325
diff
changeset

153 

50403e5a44c0
Instantiated the onepointrule quantifier simpprocs for FOL
paulson
parents:
4325
diff
changeset

154 
(*classical rules*) 
12038  155 
bind_thms ("cla_ex_simps", map prove_fun 
156 
["(EX x. P(x) > Q) <> (ALL x. P(x)) > Q", 

157 
"(EX x. P > Q(x)) <> P > (EX x. Q(x))"]); 

0  158 

12038  159 
bind_thms ("ex_simps", int_ex_simps @ cla_ex_simps); 
4349
50403e5a44c0
Instantiated the onepointrule quantifier simpprocs for FOL
paulson
parents:
4325
diff
changeset

160 

50403e5a44c0
Instantiated the onepointrule quantifier simpprocs for FOL
paulson
parents:
4325
diff
changeset

161 
(*universal miniscoping*) 
12038  162 
bind_thms ("int_all_simps", map int_prove_fun 
163 
["(ALL x. P(x) & Q) <> (ALL x. P(x)) & Q", 

164 
"(ALL x. P & Q(x)) <> P & (ALL x. Q(x))", 

165 
"(ALL x. P(x) > Q) <> (EX x. P(x)) > Q", 

166 
"(ALL x. P > Q(x)) <> P > (ALL x. Q(x))"]); 

1953  167 

4349
50403e5a44c0
Instantiated the onepointrule quantifier simpprocs for FOL
paulson
parents:
4325
diff
changeset

168 
(*classical rules*) 
12038  169 
bind_thms ("cla_all_simps", map prove_fun 
170 
["(ALL x. P(x)  Q) <> (ALL x. P(x))  Q", 

171 
"(ALL x. P  Q(x)) <> P  (ALL x. Q(x))"]); 

4349
50403e5a44c0
Instantiated the onepointrule quantifier simpprocs for FOL
paulson
parents:
4325
diff
changeset

172 

12038  173 
bind_thms ("all_simps", int_all_simps @ cla_all_simps); 
4349
50403e5a44c0
Instantiated the onepointrule quantifier simpprocs for FOL
paulson
parents:
4325
diff
changeset

174 

50403e5a44c0
Instantiated the onepointrule quantifier simpprocs for FOL
paulson
parents:
4325
diff
changeset

175 

50403e5a44c0
Instantiated the onepointrule quantifier simpprocs for FOL
paulson
parents:
4325
diff
changeset

176 
(*** Named rewrite rules proved for IFOL ***) 
1953  177 

1914  178 
fun int_prove nm thm = qed_goal nm IFOL.thy thm 
10431  179 
(fn prems => [ (cut_facts_tac prems 1), 
2601
b301958c465d
Renamed structure Int (intuitionistic prover) to IntPr to prevent clash
paulson
parents:
2469
diff
changeset

180 
(IntPr.fast_tac 1) ]); 
1914  181 

7355
4c43090659ca
proper bootstrap of IFOL/FOL theories and packages;
wenzelm
parents:
6391
diff
changeset

182 
fun prove nm thm = qed_goal nm (the_context ()) thm (fn _ => [Blast_tac 1]); 
1914  183 

184 
int_prove "conj_commute" "P&Q <> Q&P"; 

185 
int_prove "conj_left_commute" "P&(Q&R) <> Q&(P&R)"; 

12038  186 
bind_thms ("conj_comms", [conj_commute, conj_left_commute]); 
1914  187 

188 
int_prove "disj_commute" "PQ <> QP"; 

189 
int_prove "disj_left_commute" "P(QR) <> Q(PR)"; 

12038  190 
bind_thms ("disj_comms", [disj_commute, disj_left_commute]); 
1914  191 

192 
int_prove "conj_disj_distribL" "P&(QR) <> (P&Q  P&R)"; 

193 
int_prove "conj_disj_distribR" "(PQ)&R <> (P&R  Q&R)"; 

194 

195 
int_prove "disj_conj_distribL" "P(Q&R) <> (PQ) & (PR)"; 

196 
int_prove "disj_conj_distribR" "(P&Q)R <> (PR) & (QR)"; 

197 

198 
int_prove "imp_conj_distrib" "(P > (Q&R)) <> (P>Q) & (P>R)"; 

199 
int_prove "imp_conj" "((P&Q)>R) <> (P > (Q > R))"; 

200 
int_prove "imp_disj" "(PQ > R) <> (P>R) & (Q>R)"; 

201 

3910  202 
prove "imp_disj1" "(P>Q)  R <> (P>Q  R)"; 
203 
prove "imp_disj2" "Q  (P>R) <> (P>Q  R)"; 

204 

1914  205 
int_prove "de_Morgan_disj" "(~(P  Q)) <> (~P & ~Q)"; 
206 
prove "de_Morgan_conj" "(~(P & Q)) <> (~P  ~Q)"; 

207 

208 
prove "not_iff" "~(P <> Q) <> (P <> ~Q)"; 

209 

3835  210 
prove "not_all" "(~ (ALL x. P(x))) <> (EX x.~P(x))"; 
211 
prove "imp_all" "((ALL x. P(x)) > Q) <> (EX x. P(x) > Q)"; 

212 
int_prove "not_ex" "(~ (EX x. P(x))) <> (ALL x.~P(x))"; 

1914  213 
int_prove "imp_ex" "((EX x. P(x)) > Q) <> (ALL x. P(x) > Q)"; 
214 

215 
int_prove "ex_disj_distrib" 

216 
"(EX x. P(x)  Q(x)) <> ((EX x. P(x))  (EX x. Q(x)))"; 

217 
int_prove "all_conj_distrib" 

218 
"(ALL x. P(x) & Q(x)) <> ((ALL x. P(x)) & (ALL x. Q(x)))"; 

219 

220 

11232  221 
local 
222 
val uncurry = prove_goal (the_context()) "P > Q > R ==> P & Q > R" 

223 
(fn prems => [cut_facts_tac prems 1, Blast_tac 1]); 

224 

225 
val iff_allI = allI RS 

226 
prove_goal (the_context()) "ALL x. P(x) <> Q(x) ==> (ALL x. P(x)) <> (ALL x. Q(x))" 

227 
(fn prems => [cut_facts_tac prems 1, Blast_tac 1]) 

12526
1b9db2581fe2
mods due to changed 1point simprocs (quantifier1).
nipkow
parents:
12038
diff
changeset

228 
val iff_exI = allI RS 
1b9db2581fe2
mods due to changed 1point simprocs (quantifier1).
nipkow
parents:
12038
diff
changeset

229 
prove_goal (the_context()) "ALL x. P(x) <> Q(x) ==> (EX x. P(x)) <> (EX x. Q(x))" 
1b9db2581fe2
mods due to changed 1point simprocs (quantifier1).
nipkow
parents:
12038
diff
changeset

230 
(fn prems => [cut_facts_tac prems 1, Blast_tac 1]) 
1b9db2581fe2
mods due to changed 1point simprocs (quantifier1).
nipkow
parents:
12038
diff
changeset

231 

1b9db2581fe2
mods due to changed 1point simprocs (quantifier1).
nipkow
parents:
12038
diff
changeset

232 
val all_comm = prove_goal (the_context()) "(ALL x y. P(x,y)) <> (ALL y x. P(x,y))" 
1b9db2581fe2
mods due to changed 1point simprocs (quantifier1).
nipkow
parents:
12038
diff
changeset

233 
(fn _ => [Blast_tac 1]) 
1b9db2581fe2
mods due to changed 1point simprocs (quantifier1).
nipkow
parents:
12038
diff
changeset

234 
val ex_comm = prove_goal (the_context()) "(EX x y. P(x,y)) <> (EX y x. P(x,y))" 
1b9db2581fe2
mods due to changed 1point simprocs (quantifier1).
nipkow
parents:
12038
diff
changeset

235 
(fn _ => [Blast_tac 1]) 
11232  236 
in 
237 

4349
50403e5a44c0
Instantiated the onepointrule quantifier simpprocs for FOL
paulson
parents:
4325
diff
changeset

238 
(** make simplification procedures for quantifier elimination **) 
50403e5a44c0
Instantiated the onepointrule quantifier simpprocs for FOL
paulson
parents:
4325
diff
changeset

239 
structure Quantifier1 = Quantifier1Fun( 
50403e5a44c0
Instantiated the onepointrule quantifier simpprocs for FOL
paulson
parents:
4325
diff
changeset

240 
struct 
50403e5a44c0
Instantiated the onepointrule quantifier simpprocs for FOL
paulson
parents:
4325
diff
changeset

241 
(*abstract syntax*) 
50403e5a44c0
Instantiated the onepointrule quantifier simpprocs for FOL
paulson
parents:
4325
diff
changeset

242 
fun dest_eq((c as Const("op =",_)) $ s $ t) = Some(c,s,t) 
50403e5a44c0
Instantiated the onepointrule quantifier simpprocs for FOL
paulson
parents:
4325
diff
changeset

243 
 dest_eq _ = None; 
50403e5a44c0
Instantiated the onepointrule quantifier simpprocs for FOL
paulson
parents:
4325
diff
changeset

244 
fun dest_conj((c as Const("op &",_)) $ s $ t) = Some(c,s,t) 
50403e5a44c0
Instantiated the onepointrule quantifier simpprocs for FOL
paulson
parents:
4325
diff
changeset

245 
 dest_conj _ = None; 
11232  246 
fun dest_imp((c as Const("op >",_)) $ s $ t) = Some(c,s,t) 
247 
 dest_imp _ = None; 

4349
50403e5a44c0
Instantiated the onepointrule quantifier simpprocs for FOL
paulson
parents:
4325
diff
changeset

248 
val conj = FOLogic.conj 
50403e5a44c0
Instantiated the onepointrule quantifier simpprocs for FOL
paulson
parents:
4325
diff
changeset

249 
val imp = FOLogic.imp 
50403e5a44c0
Instantiated the onepointrule quantifier simpprocs for FOL
paulson
parents:
4325
diff
changeset

250 
(*rules*) 
50403e5a44c0
Instantiated the onepointrule quantifier simpprocs for FOL
paulson
parents:
4325
diff
changeset

251 
val iff_reflection = iff_reflection 
50403e5a44c0
Instantiated the onepointrule quantifier simpprocs for FOL
paulson
parents:
4325
diff
changeset

252 
val iffI = iffI 
12526
1b9db2581fe2
mods due to changed 1point simprocs (quantifier1).
nipkow
parents:
12038
diff
changeset

253 
val iff_trans = iff_trans 
4349
50403e5a44c0
Instantiated the onepointrule quantifier simpprocs for FOL
paulson
parents:
4325
diff
changeset

254 
val conjI= conjI 
50403e5a44c0
Instantiated the onepointrule quantifier simpprocs for FOL
paulson
parents:
4325
diff
changeset

255 
val conjE= conjE 
50403e5a44c0
Instantiated the onepointrule quantifier simpprocs for FOL
paulson
parents:
4325
diff
changeset

256 
val impI = impI 
50403e5a44c0
Instantiated the onepointrule quantifier simpprocs for FOL
paulson
parents:
4325
diff
changeset

257 
val mp = mp 
11232  258 
val uncurry = uncurry 
4349
50403e5a44c0
Instantiated the onepointrule quantifier simpprocs for FOL
paulson
parents:
4325
diff
changeset

259 
val exI = exI 
50403e5a44c0
Instantiated the onepointrule quantifier simpprocs for FOL
paulson
parents:
4325
diff
changeset

260 
val exE = exE 
11232  261 
val iff_allI = iff_allI 
12526
1b9db2581fe2
mods due to changed 1point simprocs (quantifier1).
nipkow
parents:
12038
diff
changeset

262 
val iff_exI = iff_exI 
1b9db2581fe2
mods due to changed 1point simprocs (quantifier1).
nipkow
parents:
12038
diff
changeset

263 
val all_comm = all_comm 
1b9db2581fe2
mods due to changed 1point simprocs (quantifier1).
nipkow
parents:
12038
diff
changeset

264 
val ex_comm = ex_comm 
4349
50403e5a44c0
Instantiated the onepointrule quantifier simpprocs for FOL
paulson
parents:
4325
diff
changeset

265 
end); 
50403e5a44c0
Instantiated the onepointrule quantifier simpprocs for FOL
paulson
parents:
4325
diff
changeset

266 

11232  267 
end; 
268 

4349
50403e5a44c0
Instantiated the onepointrule quantifier simpprocs for FOL
paulson
parents:
4325
diff
changeset

269 
local 
7355
4c43090659ca
proper bootstrap of IFOL/FOL theories and packages;
wenzelm
parents:
6391
diff
changeset

270 

4349
50403e5a44c0
Instantiated the onepointrule quantifier simpprocs for FOL
paulson
parents:
4325
diff
changeset

271 
val ex_pattern = 
12526
1b9db2581fe2
mods due to changed 1point simprocs (quantifier1).
nipkow
parents:
12038
diff
changeset

272 
read_cterm (Theory.sign_of (the_context ())) ("EX x. P(x)", FOLogic.oT) 
4349
50403e5a44c0
Instantiated the onepointrule quantifier simpprocs for FOL
paulson
parents:
4325
diff
changeset

273 

50403e5a44c0
Instantiated the onepointrule quantifier simpprocs for FOL
paulson
parents:
4325
diff
changeset

274 
val all_pattern = 
12526
1b9db2581fe2
mods due to changed 1point simprocs (quantifier1).
nipkow
parents:
12038
diff
changeset

275 
read_cterm (Theory.sign_of (the_context ())) ("ALL x. P(x)", FOLogic.oT) 
4349
50403e5a44c0
Instantiated the onepointrule quantifier simpprocs for FOL
paulson
parents:
4325
diff
changeset

276 

50403e5a44c0
Instantiated the onepointrule quantifier simpprocs for FOL
paulson
parents:
4325
diff
changeset

277 
in 
50403e5a44c0
Instantiated the onepointrule quantifier simpprocs for FOL
paulson
parents:
4325
diff
changeset

278 
val defEX_regroup = 
50403e5a44c0
Instantiated the onepointrule quantifier simpprocs for FOL
paulson
parents:
4325
diff
changeset

279 
mk_simproc "defined EX" [ex_pattern] Quantifier1.rearrange_ex; 
50403e5a44c0
Instantiated the onepointrule quantifier simpprocs for FOL
paulson
parents:
4325
diff
changeset

280 
val defALL_regroup = 
50403e5a44c0
Instantiated the onepointrule quantifier simpprocs for FOL
paulson
parents:
4325
diff
changeset

281 
mk_simproc "defined ALL" [all_pattern] Quantifier1.rearrange_all; 
50403e5a44c0
Instantiated the onepointrule quantifier simpprocs for FOL
paulson
parents:
4325
diff
changeset

282 
end; 
50403e5a44c0
Instantiated the onepointrule quantifier simpprocs for FOL
paulson
parents:
4325
diff
changeset

283 

50403e5a44c0
Instantiated the onepointrule quantifier simpprocs for FOL
paulson
parents:
4325
diff
changeset

284 

50403e5a44c0
Instantiated the onepointrule quantifier simpprocs for FOL
paulson
parents:
4325
diff
changeset

285 
(*** Case splitting ***) 
0  286 

12038  287 
bind_thm ("meta_eq_to_iff", prove_goal IFOL.thy "x==y ==> x<>y" 
288 
(fn [prem] => [rewtac prem, rtac iffI 1, atac 1, atac 1])); 

1722  289 

5304  290 
structure SplitterData = 
291 
struct 

292 
structure Simplifier = Simplifier 

5555  293 
val mk_eq = mk_eq 
5304  294 
val meta_eq_to_iff = meta_eq_to_iff 
295 
val iffD = iffD2 

296 
val disjE = disjE 

297 
val conjE = conjE 

298 
val exE = exE 

299 
val contrapos = contrapos 

300 
val contrapos2 = contrapos2 

301 
val notnotD = notnotD 

302 
end; 

1722  303 

5304  304 
structure Splitter = SplitterFun(SplitterData); 
1722  305 

5304  306 
val split_tac = Splitter.split_tac; 
307 
val split_inside_tac = Splitter.split_inside_tac; 

308 
val split_asm_tac = Splitter.split_asm_tac; 

5307  309 
val op addsplits = Splitter.addsplits; 
310 
val op delsplits = Splitter.delsplits; 

5304  311 
val Addsplits = Splitter.Addsplits; 
312 
val Delsplits = Splitter.Delsplits; 

4325  313 

314 

2074
30a65172e003
Added the de Morgan laws (incl quantifier versions) to basic simpset
paulson
parents:
2065
diff
changeset

315 
(*** Standard simpsets ***) 
30a65172e003
Added the de Morgan laws (incl quantifier versions) to basic simpset
paulson
parents:
2065
diff
changeset

316 

30a65172e003
Added the de Morgan laws (incl quantifier versions) to basic simpset
paulson
parents:
2065
diff
changeset

317 
structure Induction = InductionFun(struct val spec=IFOL.spec end); 
30a65172e003
Added the de Morgan laws (incl quantifier versions) to basic simpset
paulson
parents:
2065
diff
changeset

318 

4349
50403e5a44c0
Instantiated the onepointrule quantifier simpprocs for FOL
paulson
parents:
4325
diff
changeset

319 
open Induction; 
2074
30a65172e003
Added the de Morgan laws (incl quantifier versions) to basic simpset
paulson
parents:
2065
diff
changeset

320 

5555  321 

12038  322 
bind_thms ("meta_simps", 
323 
[triv_forall_equality, (* prunes params *) 

324 
True_implies_equals]); (* prune asms `True' *) 

5496  325 

12038  326 
bind_thms ("IFOL_simps", 
327 
[refl RS P_iff_T] @ conj_simps @ disj_simps @ not_simps @ 

328 
imp_simps @ iff_simps @ quant_simps); 

2074
30a65172e003
Added the de Morgan laws (incl quantifier versions) to basic simpset
paulson
parents:
2065
diff
changeset

329 

12038  330 
bind_thm ("notFalseI", int_prove_fun "~False"); 
331 
bind_thms ("triv_rls", [TrueI,refl,reflexive_thm,iff_refl,notFalseI]); 

2074
30a65172e003
Added the de Morgan laws (incl quantifier versions) to basic simpset
paulson
parents:
2065
diff
changeset

332 

2633
37c0b5a7ee5d
added delcongs, Delcongs, unsafe_solver, safe_solver, FOL_basic_ss,
oheimb
parents:
2601
diff
changeset

333 
fun unsafe_solver prems = FIRST'[resolve_tac (triv_rls@prems), 
9713  334 
atac, etac FalseE]; 
2633
37c0b5a7ee5d
added delcongs, Delcongs, unsafe_solver, safe_solver, FOL_basic_ss,
oheimb
parents:
2601
diff
changeset

335 
(*No premature instantiation of variables during simplification*) 
37c0b5a7ee5d
added delcongs, Delcongs, unsafe_solver, safe_solver, FOL_basic_ss,
oheimb
parents:
2601
diff
changeset

336 
fun safe_solver prems = FIRST'[match_tac (triv_rls@prems), 
9713  337 
eq_assume_tac, ematch_tac [FalseE]]; 
2633
37c0b5a7ee5d
added delcongs, Delcongs, unsafe_solver, safe_solver, FOL_basic_ss,
oheimb
parents:
2601
diff
changeset

338 

3910  339 
(*No simprules, but basic infastructure for simplification*) 
10431  340 
val FOL_basic_ss = empty_ss 
341 
setsubgoaler asm_simp_tac 

342 
setSSolver (mk_solver "FOL safe" safe_solver) 

343 
setSolver (mk_solver "FOL unsafe" unsafe_solver) 

344 
setmksimps (mksimps mksimps_pairs) 

345 
setmkcong mk_meta_cong; 

5304  346 

2633
37c0b5a7ee5d
added delcongs, Delcongs, unsafe_solver, safe_solver, FOL_basic_ss,
oheimb
parents:
2601
diff
changeset

347 

3910  348 
(*intuitionistic simprules only*) 
10431  349 
val IFOL_ss = FOL_basic_ss 
350 
addsimps (meta_simps @ IFOL_simps @ int_ex_simps @ int_all_simps) 

351 
addsimprocs [defALL_regroup, defEX_regroup] 

352 
addcongs [imp_cong]; 

2074
30a65172e003
Added the de Morgan laws (incl quantifier versions) to basic simpset
paulson
parents:
2065
diff
changeset

353 

12038  354 
bind_thms ("cla_simps", 
355 
[de_Morgan_conj, de_Morgan_disj, imp_disj1, imp_disj2, 

356 
not_all, not_ex, cases_simp] @ 

357 
map prove_fun 

358 
["~(P&Q) <> ~P  ~Q", 

359 
"P  ~P", "~P  P", 

360 
"~ ~ P <> P", "(~P > P) <> P", 

361 
"(~P <> ~Q) <> (P<>Q)"]); 

2074
30a65172e003
Added the de Morgan laws (incl quantifier versions) to basic simpset
paulson
parents:
2065
diff
changeset

362 

3910  363 
(*classical simprules too*) 
4349
50403e5a44c0
Instantiated the onepointrule quantifier simpprocs for FOL
paulson
parents:
4325
diff
changeset

364 
val FOL_ss = IFOL_ss addsimps (cla_simps @ cla_ex_simps @ cla_all_simps); 
2074
30a65172e003
Added the de Morgan laws (incl quantifier versions) to basic simpset
paulson
parents:
2065
diff
changeset

365 

7355
4c43090659ca
proper bootstrap of IFOL/FOL theories and packages;
wenzelm
parents:
6391
diff
changeset

366 
val simpsetup = [fn thy => (simpset_ref_of thy := FOL_ss; thy)]; 
2633
37c0b5a7ee5d
added delcongs, Delcongs, unsafe_solver, safe_solver, FOL_basic_ss,
oheimb
parents:
2601
diff
changeset

367 

37c0b5a7ee5d
added delcongs, Delcongs, unsafe_solver, safe_solver, FOL_basic_ss,
oheimb
parents:
2601
diff
changeset

368 

5219  369 
(*** integration of simplifier with classical reasoner ***) 
2633
37c0b5a7ee5d
added delcongs, Delcongs, unsafe_solver, safe_solver, FOL_basic_ss,
oheimb
parents:
2601
diff
changeset

370 

5219  371 
structure Clasimp = ClasimpFun 
8472  372 
(structure Simplifier = Simplifier and Splitter = Splitter 
9851  373 
and Classical = Cla and Blast = Blast 
11344  374 
val iffD1 = iffD1 val iffD2 = iffD2 val notE = notE 
9851  375 
val cla_make_elim = cla_make_elim); 
4652
d24cca140eeb
factored out common code of HOL/simpdata.ML and FOL/simpdata.ML concerning
oheimb
parents:
4649
diff
changeset

376 
open Clasimp; 
2633
37c0b5a7ee5d
added delcongs, Delcongs, unsafe_solver, safe_solver, FOL_basic_ss,
oheimb
parents:
2601
diff
changeset

377 

37c0b5a7ee5d
added delcongs, Delcongs, unsafe_solver, safe_solver, FOL_basic_ss,
oheimb
parents:
2601
diff
changeset

378 
val FOL_css = (FOL_cs, FOL_ss); 