author | paulson |
Thu, 29 Apr 1999 10:51:58 +0200 | |
changeset 6536 | 281d44905cab |
parent 6295 | 351b3c2b0d83 |
child 6564 | c09997086ca7 |
permissions | -rw-r--r-- |
4776 | 1 |
(* Title: HOL/UNITY/SubstAx |
2 |
ID: $Id$ |
|
3 |
Author: Lawrence C Paulson, Cambridge University Computer Laboratory |
|
4 |
Copyright 1998 University of Cambridge |
|
5 |
||
5277
e4297d03e5d2
A higher-level treatment of LeadsTo, minimizing use of "reachable"
paulson
parents:
5257
diff
changeset
|
6 |
LeadsTo relation, restricted to the set of reachable states. |
4776 | 7 |
*) |
8 |
||
6536 | 9 |
overload_1st_set "SubstAx.op LeadsTo"; |
5277
e4297d03e5d2
A higher-level treatment of LeadsTo, minimizing use of "reachable"
paulson
parents:
5257
diff
changeset
|
10 |
|
4776 | 11 |
|
5277
e4297d03e5d2
A higher-level treatment of LeadsTo, minimizing use of "reachable"
paulson
parents:
5257
diff
changeset
|
12 |
(*** Specialized laws for handling invariants ***) |
e4297d03e5d2
A higher-level treatment of LeadsTo, minimizing use of "reachable"
paulson
parents:
5257
diff
changeset
|
13 |
|
5544 | 14 |
(** Conjoining a safety property **) |
15 |
||
6536 | 16 |
Goal "[| reachable F <= C; F : (C Int A) LeadsTo A' |] \ |
17 |
\ ==> F : A LeadsTo A'"; |
|
5277
e4297d03e5d2
A higher-level treatment of LeadsTo, minimizing use of "reachable"
paulson
parents:
5257
diff
changeset
|
18 |
by (asm_full_simp_tac |
5544 | 19 |
(simpset() addsimps [LeadsTo_def, Int_absorb2, Int_assoc RS sym]) 1); |
20 |
qed "reachable_LeadsToI"; |
|
21 |
||
6536 | 22 |
Goal "[| reachable F <= C; F : A LeadsTo A' |] \ |
23 |
\ ==> F : A LeadsTo (C Int A')"; |
|
5544 | 24 |
by (asm_full_simp_tac |
25 |
(simpset() addsimps [LeadsTo_def, Int_absorb2, |
|
5277
e4297d03e5d2
A higher-level treatment of LeadsTo, minimizing use of "reachable"
paulson
parents:
5257
diff
changeset
|
26 |
Int_assoc RS sym]) 1); |
5544 | 27 |
qed "reachable_LeadsToD"; |
28 |
||
5277
e4297d03e5d2
A higher-level treatment of LeadsTo, minimizing use of "reachable"
paulson
parents:
5257
diff
changeset
|
29 |
|
5544 | 30 |
(** Conjoining an invariant **) |
31 |
||
6536 | 32 |
(* [| Invariant F C; F : (C Int A) LeadsTo A' |] ==> F : A LeadsTo A' *) |
5544 | 33 |
bind_thm ("Invariant_LeadsToI", |
34 |
Invariant_includes_reachable RS reachable_LeadsToI); |
|
35 |
||
6536 | 36 |
(* [| Invariant F C; F : A LeadsTo A' |] ==> F : A LeadsTo (C Int A') *) |
5544 | 37 |
bind_thm ("Invariant_LeadsToD", |
38 |
Invariant_includes_reachable RS reachable_LeadsToD); |
|
39 |
||
40 |
||
5277
e4297d03e5d2
A higher-level treatment of LeadsTo, minimizing use of "reachable"
paulson
parents:
5257
diff
changeset
|
41 |
|
e4297d03e5d2
A higher-level treatment of LeadsTo, minimizing use of "reachable"
paulson
parents:
5257
diff
changeset
|
42 |
|
4776 | 43 |
(*** Introduction rules: Basis, Trans, Union ***) |
44 |
||
6536 | 45 |
Goal "F : A leadsTo B ==> F : A LeadsTo B"; |
5111 | 46 |
by (simp_tac (simpset() addsimps [LeadsTo_def]) 1); |
5277
e4297d03e5d2
A higher-level treatment of LeadsTo, minimizing use of "reachable"
paulson
parents:
5257
diff
changeset
|
47 |
by (blast_tac (claset() addIs [psp_stable2, stable_reachable]) 1); |
4776 | 48 |
qed "leadsTo_imp_LeadsTo"; |
49 |
||
6536 | 50 |
Goal "[| F : A LeadsTo B; F : B LeadsTo C |] ==> F : A LeadsTo C"; |
5111 | 51 |
by (full_simp_tac (simpset() addsimps [LeadsTo_def]) 1); |
4776 | 52 |
by (blast_tac (claset() addIs [leadsTo_Trans]) 1); |
53 |
qed "LeadsTo_Trans"; |
|
54 |
||
5648 | 55 |
val prems = Goalw [LeadsTo_def] |
6536 | 56 |
"(!!A. A : S ==> F : A LeadsTo B) ==> F : (Union S) LeadsTo B"; |
5111 | 57 |
by (Simp_tac 1); |
4776 | 58 |
by (stac Int_Union 1); |
5648 | 59 |
by (blast_tac (claset() addIs [leadsTo_UN] addDs prems) 1); |
4776 | 60 |
qed "LeadsTo_Union"; |
61 |
||
62 |
||
63 |
(*** Derived rules ***) |
|
64 |
||
6536 | 65 |
Goal "F : A LeadsTo UNIV"; |
5648 | 66 |
by (asm_simp_tac |
67 |
(simpset() addsimps [LeadsTo_def, Int_lower1 RS subset_imp_leadsTo]) 1); |
|
4776 | 68 |
qed "LeadsTo_UNIV"; |
69 |
Addsimps [LeadsTo_UNIV]; |
|
70 |
||
71 |
(*Useful with cancellation, disjunction*) |
|
6536 | 72 |
Goal "F : A LeadsTo (A' Un A') ==> F : A LeadsTo A'"; |
4776 | 73 |
by (asm_full_simp_tac (simpset() addsimps Un_ac) 1); |
74 |
qed "LeadsTo_Un_duplicate"; |
|
75 |
||
6536 | 76 |
Goal "F : A LeadsTo (A' Un C Un C) ==> F : A LeadsTo (A' Un C)"; |
4776 | 77 |
by (asm_full_simp_tac (simpset() addsimps Un_ac) 1); |
78 |
qed "LeadsTo_Un_duplicate2"; |
|
79 |
||
5277
e4297d03e5d2
A higher-level treatment of LeadsTo, minimizing use of "reachable"
paulson
parents:
5257
diff
changeset
|
80 |
val prems = |
6536 | 81 |
Goal "(!!i. i : I ==> F : (A i) LeadsTo B) ==> F : (UN i:I. A i) LeadsTo B"; |
6295
351b3c2b0d83
removed the infernal States, eqStates, compatible, etc.
paulson
parents:
5804
diff
changeset
|
82 |
by (simp_tac (HOL_ss addsimps [Union_image_eq RS sym]) 1); |
4776 | 83 |
by (blast_tac (claset() addIs (LeadsTo_Union::prems)) 1); |
84 |
qed "LeadsTo_UN"; |
|
85 |
||
86 |
(*Binary union introduction rule*) |
|
6536 | 87 |
Goal "[| F : A LeadsTo C; F : B LeadsTo C |] ==> F : (A Un B) LeadsTo C"; |
4776 | 88 |
by (stac Un_eq_Union 1); |
89 |
by (blast_tac (claset() addIs [LeadsTo_Union]) 1); |
|
90 |
qed "LeadsTo_Un"; |
|
91 |
||
6536 | 92 |
Goal "A <= B ==> F : A LeadsTo B"; |
5111 | 93 |
by (simp_tac (simpset() addsimps [LeadsTo_def]) 1); |
4776 | 94 |
by (blast_tac (claset() addIs [subset_imp_leadsTo]) 1); |
95 |
qed "subset_imp_LeadsTo"; |
|
96 |
||
97 |
bind_thm ("empty_LeadsTo", empty_subsetI RS subset_imp_LeadsTo); |
|
98 |
Addsimps [empty_LeadsTo]; |
|
99 |
||
6536 | 100 |
Goal "[| F : A LeadsTo A'; A' <= B' |] ==> F : A LeadsTo B'"; |
5111 | 101 |
by (full_simp_tac (simpset() addsimps [LeadsTo_def]) 1); |
4776 | 102 |
by (blast_tac (claset() addIs [leadsTo_weaken_R]) 1); |
103 |
qed_spec_mp "LeadsTo_weaken_R"; |
|
104 |
||
6536 | 105 |
Goal "[| F : A LeadsTo A'; B <= A |] \ |
106 |
\ ==> F : B LeadsTo A'"; |
|
5111 | 107 |
by (full_simp_tac (simpset() addsimps [LeadsTo_def]) 1); |
4776 | 108 |
by (blast_tac (claset() addIs [leadsTo_weaken_L]) 1); |
109 |
qed_spec_mp "LeadsTo_weaken_L"; |
|
110 |
||
6536 | 111 |
Goal "[| F : A LeadsTo A'; \ |
5340 | 112 |
\ B <= A; A' <= B' |] \ |
6536 | 113 |
\ ==> F : B LeadsTo B'"; |
5340 | 114 |
by (blast_tac (claset() addIs [LeadsTo_weaken_R, LeadsTo_weaken_L, |
115 |
LeadsTo_Trans]) 1); |
|
116 |
qed "LeadsTo_weaken"; |
|
4776 | 117 |
|
6536 | 118 |
Goal "[| reachable F <= C; F : A LeadsTo A'; \ |
5544 | 119 |
\ C Int B <= A; C Int A' <= B' |] \ |
6536 | 120 |
\ ==> F : B LeadsTo B'"; |
5544 | 121 |
by (blast_tac (claset() addDs [reachable_LeadsToI] addIs[LeadsTo_weaken] |
122 |
addIs [reachable_LeadsToD]) 1); |
|
123 |
qed "reachable_LeadsTo_weaken"; |
|
5340 | 124 |
|
125 |
(** Two theorems for "proof lattices" **) |
|
126 |
||
6536 | 127 |
Goal "[| F : A LeadsTo B |] ==> F : (A Un B) LeadsTo B"; |
5340 | 128 |
by (blast_tac (claset() addIs [LeadsTo_Un, subset_imp_LeadsTo]) 1); |
129 |
qed "LeadsTo_Un_post"; |
|
130 |
||
6536 | 131 |
Goal "[| F : A LeadsTo B; F : B LeadsTo C |] \ |
132 |
\ ==> F : (A Un B) LeadsTo C"; |
|
5340 | 133 |
by (blast_tac (claset() addIs [LeadsTo_Un, subset_imp_LeadsTo, |
134 |
LeadsTo_weaken_L, LeadsTo_Trans]) 1); |
|
135 |
qed "LeadsTo_Trans_Un"; |
|
136 |
||
137 |
||
138 |
(** Distributive laws **) |
|
139 |
||
6536 | 140 |
Goal "(F : (A Un B) LeadsTo C) = (F : A LeadsTo C & F : B LeadsTo C)"; |
4776 | 141 |
by (blast_tac (claset() addIs [LeadsTo_Un, LeadsTo_weaken_L]) 1); |
142 |
qed "LeadsTo_Un_distrib"; |
|
143 |
||
6536 | 144 |
Goal "(F : (UN i:I. A i) LeadsTo B) = (ALL i : I. F : (A i) LeadsTo B)"; |
4776 | 145 |
by (blast_tac (claset() addIs [LeadsTo_UN, LeadsTo_weaken_L]) 1); |
146 |
qed "LeadsTo_UN_distrib"; |
|
147 |
||
6536 | 148 |
Goal "(F : (Union S) LeadsTo B) = (ALL A : S. F : A LeadsTo B)"; |
4776 | 149 |
by (blast_tac (claset() addIs [LeadsTo_Union, LeadsTo_weaken_L]) 1); |
150 |
qed "LeadsTo_Union_distrib"; |
|
151 |
||
152 |
||
5620 | 153 |
(** More rules using the premise "Invariant F" **) |
5277
e4297d03e5d2
A higher-level treatment of LeadsTo, minimizing use of "reachable"
paulson
parents:
5257
diff
changeset
|
154 |
|
6536 | 155 |
Goal "[| F : (A-A') Co (A Un A'); F : transient (A-A') |] \ |
156 |
\ ==> F : A LeadsTo A'"; |
|
5648 | 157 |
by (asm_full_simp_tac (simpset() addsimps [LeadsTo_def, Constrains_def]) 1); |
5313
1861a564d7e2
Constrains, Stable, Invariant...more of the substitution axiom, but Union
paulson
parents:
5277
diff
changeset
|
158 |
by (rtac (ensuresI RS leadsTo_Basis) 1); |
1861a564d7e2
Constrains, Stable, Invariant...more of the substitution axiom, but Union
paulson
parents:
5277
diff
changeset
|
159 |
by (blast_tac (claset() addIs [transient_strengthen]) 2); |
1861a564d7e2
Constrains, Stable, Invariant...more of the substitution axiom, but Union
paulson
parents:
5277
diff
changeset
|
160 |
by (blast_tac (claset() addIs [constrains_weaken]) 1); |
1861a564d7e2
Constrains, Stable, Invariant...more of the substitution axiom, but Union
paulson
parents:
5277
diff
changeset
|
161 |
qed "LeadsTo_Basis"; |
1861a564d7e2
Constrains, Stable, Invariant...more of the substitution axiom, but Union
paulson
parents:
5277
diff
changeset
|
162 |
|
5648 | 163 |
Goal "[| F : Invariant INV; \ |
6536 | 164 |
\ F : (INV Int (A-A')) Co (A Un A'); \ |
5648 | 165 |
\ F : transient (INV Int (A-A')) |] \ |
6536 | 166 |
\ ==> F : A LeadsTo A'"; |
5313
1861a564d7e2
Constrains, Stable, Invariant...more of the substitution axiom, but Union
paulson
parents:
5277
diff
changeset
|
167 |
by (rtac Invariant_LeadsToI 1); |
1861a564d7e2
Constrains, Stable, Invariant...more of the substitution axiom, but Union
paulson
parents:
5277
diff
changeset
|
168 |
by (assume_tac 1); |
1861a564d7e2
Constrains, Stable, Invariant...more of the substitution axiom, but Union
paulson
parents:
5277
diff
changeset
|
169 |
by (rtac LeadsTo_Basis 1); |
1861a564d7e2
Constrains, Stable, Invariant...more of the substitution axiom, but Union
paulson
parents:
5277
diff
changeset
|
170 |
by (blast_tac (claset() addIs [transient_strengthen]) 2); |
1861a564d7e2
Constrains, Stable, Invariant...more of the substitution axiom, but Union
paulson
parents:
5277
diff
changeset
|
171 |
by (blast_tac (claset() addIs [Invariant_ConstrainsD RS Constrains_weaken]) 1); |
1861a564d7e2
Constrains, Stable, Invariant...more of the substitution axiom, but Union
paulson
parents:
5277
diff
changeset
|
172 |
qed "Invariant_LeadsTo_Basis"; |
5277
e4297d03e5d2
A higher-level treatment of LeadsTo, minimizing use of "reachable"
paulson
parents:
5257
diff
changeset
|
173 |
|
5648 | 174 |
Goal "[| F : Invariant INV; \ |
6536 | 175 |
\ F : A LeadsTo A'; INV Int B <= A; INV Int A' <= B' |] \ |
176 |
\ ==> F : B LeadsTo B'"; |
|
5639 | 177 |
by (REPEAT (ares_tac [Invariant_includes_reachable, |
178 |
reachable_LeadsTo_weaken] 1)); |
|
5313
1861a564d7e2
Constrains, Stable, Invariant...more of the substitution axiom, but Union
paulson
parents:
5277
diff
changeset
|
179 |
qed "Invariant_LeadsTo_weaken"; |
5277
e4297d03e5d2
A higher-level treatment of LeadsTo, minimizing use of "reachable"
paulson
parents:
5257
diff
changeset
|
180 |
|
e4297d03e5d2
A higher-level treatment of LeadsTo, minimizing use of "reachable"
paulson
parents:
5257
diff
changeset
|
181 |
|
5253 | 182 |
(*Set difference: maybe combine with leadsTo_weaken_L?? |
183 |
This is the most useful form of the "disjunction" rule*) |
|
6536 | 184 |
Goal "[| F : (A-B) LeadsTo C; F : (A Int B) LeadsTo C |] \ |
185 |
\ ==> F : A LeadsTo C"; |
|
5479 | 186 |
by (blast_tac (claset() addIs [LeadsTo_Un, LeadsTo_weaken]) 1); |
4776 | 187 |
qed "LeadsTo_Diff"; |
188 |
||
189 |
||
5277
e4297d03e5d2
A higher-level treatment of LeadsTo, minimizing use of "reachable"
paulson
parents:
5257
diff
changeset
|
190 |
val prems = |
6536 | 191 |
Goal "(!! i. i:I ==> F : (A i) LeadsTo (A' i)) \ |
192 |
\ ==> F : (UN i:I. A i) LeadsTo (UN i:I. A' i)"; |
|
6295
351b3c2b0d83
removed the infernal States, eqStates, compatible, etc.
paulson
parents:
5804
diff
changeset
|
193 |
by (simp_tac (HOL_ss addsimps [Union_image_eq RS sym]) 1); |
4776 | 194 |
by (blast_tac (claset() addIs [LeadsTo_Union, LeadsTo_weaken_R] |
195 |
addIs prems) 1); |
|
196 |
qed "LeadsTo_UN_UN"; |
|
197 |
||
198 |
||
199 |
(*Version with no index set*) |
|
5257 | 200 |
val prems = |
6536 | 201 |
Goal "(!! i. F : (A i) LeadsTo (A' i)) \ |
202 |
\ ==> F : (UN i. A i) LeadsTo (UN i. A' i)"; |
|
4776 | 203 |
by (blast_tac (claset() addIs [LeadsTo_UN_UN] |
204 |
addIs prems) 1); |
|
205 |
qed "LeadsTo_UN_UN_noindex"; |
|
206 |
||
207 |
(*Version with no index set*) |
|
6536 | 208 |
Goal "ALL i. F : (A i) LeadsTo (A' i) \ |
209 |
\ ==> F : (UN i. A i) LeadsTo (UN i. A' i)"; |
|
4776 | 210 |
by (blast_tac (claset() addIs [LeadsTo_UN_UN]) 1); |
211 |
qed "all_LeadsTo_UN_UN"; |
|
212 |
||
213 |
||
214 |
(*Binary union version*) |
|
6536 | 215 |
Goal "[| F : A LeadsTo A'; F : B LeadsTo B' |] \ |
216 |
\ ==> F : (A Un B) LeadsTo (A' Un B')"; |
|
4776 | 217 |
by (blast_tac (claset() addIs [LeadsTo_Un, |
218 |
LeadsTo_weaken_R]) 1); |
|
219 |
qed "LeadsTo_Un_Un"; |
|
220 |
||
221 |
||
222 |
(** The cancellation law **) |
|
223 |
||
6536 | 224 |
Goal "[| F : A LeadsTo (A' Un B); F : B LeadsTo B' |] \ |
225 |
\ ==> F : A LeadsTo (A' Un B')"; |
|
4776 | 226 |
by (blast_tac (claset() addIs [LeadsTo_Un_Un, |
227 |
subset_imp_LeadsTo, LeadsTo_Trans]) 1); |
|
228 |
qed "LeadsTo_cancel2"; |
|
229 |
||
6536 | 230 |
Goal "[| F : A LeadsTo (A' Un B); F : (B-A') LeadsTo B' |] \ |
231 |
\ ==> F : A LeadsTo (A' Un B')"; |
|
4776 | 232 |
by (rtac LeadsTo_cancel2 1); |
233 |
by (assume_tac 2); |
|
234 |
by (ALLGOALS Asm_simp_tac); |
|
235 |
qed "LeadsTo_cancel_Diff2"; |
|
236 |
||
6536 | 237 |
Goal "[| F : A LeadsTo (B Un A'); F : B LeadsTo B' |] \ |
238 |
\ ==> F : A LeadsTo (B' Un A')"; |
|
4776 | 239 |
by (asm_full_simp_tac (simpset() addsimps [Un_commute]) 1); |
240 |
by (blast_tac (claset() addSIs [LeadsTo_cancel2]) 1); |
|
241 |
qed "LeadsTo_cancel1"; |
|
242 |
||
6536 | 243 |
Goal "[| F : A LeadsTo (B Un A'); F : (B-A') LeadsTo B' |] \ |
244 |
\ ==> F : A LeadsTo (B' Un A')"; |
|
4776 | 245 |
by (rtac LeadsTo_cancel1 1); |
246 |
by (assume_tac 2); |
|
247 |
by (ALLGOALS Asm_simp_tac); |
|
248 |
qed "LeadsTo_cancel_Diff1"; |
|
249 |
||
250 |
||
251 |
(** The impossibility law **) |
|
252 |
||
5277
e4297d03e5d2
A higher-level treatment of LeadsTo, minimizing use of "reachable"
paulson
parents:
5257
diff
changeset
|
253 |
(*The set "A" may be non-empty, but it contains no reachable states*) |
6536 | 254 |
Goal "F : A LeadsTo {} ==> reachable F Int A = {}"; |
5111 | 255 |
by (full_simp_tac (simpset() addsimps [LeadsTo_def]) 1); |
4776 | 256 |
by (etac leadsTo_empty 1); |
257 |
qed "LeadsTo_empty"; |
|
258 |
||
259 |
||
260 |
(** PSP: Progress-Safety-Progress **) |
|
261 |
||
5639 | 262 |
(*Special case of PSP: Misra's "stable conjunction"*) |
6536 | 263 |
Goal "[| F : A LeadsTo A'; F : Stable B |] \ |
264 |
\ ==> F : (A Int B) LeadsTo (A' Int B)"; |
|
5313
1861a564d7e2
Constrains, Stable, Invariant...more of the substitution axiom, but Union
paulson
parents:
5277
diff
changeset
|
265 |
by (full_simp_tac (simpset() addsimps [LeadsTo_def, Stable_eq_stable]) 1); |
1861a564d7e2
Constrains, Stable, Invariant...more of the substitution axiom, but Union
paulson
parents:
5277
diff
changeset
|
266 |
by (dtac psp_stable 1); |
1861a564d7e2
Constrains, Stable, Invariant...more of the substitution axiom, but Union
paulson
parents:
5277
diff
changeset
|
267 |
by (assume_tac 1); |
1861a564d7e2
Constrains, Stable, Invariant...more of the substitution axiom, but Union
paulson
parents:
5277
diff
changeset
|
268 |
by (asm_full_simp_tac (simpset() addsimps Int_ac) 1); |
5277
e4297d03e5d2
A higher-level treatment of LeadsTo, minimizing use of "reachable"
paulson
parents:
5257
diff
changeset
|
269 |
qed "PSP_stable"; |
4776 | 270 |
|
6536 | 271 |
Goal "[| F : A LeadsTo A'; F : Stable B |] \ |
272 |
\ ==> F : (B Int A) LeadsTo (B Int A')"; |
|
5536 | 273 |
by (asm_simp_tac (simpset() addsimps PSP_stable::Int_ac) 1); |
5277
e4297d03e5d2
A higher-level treatment of LeadsTo, minimizing use of "reachable"
paulson
parents:
5257
diff
changeset
|
274 |
qed "PSP_stable2"; |
4776 | 275 |
|
5313
1861a564d7e2
Constrains, Stable, Invariant...more of the substitution axiom, but Union
paulson
parents:
5277
diff
changeset
|
276 |
Goalw [LeadsTo_def, Constrains_def] |
6536 | 277 |
"[| F : A LeadsTo A'; F : B Co B' |] \ |
278 |
\ ==> F : (A Int B) LeadsTo ((A' Int B) Un (B' - B))"; |
|
5313
1861a564d7e2
Constrains, Stable, Invariant...more of the substitution axiom, but Union
paulson
parents:
5277
diff
changeset
|
279 |
by (blast_tac (claset() addDs [psp] addIs [leadsTo_weaken]) 1); |
5277
e4297d03e5d2
A higher-level treatment of LeadsTo, minimizing use of "reachable"
paulson
parents:
5257
diff
changeset
|
280 |
qed "PSP"; |
4776 | 281 |
|
6536 | 282 |
Goal "[| F : A LeadsTo A'; F : B Co B' |] \ |
283 |
\ ==> F : (B Int A) LeadsTo ((B Int A') Un (B' - B))"; |
|
5536 | 284 |
by (asm_simp_tac (simpset() addsimps PSP::Int_ac) 1); |
5277
e4297d03e5d2
A higher-level treatment of LeadsTo, minimizing use of "reachable"
paulson
parents:
5257
diff
changeset
|
285 |
qed "PSP2"; |
4776 | 286 |
|
5313
1861a564d7e2
Constrains, Stable, Invariant...more of the substitution axiom, but Union
paulson
parents:
5277
diff
changeset
|
287 |
Goalw [Unless_def] |
6536 | 288 |
"[| F : A LeadsTo A'; F : B Unless B' |] \ |
289 |
\ ==> F : (A Int B) LeadsTo ((A' Int B) Un B')"; |
|
5277
e4297d03e5d2
A higher-level treatment of LeadsTo, minimizing use of "reachable"
paulson
parents:
5257
diff
changeset
|
290 |
by (dtac PSP 1); |
4776 | 291 |
by (assume_tac 1); |
5313
1861a564d7e2
Constrains, Stable, Invariant...more of the substitution axiom, but Union
paulson
parents:
5277
diff
changeset
|
292 |
by (blast_tac (claset() addIs [LeadsTo_Diff, LeadsTo_weaken, |
5584 | 293 |
subset_imp_LeadsTo]) 1); |
5313
1861a564d7e2
Constrains, Stable, Invariant...more of the substitution axiom, but Union
paulson
parents:
5277
diff
changeset
|
294 |
qed "PSP_Unless"; |
4776 | 295 |
|
296 |
||
5804
8e0a4c4fd67b
Revising the Client proof as suggested by Michel Charpentier. New lemmas
paulson
parents:
5648
diff
changeset
|
297 |
Goal "[| F : Stable A; F : transient C; \ |
6536 | 298 |
\ reachable F <= (-A Un B Un C) |] ==> F : A LeadsTo B"; |
5804
8e0a4c4fd67b
Revising the Client proof as suggested by Michel Charpentier. New lemmas
paulson
parents:
5648
diff
changeset
|
299 |
by (etac reachable_LeadsTo_weaken 1); |
8e0a4c4fd67b
Revising the Client proof as suggested by Michel Charpentier. New lemmas
paulson
parents:
5648
diff
changeset
|
300 |
by (rtac LeadsTo_Diff 1); |
8e0a4c4fd67b
Revising the Client proof as suggested by Michel Charpentier. New lemmas
paulson
parents:
5648
diff
changeset
|
301 |
by (etac (transient_imp_leadsTo RS leadsTo_imp_LeadsTo RS PSP_stable2) 2); |
8e0a4c4fd67b
Revising the Client proof as suggested by Michel Charpentier. New lemmas
paulson
parents:
5648
diff
changeset
|
302 |
by (ALLGOALS (blast_tac (claset() addIs [subset_imp_LeadsTo]))); |
8e0a4c4fd67b
Revising the Client proof as suggested by Michel Charpentier. New lemmas
paulson
parents:
5648
diff
changeset
|
303 |
qed "Stable_transient_reachable_LeadsTo"; |
8e0a4c4fd67b
Revising the Client proof as suggested by Michel Charpentier. New lemmas
paulson
parents:
5648
diff
changeset
|
304 |
|
8e0a4c4fd67b
Revising the Client proof as suggested by Michel Charpentier. New lemmas
paulson
parents:
5648
diff
changeset
|
305 |
|
4776 | 306 |
(*** Induction rules ***) |
307 |
||
308 |
(** Meta or object quantifier ????? **) |
|
5232 | 309 |
Goal "[| wf r; \ |
6536 | 310 |
\ ALL m. F : (A Int f-``{m}) LeadsTo \ |
5584 | 311 |
\ ((A Int f-``(r^-1 ^^ {m})) Un B) |] \ |
6536 | 312 |
\ ==> F : A LeadsTo B"; |
5111 | 313 |
by (full_simp_tac (simpset() addsimps [LeadsTo_def]) 1); |
4776 | 314 |
by (etac leadsTo_wf_induct 1); |
315 |
by (blast_tac (claset() addIs [leadsTo_weaken]) 1); |
|
316 |
qed "LeadsTo_wf_induct"; |
|
317 |
||
318 |
||
5232 | 319 |
Goal "[| wf r; \ |
6536 | 320 |
\ ALL m:I. F : (A Int f-``{m}) LeadsTo \ |
5584 | 321 |
\ ((A Int f-``(r^-1 ^^ {m})) Un B) |] \ |
6536 | 322 |
\ ==> F : A LeadsTo ((A - (f-``I)) Un B)"; |
4776 | 323 |
by (etac LeadsTo_wf_induct 1); |
324 |
by Safe_tac; |
|
325 |
by (case_tac "m:I" 1); |
|
326 |
by (blast_tac (claset() addIs [LeadsTo_weaken]) 1); |
|
327 |
by (blast_tac (claset() addIs [subset_imp_LeadsTo]) 1); |
|
5277
e4297d03e5d2
A higher-level treatment of LeadsTo, minimizing use of "reachable"
paulson
parents:
5257
diff
changeset
|
328 |
qed "Bounded_induct"; |
4776 | 329 |
|
330 |
||
6536 | 331 |
Goal "[| ALL m. F : (A Int f-``{m}) LeadsTo \ |
5584 | 332 |
\ ((A Int f-``(lessThan m)) Un B) |] \ |
6536 | 333 |
\ ==> F : A LeadsTo B"; |
4776 | 334 |
by (rtac (wf_less_than RS LeadsTo_wf_induct) 1); |
335 |
by (Asm_simp_tac 1); |
|
5277
e4297d03e5d2
A higher-level treatment of LeadsTo, minimizing use of "reachable"
paulson
parents:
5257
diff
changeset
|
336 |
qed "LessThan_induct"; |
4776 | 337 |
|
5544 | 338 |
(*Integer version. Could generalize from #0 to any lower bound*) |
5584 | 339 |
val [reach, prem] = |
5620 | 340 |
Goal "[| reachable F <= {s. #0 <= f s}; \ |
6536 | 341 |
\ !! z. F : (A Int {s. f s = z}) LeadsTo \ |
5584 | 342 |
\ ((A Int {s. f s < z}) Un B) |] \ |
6536 | 343 |
\ ==> F : A LeadsTo B"; |
5569
8c7e1190e789
Renaming of Integ/Integ.* to Integ/Int.*, and renaming of related constants
paulson
parents:
5544
diff
changeset
|
344 |
by (res_inst_tac [("f", "nat o f")] (allI RS LessThan_induct) 1); |
5544 | 345 |
by (simp_tac (simpset() addsimps [vimage_def]) 1); |
5620 | 346 |
by (rtac ([reach, prem] MRS reachable_LeadsTo_weaken) 1); |
5584 | 347 |
by (auto_tac (claset(), simpset() addsimps [nat_eq_iff, nat_less_iff])); |
5544 | 348 |
qed "integ_0_le_induct"; |
349 |
||
6536 | 350 |
Goal "[| ALL m:(greaterThan l). F : (A Int f-``{m}) LeadsTo \ |
5584 | 351 |
\ ((A Int f-``(lessThan m)) Un B) |] \ |
6536 | 352 |
\ ==> F : A LeadsTo ((A Int (f-``(atMost l))) Un B)"; |
4776 | 353 |
by (simp_tac (HOL_ss addsimps [Diff_eq RS sym, vimage_Compl, Compl_greaterThan RS sym]) 1); |
5277
e4297d03e5d2
A higher-level treatment of LeadsTo, minimizing use of "reachable"
paulson
parents:
5257
diff
changeset
|
354 |
by (rtac (wf_less_than RS Bounded_induct) 1); |
4776 | 355 |
by (Asm_simp_tac 1); |
5277
e4297d03e5d2
A higher-level treatment of LeadsTo, minimizing use of "reachable"
paulson
parents:
5257
diff
changeset
|
356 |
qed "LessThan_bounded_induct"; |
4776 | 357 |
|
6536 | 358 |
Goal "[| ALL m:(lessThan l). F : (A Int f-``{m}) LeadsTo \ |
5584 | 359 |
\ ((A Int f-``(greaterThan m)) Un B) |] \ |
6536 | 360 |
\ ==> F : A LeadsTo ((A Int (f-``(atLeast l))) Un B)"; |
4776 | 361 |
by (res_inst_tac [("f","f"),("f1", "%k. l - k")] |
362 |
(wf_less_than RS wf_inv_image RS LeadsTo_wf_induct) 1); |
|
363 |
by (simp_tac (simpset() addsimps [inv_image_def, Image_singleton]) 1); |
|
364 |
by (Clarify_tac 1); |
|
365 |
by (case_tac "m<l" 1); |
|
366 |
by (blast_tac (claset() addIs [not_leE, subset_imp_LeadsTo]) 2); |
|
367 |
by (blast_tac (claset() addIs [LeadsTo_weaken_R, diff_less_mono2]) 1); |
|
5277
e4297d03e5d2
A higher-level treatment of LeadsTo, minimizing use of "reachable"
paulson
parents:
5257
diff
changeset
|
368 |
qed "GreaterThan_bounded_induct"; |
4776 | 369 |
|
370 |
||
371 |
(*** Completion: Binary and General Finite versions ***) |
|
372 |
||
6536 | 373 |
Goal "[| F : A LeadsTo A'; F : Stable A'; \ |
374 |
\ F : B LeadsTo B'; F : Stable B' |] \ |
|
375 |
\ ==> F : (A Int B) LeadsTo (A' Int B')"; |
|
5313
1861a564d7e2
Constrains, Stable, Invariant...more of the substitution axiom, but Union
paulson
parents:
5277
diff
changeset
|
376 |
by (full_simp_tac (simpset() addsimps [LeadsTo_def, Stable_eq_stable]) 1); |
1861a564d7e2
Constrains, Stable, Invariant...more of the substitution axiom, but Union
paulson
parents:
5277
diff
changeset
|
377 |
by (blast_tac (claset() addIs [stable_completion, leadsTo_weaken]) 1); |
5277
e4297d03e5d2
A higher-level treatment of LeadsTo, minimizing use of "reachable"
paulson
parents:
5257
diff
changeset
|
378 |
qed "Stable_completion"; |
4776 | 379 |
|
380 |
||
5584 | 381 |
Goal "finite I \ |
6536 | 382 |
\ ==> (ALL i:I. F : (A i) LeadsTo (A' i)) --> \ |
5648 | 383 |
\ (ALL i:I. F : Stable (A' i)) --> \ |
6536 | 384 |
\ F : (INT i:I. A i) LeadsTo (INT i:I. A' i)"; |
4776 | 385 |
by (etac finite_induct 1); |
386 |
by (Asm_simp_tac 1); |
|
5313
1861a564d7e2
Constrains, Stable, Invariant...more of the substitution axiom, but Union
paulson
parents:
5277
diff
changeset
|
387 |
by (asm_simp_tac (simpset() addsimps [Stable_completion, ball_Stable_INT]) 1); |
5277
e4297d03e5d2
A higher-level treatment of LeadsTo, minimizing use of "reachable"
paulson
parents:
5257
diff
changeset
|
388 |
qed_spec_mp "Finite_stable_completion"; |
4776 | 389 |
|
390 |
||
6536 | 391 |
Goal "[| F : A LeadsTo (A' Un C); F : A' Co (A' Un C); \ |
392 |
\ F : B LeadsTo (B' Un C); F : B' Co (B' Un C) |] \ |
|
393 |
\ ==> F : (A Int B) LeadsTo ((A' Int B') Un C)"; |
|
5313
1861a564d7e2
Constrains, Stable, Invariant...more of the substitution axiom, but Union
paulson
parents:
5277
diff
changeset
|
394 |
by (full_simp_tac (simpset() addsimps [LeadsTo_def, Constrains_def, |
1861a564d7e2
Constrains, Stable, Invariant...more of the substitution axiom, but Union
paulson
parents:
5277
diff
changeset
|
395 |
Int_Un_distrib]) 1); |
1861a564d7e2
Constrains, Stable, Invariant...more of the substitution axiom, but Union
paulson
parents:
5277
diff
changeset
|
396 |
by (blast_tac (claset() addIs [completion, leadsTo_weaken]) 1); |
5277
e4297d03e5d2
A higher-level treatment of LeadsTo, minimizing use of "reachable"
paulson
parents:
5257
diff
changeset
|
397 |
qed "Completion"; |
4776 | 398 |
|
399 |
||
5584 | 400 |
Goal "[| finite I |] \ |
6536 | 401 |
\ ==> (ALL i:I. F : (A i) LeadsTo (A' i Un C)) --> \ |
402 |
\ (ALL i:I. F : (A' i) Co (A' i Un C)) --> \ |
|
403 |
\ F : (INT i:I. A i) LeadsTo ((INT i:I. A' i) Un C)"; |
|
4776 | 404 |
by (etac finite_induct 1); |
405 |
by (ALLGOALS Asm_simp_tac); |
|
406 |
by (Clarify_tac 1); |
|
5313
1861a564d7e2
Constrains, Stable, Invariant...more of the substitution axiom, but Union
paulson
parents:
5277
diff
changeset
|
407 |
by (dtac ball_Constrains_INT 1); |
5277
e4297d03e5d2
A higher-level treatment of LeadsTo, minimizing use of "reachable"
paulson
parents:
5257
diff
changeset
|
408 |
by (asm_full_simp_tac (simpset() addsimps [Completion]) 1); |
e4297d03e5d2
A higher-level treatment of LeadsTo, minimizing use of "reachable"
paulson
parents:
5257
diff
changeset
|
409 |
qed "Finite_completion"; |
5232 | 410 |
|
411 |
||
5313
1861a564d7e2
Constrains, Stable, Invariant...more of the substitution axiom, but Union
paulson
parents:
5277
diff
changeset
|
412 |
(*proves "ensures/leadsTo" properties when the program is specified*) |
5426
566f47250bd0
A new approach, using simp_of_act and simp_of_set to activate definitions when
paulson
parents:
5422
diff
changeset
|
413 |
fun ensures_tac sact = |
5240
bbcd79ef7cf2
Constant "invariant" and new constrains_tac, ensures_tac
paulson
parents:
5232
diff
changeset
|
414 |
SELECT_GOAL |
5313
1861a564d7e2
Constrains, Stable, Invariant...more of the substitution axiom, but Union
paulson
parents:
5277
diff
changeset
|
415 |
(EVERY [REPEAT (Invariant_Int_tac 1), |
1861a564d7e2
Constrains, Stable, Invariant...more of the substitution axiom, but Union
paulson
parents:
5277
diff
changeset
|
416 |
etac Invariant_LeadsTo_Basis 1 |
5240
bbcd79ef7cf2
Constant "invariant" and new constrains_tac, ensures_tac
paulson
parents:
5232
diff
changeset
|
417 |
ORELSE (*subgoal may involve LeadsTo, leadsTo or ensures*) |
5313
1861a564d7e2
Constrains, Stable, Invariant...more of the substitution axiom, but Union
paulson
parents:
5277
diff
changeset
|
418 |
REPEAT (ares_tac [LeadsTo_Basis, ensuresI] 1), |
6536 | 419 |
(*now there are two subgoals: co & transient*) |
5648 | 420 |
simp_tac (simpset() addsimps !program_defs_ref) 2, |
5240
bbcd79ef7cf2
Constant "invariant" and new constrains_tac, ensures_tac
paulson
parents:
5232
diff
changeset
|
421 |
res_inst_tac [("act", sact)] transient_mem 2, |
5340 | 422 |
(*simplify the command's domain*) |
5426
566f47250bd0
A new approach, using simp_of_act and simp_of_set to activate definitions when
paulson
parents:
5422
diff
changeset
|
423 |
simp_tac (simpset() addsimps [Domain_def]) 3, |
566f47250bd0
A new approach, using simp_of_act and simp_of_set to activate definitions when
paulson
parents:
5422
diff
changeset
|
424 |
constrains_tac 1, |
5240
bbcd79ef7cf2
Constant "invariant" and new constrains_tac, ensures_tac
paulson
parents:
5232
diff
changeset
|
425 |
ALLGOALS Clarify_tac, |
5422 | 426 |
ALLGOALS Asm_full_simp_tac]); |
5240
bbcd79ef7cf2
Constant "invariant" and new constrains_tac, ensures_tac
paulson
parents:
5232
diff
changeset
|
427 |
|
bbcd79ef7cf2
Constant "invariant" and new constrains_tac, ensures_tac
paulson
parents:
5232
diff
changeset
|
428 |