author | paulson |
Mon, 09 Sep 1996 10:59:32 +0200 | |
changeset 1961 | d33a5d59a29a |
parent 1953 | 832ccc1dba95 |
child 2065 | b696f087f052 |
permissions | -rw-r--r-- |
1459 | 1 |
(* Title: FOL/simpdata |
0 | 2 |
ID: $Id$ |
1459 | 3 |
Author: Lawrence C Paulson, Cambridge University Computer Laboratory |
282 | 4 |
Copyright 1994 University of Cambridge |
0 | 5 |
|
6 |
Simplification data for FOL |
|
7 |
*) |
|
8 |
||
9 |
(*** Rewrite rules ***) |
|
10 |
||
11 |
fun int_prove_fun s = |
|
282 | 12 |
(writeln s; |
13 |
prove_goal IFOL.thy s |
|
14 |
(fn prems => [ (cut_facts_tac prems 1), |
|
1459 | 15 |
(Int.fast_tac 1) ])); |
0 | 16 |
|
1953 | 17 |
val conj_simps = map int_prove_fun |
1459 | 18 |
["P & True <-> P", "True & P <-> P", |
0 | 19 |
"P & False <-> False", "False & P <-> False", |
20 |
"P & P <-> P", |
|
1459 | 21 |
"P & ~P <-> False", "~P & P <-> False", |
0 | 22 |
"(P & Q) & R <-> P & (Q & R)"]; |
23 |
||
1953 | 24 |
val disj_simps = map int_prove_fun |
1459 | 25 |
["P | True <-> True", "True | P <-> True", |
26 |
"P | False <-> P", "False | P <-> P", |
|
0 | 27 |
"P | P <-> P", |
28 |
"(P | Q) | R <-> P | (Q | R)"]; |
|
29 |
||
1953 | 30 |
val not_simps = map int_prove_fun |
282 | 31 |
["~(P|Q) <-> ~P & ~Q", |
1459 | 32 |
"~ False <-> True", "~ True <-> False"]; |
0 | 33 |
|
1953 | 34 |
val imp_simps = map int_prove_fun |
1459 | 35 |
["(P --> False) <-> ~P", "(P --> True) <-> True", |
36 |
"(False --> P) <-> True", "(True --> P) <-> P", |
|
37 |
"(P --> P) <-> True", "(P --> ~P) <-> ~P"]; |
|
0 | 38 |
|
1953 | 39 |
val iff_simps = map int_prove_fun |
1459 | 40 |
["(True <-> P) <-> P", "(P <-> True) <-> P", |
0 | 41 |
"(P <-> P) <-> True", |
1459 | 42 |
"(False <-> P) <-> ~P", "(P <-> False) <-> ~P"]; |
0 | 43 |
|
1953 | 44 |
val quant_simps = map int_prove_fun |
1459 | 45 |
["(ALL x.P) <-> P", "(EX x.P) <-> P"]; |
0 | 46 |
|
47 |
(*These are NOT supplied by default!*) |
|
1953 | 48 |
val distrib_simps = map int_prove_fun |
282 | 49 |
["P & (Q | R) <-> P&Q | P&R", |
50 |
"(Q | R) & P <-> Q&P | R&P", |
|
0 | 51 |
"(P | Q --> R) <-> (P --> R) & (Q --> R)"]; |
52 |
||
282 | 53 |
(** Conversion into rewrite rules **) |
0 | 54 |
|
53 | 55 |
fun gen_all th = forall_elim_vars (#maxidx(rep_thm th)+1) th; |
56 |
||
282 | 57 |
(*Make atomic rewrite rules*) |
429
888bbb4119f8
atomize: borrowed HOL version, which checks for both Trueprop
lcp
parents:
394
diff
changeset
|
58 |
fun atomize r = |
888bbb4119f8
atomize: borrowed HOL version, which checks for both Trueprop
lcp
parents:
394
diff
changeset
|
59 |
case concl_of r of |
888bbb4119f8
atomize: borrowed HOL version, which checks for both Trueprop
lcp
parents:
394
diff
changeset
|
60 |
Const("Trueprop",_) $ p => |
888bbb4119f8
atomize: borrowed HOL version, which checks for both Trueprop
lcp
parents:
394
diff
changeset
|
61 |
(case p of |
1459 | 62 |
Const("op -->",_)$_$_ => atomize(r RS mp) |
429
888bbb4119f8
atomize: borrowed HOL version, which checks for both Trueprop
lcp
parents:
394
diff
changeset
|
63 |
| Const("op &",_)$_$_ => atomize(r RS conjunct1) @ |
1459 | 64 |
atomize(r RS conjunct2) |
429
888bbb4119f8
atomize: borrowed HOL version, which checks for both Trueprop
lcp
parents:
394
diff
changeset
|
65 |
| Const("All",_)$_ => atomize(r RS spec) |
1459 | 66 |
| Const("True",_) => [] (*True is DELETED*) |
67 |
| Const("False",_) => [] (*should False do something?*) |
|
429
888bbb4119f8
atomize: borrowed HOL version, which checks for both Trueprop
lcp
parents:
394
diff
changeset
|
68 |
| _ => [r]) |
888bbb4119f8
atomize: borrowed HOL version, which checks for both Trueprop
lcp
parents:
394
diff
changeset
|
69 |
| _ => [r]; |
888bbb4119f8
atomize: borrowed HOL version, which checks for both Trueprop
lcp
parents:
394
diff
changeset
|
70 |
|
282 | 71 |
|
72 |
val P_iff_F = int_prove_fun "~P ==> (P <-> False)"; |
|
73 |
val iff_reflection_F = P_iff_F RS iff_reflection; |
|
74 |
||
75 |
val P_iff_T = int_prove_fun "P ==> (P <-> True)"; |
|
76 |
val iff_reflection_T = P_iff_T RS iff_reflection; |
|
77 |
||
78 |
(*Make meta-equalities. The operator below is Trueprop*) |
|
79 |
fun mk_meta_eq th = case concl_of th of |
|
394
432bb9995893
Modified mk_meta_eq to leave meta-equlities on unchanged.
nipkow
parents:
371
diff
changeset
|
80 |
Const("==",_)$_$_ => th |
432bb9995893
Modified mk_meta_eq to leave meta-equlities on unchanged.
nipkow
parents:
371
diff
changeset
|
81 |
| _ $ (Const("op =",_)$_$_) => th RS eq_reflection |
282 | 82 |
| _ $ (Const("op <->",_)$_$_) => th RS iff_reflection |
83 |
| _ $ (Const("Not",_)$_) => th RS iff_reflection_F |
|
84 |
| _ => th RS iff_reflection_T; |
|
0 | 85 |
|
86 |
structure Induction = InductionFun(struct val spec=IFOL.spec end); |
|
87 |
||
88 |
open Simplifier Induction; |
|
89 |
||
981 | 90 |
(*Add congruence rules for = or <-> (instead of ==) *) |
91 |
infix 4 addcongs; |
|
3 | 92 |
fun ss addcongs congs = |
282 | 93 |
ss addeqcongs (congs RL [eq_reflection,iff_reflection]); |
94 |
||
981 | 95 |
(*Add a simpset to a classical set!*) |
96 |
infix 4 addss; |
|
97 |
fun cs addss ss = cs addbefore asm_full_simp_tac ss 1; |
|
98 |
||
99 |
||
1953 | 100 |
val IFOL_simps = |
101 |
[refl RS P_iff_T] @ conj_simps @ disj_simps @ not_simps @ |
|
102 |
imp_simps @ iff_simps @ quant_simps; |
|
3 | 103 |
|
282 | 104 |
val notFalseI = int_prove_fun "~False"; |
105 |
val triv_rls = [TrueI,refl,iff_refl,notFalseI]; |
|
106 |
||
107 |
val IFOL_ss = |
|
108 |
empty_ss |
|
109 |
setmksimps (map mk_meta_eq o atomize o gen_all) |
|
371
3a853818f1d2
FOL/simpdata: added etac FalseE in setsolver call. Toby: "now that the
lcp
parents:
282
diff
changeset
|
110 |
setsolver (fn prems => resolve_tac (triv_rls@prems) |
1459 | 111 |
ORELSE' assume_tac |
112 |
ORELSE' etac FalseE) |
|
282 | 113 |
setsubgoaler asm_simp_tac |
1953 | 114 |
addsimps IFOL_simps |
282 | 115 |
addcongs [imp_cong]; |
0 | 116 |
|
117 |
(*Classical version...*) |
|
118 |
fun prove_fun s = |
|
282 | 119 |
(writeln s; |
120 |
prove_goal FOL.thy s |
|
121 |
(fn prems => [ (cut_facts_tac prems 1), |
|
1459 | 122 |
(Cla.fast_tac FOL_cs 1) ])); |
745 | 123 |
|
1953 | 124 |
(*Avoids duplication of subgoals after expand_if, when the true and false |
125 |
cases boil down to the same thing.*) |
|
126 |
val cases_simp = prove_fun "(P --> Q) & (~P --> Q) <-> Q"; |
|
127 |
||
128 |
val cla_simps = |
|
129 |
cases_simp:: |
|
130 |
map prove_fun |
|
131 |
["~(P&Q) <-> ~P | ~Q", |
|
132 |
"P | ~P", "~P | P", |
|
133 |
"~ ~ P <-> P", "(~P --> P) <-> P", |
|
134 |
"(~P <-> ~Q) <-> (P<->Q)"]; |
|
135 |
||
136 |
(*At present, miniscoping is for classical logic only. We do NOT include |
|
137 |
distribution of ALL over &, or dually that of EX over |.*) |
|
0 | 138 |
|
1953 | 139 |
(*Miniscoping: pushing in existential quantifiers*) |
140 |
val ex_simps = map prove_fun |
|
1961 | 141 |
["(EX x. P(x) & Q) <-> (EX x.P(x)) & Q", |
1953 | 142 |
"(EX x. P & Q(x)) <-> P & (EX x.Q(x))", |
143 |
"(EX x. P(x) | Q) <-> (EX x.P(x)) | Q", |
|
144 |
"(EX x. P | Q(x)) <-> P | (EX x.Q(x))", |
|
145 |
"(EX x. P(x) --> Q) <-> (ALL x.P(x)) --> Q", |
|
146 |
"(EX x. P --> Q(x)) <-> P --> (EX x.Q(x))"]; |
|
147 |
||
148 |
(*Miniscoping: pushing in universal quantifiers*) |
|
149 |
val all_simps = map prove_fun |
|
1961 | 150 |
["(ALL x. P(x) & Q) <-> (ALL x.P(x)) & Q", |
1953 | 151 |
"(ALL x. P & Q(x)) <-> P & (ALL x.Q(x))", |
152 |
"(ALL x. P(x) | Q) <-> (ALL x.P(x)) | Q", |
|
153 |
"(ALL x. P | Q(x)) <-> P | (ALL x.Q(x))", |
|
154 |
"(ALL x. P(x) --> Q) <-> (EX x.P(x)) --> Q", |
|
155 |
"(ALL x. P --> Q(x)) <-> P --> (ALL x.Q(x))"]; |
|
156 |
||
157 |
val FOL_ss = IFOL_ss addsimps (cla_simps @ ex_simps @ all_simps); |
|
0 | 158 |
|
1914 | 159 |
fun int_prove nm thm = qed_goal nm IFOL.thy thm |
160 |
(fn prems => [ (cut_facts_tac prems 1), |
|
161 |
(Int.fast_tac 1) ]); |
|
162 |
||
163 |
fun prove nm thm = qed_goal nm FOL.thy thm (fn _ => [fast_tac FOL_cs 1]); |
|
164 |
||
165 |
int_prove "conj_commute" "P&Q <-> Q&P"; |
|
166 |
int_prove "conj_left_commute" "P&(Q&R) <-> Q&(P&R)"; |
|
167 |
val conj_comms = [conj_commute, conj_left_commute]; |
|
168 |
||
169 |
int_prove "disj_commute" "P|Q <-> Q|P"; |
|
170 |
int_prove "disj_left_commute" "P|(Q|R) <-> Q|(P|R)"; |
|
171 |
val disj_comms = [disj_commute, disj_left_commute]; |
|
172 |
||
173 |
int_prove "conj_disj_distribL" "P&(Q|R) <-> (P&Q | P&R)"; |
|
174 |
int_prove "conj_disj_distribR" "(P|Q)&R <-> (P&R | Q&R)"; |
|
175 |
||
176 |
int_prove "disj_conj_distribL" "P|(Q&R) <-> (P|Q) & (P|R)"; |
|
177 |
int_prove "disj_conj_distribR" "(P&Q)|R <-> (P|R) & (Q|R)"; |
|
178 |
||
179 |
int_prove "imp_conj_distrib" "(P --> (Q&R)) <-> (P-->Q) & (P-->R)"; |
|
180 |
int_prove "imp_conj" "((P&Q)-->R) <-> (P --> (Q --> R))"; |
|
181 |
int_prove "imp_disj" "(P|Q --> R) <-> (P-->R) & (Q-->R)"; |
|
182 |
||
183 |
int_prove "de_Morgan_disj" "(~(P | Q)) <-> (~P & ~Q)"; |
|
184 |
prove "de_Morgan_conj" "(~(P & Q)) <-> (~P | ~Q)"; |
|
185 |
||
186 |
prove "not_iff" "~(P <-> Q) <-> (P <-> ~Q)"; |
|
187 |
||
188 |
prove "not_all" "(~ (ALL x.P(x))) <-> (EX x.~P(x))"; |
|
189 |
prove "imp_all" "((ALL x.P(x)) --> Q) <-> (EX x.P(x) --> Q)"; |
|
190 |
int_prove "not_ex" "(~ (EX x.P(x))) <-> (ALL x.~P(x))"; |
|
191 |
int_prove "imp_ex" "((EX x. P(x)) --> Q) <-> (ALL x. P(x) --> Q)"; |
|
192 |
||
193 |
int_prove "ex_disj_distrib" |
|
194 |
"(EX x. P(x) | Q(x)) <-> ((EX x. P(x)) | (EX x. Q(x)))"; |
|
195 |
int_prove "all_conj_distrib" |
|
196 |
"(ALL x. P(x) & Q(x)) <-> ((ALL x. P(x)) & (ALL x. Q(x)))"; |
|
197 |
||
198 |
||
1088
fc4fb6e8a636
Imported meta_eq_to_obj_eq from HOL for use with 'split'.
lcp
parents:
981
diff
changeset
|
199 |
(*Used in ZF, perhaps elsewhere?*) |
fc4fb6e8a636
Imported meta_eq_to_obj_eq from HOL for use with 'split'.
lcp
parents:
981
diff
changeset
|
200 |
val meta_eq_to_obj_eq = prove_goal IFOL.thy "x==y ==> x=y" |
fc4fb6e8a636
Imported meta_eq_to_obj_eq from HOL for use with 'split'.
lcp
parents:
981
diff
changeset
|
201 |
(fn [prem] => [rewtac prem, rtac refl 1]); |
fc4fb6e8a636
Imported meta_eq_to_obj_eq from HOL for use with 'split'.
lcp
parents:
981
diff
changeset
|
202 |
|
0 | 203 |
(*** case splitting ***) |
204 |
||
1088
fc4fb6e8a636
Imported meta_eq_to_obj_eq from HOL for use with 'split'.
lcp
parents:
981
diff
changeset
|
205 |
qed_goal "meta_iffD" IFOL.thy "[| P==Q; Q |] ==> P" |
756 | 206 |
(fn [prem1,prem2] => [rewtac prem1, rtac prem2 1]); |
282 | 207 |
|
942 | 208 |
local val mktac = mk_case_split_tac meta_iffD |
209 |
in |
|
210 |
fun split_tac splits = mktac (map mk_meta_eq splits) |
|
211 |
end; |
|
1722 | 212 |
|
213 |
local val mktac = mk_case_split_inside_tac meta_iffD |
|
214 |
in |
|
215 |
fun split_inside_tac splits = mktac (map mk_meta_eq splits) |
|
216 |
end; |
|
217 |
||
218 |