author | paulson |
Mon, 08 May 2000 16:59:02 +0200 | |
changeset 8835 | 56187238220d |
parent 8703 | 816d8f6513be |
child 8948 | b797cfa3548d |
permissions | -rw-r--r-- |
4776 | 1 |
(* Title: HOL/UNITY/UNITY |
2 |
ID: $Id$ |
|
3 |
Author: Lawrence C Paulson, Cambridge University Computer Laboratory |
|
4 |
Copyright 1998 University of Cambridge |
|
5 |
||
6 |
The basic UNITY theory (revised version, based upon the "co" operator) |
|
7 |
||
8 |
From Misra, "A Logic for Concurrent Programming", 1994 |
|
9 |
*) |
|
10 |
||
11 |
set proof_timing; |
|
12 |
||
8311
6218522253e7
new mostly working version; Alloc nearly converted to "Rename"
paulson
parents:
8216
diff
changeset
|
13 |
(*Perhaps equalities.ML shouldn't add this in the first place!*) |
6218522253e7
new mostly working version; Alloc nearly converted to "Rename"
paulson
parents:
8216
diff
changeset
|
14 |
Delsimps [image_Collect]; |
6218522253e7
new mostly working version; Alloc nearly converted to "Rename"
paulson
parents:
8216
diff
changeset
|
15 |
|
4776 | 16 |
|
6535 | 17 |
(*** The abstract type of programs ***) |
18 |
||
19 |
val rep_ss = simpset() addsimps |
|
20 |
[Init_def, Acts_def, mk_program_def, Program_def, Rep_Program, |
|
21 |
Rep_Program_inverse, Abs_Program_inverse]; |
|
22 |
||
23 |
||
24 |
Goal "Id : Acts F"; |
|
25 |
by (cut_inst_tac [("x", "F")] Rep_Program 1); |
|
26 |
by (auto_tac (claset(), rep_ss)); |
|
27 |
qed "Id_in_Acts"; |
|
28 |
AddIffs [Id_in_Acts]; |
|
29 |
||
30 |
Goal "insert Id (Acts F) = Acts F"; |
|
31 |
by (simp_tac (simpset() addsimps [insert_absorb, Id_in_Acts]) 1); |
|
32 |
qed "insert_Id_Acts"; |
|
33 |
AddIffs [insert_Id_Acts]; |
|
34 |
||
35 |
(** Inspectors for type "program" **) |
|
36 |
||
37 |
Goal "Init (mk_program (init,acts)) = init"; |
|
38 |
by (auto_tac (claset(), rep_ss)); |
|
39 |
qed "Init_eq"; |
|
40 |
||
41 |
Goal "Acts (mk_program (init,acts)) = insert Id acts"; |
|
42 |
by (auto_tac (claset(), rep_ss)); |
|
43 |
qed "Acts_eq"; |
|
44 |
||
45 |
Addsimps [Acts_eq, Init_eq]; |
|
46 |
||
47 |
||
8327 | 48 |
(** Equality for UNITY programs **) |
7915
c7fd7eb3b0ef
ALMOST working version: LocalTo results commented out
paulson
parents:
7826
diff
changeset
|
49 |
|
c7fd7eb3b0ef
ALMOST working version: LocalTo results commented out
paulson
parents:
7826
diff
changeset
|
50 |
Goal "mk_program (Init F, Acts F) = F"; |
c7fd7eb3b0ef
ALMOST working version: LocalTo results commented out
paulson
parents:
7826
diff
changeset
|
51 |
by (cut_inst_tac [("x", "F")] Rep_Program 1); |
6535 | 52 |
by (auto_tac (claset(), rep_ss)); |
53 |
by (REPEAT (dres_inst_tac [("f", "Abs_Program")] arg_cong 1)); |
|
7915
c7fd7eb3b0ef
ALMOST working version: LocalTo results commented out
paulson
parents:
7826
diff
changeset
|
54 |
by (asm_full_simp_tac (rep_ss addsimps [insert_absorb]) 1); |
c7fd7eb3b0ef
ALMOST working version: LocalTo results commented out
paulson
parents:
7826
diff
changeset
|
55 |
qed "surjective_mk_program"; |
c7fd7eb3b0ef
ALMOST working version: LocalTo results commented out
paulson
parents:
7826
diff
changeset
|
56 |
|
c7fd7eb3b0ef
ALMOST working version: LocalTo results commented out
paulson
parents:
7826
diff
changeset
|
57 |
Goal "[| Init F = Init G; Acts F = Acts G |] ==> F = G"; |
c7fd7eb3b0ef
ALMOST working version: LocalTo results commented out
paulson
parents:
7826
diff
changeset
|
58 |
by (stac (surjective_mk_program RS sym) 1); |
c7fd7eb3b0ef
ALMOST working version: LocalTo results commented out
paulson
parents:
7826
diff
changeset
|
59 |
by (stac (surjective_mk_program RS sym) 1 THEN Force_tac 1); |
6535 | 60 |
qed "program_equalityI"; |
61 |
||
62 |
val [major,minor] = |
|
63 |
Goal "[| F = G; [| Init F = Init G; Acts F = Acts G |] ==> P |] ==> P"; |
|
64 |
by (rtac minor 1); |
|
65 |
by (auto_tac (claset(), simpset() addsimps [major])); |
|
66 |
qed "program_equalityE"; |
|
67 |
||
8327 | 68 |
Goal "(F=G) = (Init F = Init G & Acts F = Acts G)"; |
69 |
by (blast_tac (claset() addIs [program_equalityI, program_equalityE]) 1); |
|
70 |
qed "program_equality_iff"; |
|
71 |
||
7915
c7fd7eb3b0ef
ALMOST working version: LocalTo results commented out
paulson
parents:
7826
diff
changeset
|
72 |
Addsimps [surjective_mk_program]; |
c7fd7eb3b0ef
ALMOST working version: LocalTo results commented out
paulson
parents:
7826
diff
changeset
|
73 |
|
6535 | 74 |
|
75 |
(*** These rules allow "lazy" definition expansion |
|
76 |
They avoid expanding the full program, which is a large expression |
|
77 |
***) |
|
78 |
||
79 |
Goal "F == mk_program (init,acts) ==> Init F = init"; |
|
80 |
by Auto_tac; |
|
81 |
qed "def_prg_Init"; |
|
82 |
||
83 |
(*The program is not expanded, but its Init and Acts are*) |
|
84 |
val [rew] = goal thy |
|
85 |
"[| F == mk_program (init,acts) |] \ |
|
86 |
\ ==> Init F = init & Acts F = insert Id acts"; |
|
87 |
by (rewtac rew); |
|
88 |
by Auto_tac; |
|
89 |
qed "def_prg_simps"; |
|
90 |
||
91 |
(*An action is expanded only if a pair of states is being tested against it*) |
|
92 |
Goal "[| act == {(s,s'). P s s'} |] ==> ((s,s') : act) = P s s'"; |
|
93 |
by Auto_tac; |
|
94 |
qed "def_act_simp"; |
|
95 |
||
96 |
fun simp_of_act def = def RS def_act_simp; |
|
97 |
||
98 |
(*A set is expanded only if an element is being tested against it*) |
|
99 |
Goal "A == B ==> (x : A) = (x : B)"; |
|
100 |
by Auto_tac; |
|
101 |
qed "def_set_simp"; |
|
102 |
||
103 |
fun simp_of_set def = def RS def_set_simp; |
|
104 |
||
105 |
||
6536 | 106 |
(*** co ***) |
4776 | 107 |
|
7403 | 108 |
(*These operators are not overloaded, but their operands are sets, and |
109 |
ultimately there's a risk of reaching equality, which IS overloaded*) |
|
110 |
overload_1st_set "UNITY.constrains"; |
|
5648 | 111 |
overload_1st_set "UNITY.stable"; |
112 |
overload_1st_set "UNITY.unless"; |
|
5340 | 113 |
|
5277
e4297d03e5d2
A higher-level treatment of LeadsTo, minimizing use of "reachable"
paulson
parents:
5253
diff
changeset
|
114 |
val prems = Goalw [constrains_def] |
5648 | 115 |
"(!!act s s'. [| act: Acts F; (s,s') : act; s: A |] ==> s': A') \ |
6536 | 116 |
\ ==> F : A co A'"; |
4776 | 117 |
by (blast_tac (claset() addIs prems) 1); |
118 |
qed "constrainsI"; |
|
119 |
||
5069 | 120 |
Goalw [constrains_def] |
6536 | 121 |
"[| F : A co A'; act: Acts F; (s,s'): act; s: A |] ==> s': A'"; |
4776 | 122 |
by (Blast_tac 1); |
123 |
qed "constrainsD"; |
|
124 |
||
6536 | 125 |
Goalw [constrains_def] "F : {} co B"; |
4776 | 126 |
by (Blast_tac 1); |
127 |
qed "constrains_empty"; |
|
128 |
||
7826
c6a8b73b6c2a
working shapshot with "projecting" and "extending"
paulson
parents:
7630
diff
changeset
|
129 |
Goalw [constrains_def] "(F : A co {}) = (A={})"; |
c6a8b73b6c2a
working shapshot with "projecting" and "extending"
paulson
parents:
7630
diff
changeset
|
130 |
by (Blast_tac 1); |
c6a8b73b6c2a
working shapshot with "projecting" and "extending"
paulson
parents:
7630
diff
changeset
|
131 |
qed "constrains_empty2"; |
c6a8b73b6c2a
working shapshot with "projecting" and "extending"
paulson
parents:
7630
diff
changeset
|
132 |
|
c6a8b73b6c2a
working shapshot with "projecting" and "extending"
paulson
parents:
7630
diff
changeset
|
133 |
Goalw [constrains_def] "(F : UNIV co B) = (B = UNIV)"; |
c6a8b73b6c2a
working shapshot with "projecting" and "extending"
paulson
parents:
7630
diff
changeset
|
134 |
by (Blast_tac 1); |
c6a8b73b6c2a
working shapshot with "projecting" and "extending"
paulson
parents:
7630
diff
changeset
|
135 |
qed "constrains_UNIV"; |
c6a8b73b6c2a
working shapshot with "projecting" and "extending"
paulson
parents:
7630
diff
changeset
|
136 |
|
6536 | 137 |
Goalw [constrains_def] "F : A co UNIV"; |
4776 | 138 |
by (Blast_tac 1); |
7826
c6a8b73b6c2a
working shapshot with "projecting" and "extending"
paulson
parents:
7630
diff
changeset
|
139 |
qed "constrains_UNIV2"; |
c6a8b73b6c2a
working shapshot with "projecting" and "extending"
paulson
parents:
7630
diff
changeset
|
140 |
|
c6a8b73b6c2a
working shapshot with "projecting" and "extending"
paulson
parents:
7630
diff
changeset
|
141 |
AddIffs [constrains_empty, constrains_empty2, |
c6a8b73b6c2a
working shapshot with "projecting" and "extending"
paulson
parents:
7630
diff
changeset
|
142 |
constrains_UNIV, constrains_UNIV2]; |
4776 | 143 |
|
5648 | 144 |
(*monotonic in 2nd argument*) |
5069 | 145 |
Goalw [constrains_def] |
6536 | 146 |
"[| F : A co A'; A'<=B' |] ==> F : A co B'"; |
4776 | 147 |
by (Blast_tac 1); |
148 |
qed "constrains_weaken_R"; |
|
149 |
||
5648 | 150 |
(*anti-monotonic in 1st argument*) |
5069 | 151 |
Goalw [constrains_def] |
6536 | 152 |
"[| F : A co A'; B<=A |] ==> F : B co A'"; |
4776 | 153 |
by (Blast_tac 1); |
154 |
qed "constrains_weaken_L"; |
|
155 |
||
5069 | 156 |
Goalw [constrains_def] |
6536 | 157 |
"[| F : A co A'; B<=A; A'<=B' |] ==> F : B co B'"; |
4776 | 158 |
by (Blast_tac 1); |
159 |
qed "constrains_weaken"; |
|
160 |
||
161 |
(** Union **) |
|
162 |
||
5069 | 163 |
Goalw [constrains_def] |
7345 | 164 |
"[| F : A co A'; F : B co B' |] ==> F : (A Un B) co (A' Un B')"; |
4776 | 165 |
by (Blast_tac 1); |
166 |
qed "constrains_Un"; |
|
167 |
||
5069 | 168 |
Goalw [constrains_def] |
7345 | 169 |
"ALL i:I. F : (A i) co (A' i) ==> F : (UN i:I. A i) co (UN i:I. A' i)"; |
4776 | 170 |
by (Blast_tac 1); |
8334
7896bcbd8641
Added Tanja's Detects and Reachability theories. Also
paulson
parents:
8327
diff
changeset
|
171 |
bind_thm ("constrains_UN", ballI RS result()); |
4776 | 172 |
|
7826
c6a8b73b6c2a
working shapshot with "projecting" and "extending"
paulson
parents:
7630
diff
changeset
|
173 |
Goalw [constrains_def] "(A Un B) co C = (A co C) Int (B co C)"; |
c6a8b73b6c2a
working shapshot with "projecting" and "extending"
paulson
parents:
7630
diff
changeset
|
174 |
by (Blast_tac 1); |
c6a8b73b6c2a
working shapshot with "projecting" and "extending"
paulson
parents:
7630
diff
changeset
|
175 |
qed "constrains_Un_distrib"; |
c6a8b73b6c2a
working shapshot with "projecting" and "extending"
paulson
parents:
7630
diff
changeset
|
176 |
|
c6a8b73b6c2a
working shapshot with "projecting" and "extending"
paulson
parents:
7630
diff
changeset
|
177 |
Goalw [constrains_def] "(UN i:I. A i) co B = (INT i:I. A i co B)"; |
c6a8b73b6c2a
working shapshot with "projecting" and "extending"
paulson
parents:
7630
diff
changeset
|
178 |
by (Blast_tac 1); |
c6a8b73b6c2a
working shapshot with "projecting" and "extending"
paulson
parents:
7630
diff
changeset
|
179 |
qed "constrains_UN_distrib"; |
c6a8b73b6c2a
working shapshot with "projecting" and "extending"
paulson
parents:
7630
diff
changeset
|
180 |
|
c6a8b73b6c2a
working shapshot with "projecting" and "extending"
paulson
parents:
7630
diff
changeset
|
181 |
Goalw [constrains_def] "C co (A Int B) = (C co A) Int (C co B)"; |
c6a8b73b6c2a
working shapshot with "projecting" and "extending"
paulson
parents:
7630
diff
changeset
|
182 |
by (Blast_tac 1); |
c6a8b73b6c2a
working shapshot with "projecting" and "extending"
paulson
parents:
7630
diff
changeset
|
183 |
qed "constrains_Int_distrib"; |
c6a8b73b6c2a
working shapshot with "projecting" and "extending"
paulson
parents:
7630
diff
changeset
|
184 |
|
c6a8b73b6c2a
working shapshot with "projecting" and "extending"
paulson
parents:
7630
diff
changeset
|
185 |
Goalw [constrains_def] "A co (INT i:I. B i) = (INT i:I. A co B i)"; |
c6a8b73b6c2a
working shapshot with "projecting" and "extending"
paulson
parents:
7630
diff
changeset
|
186 |
by (Blast_tac 1); |
c6a8b73b6c2a
working shapshot with "projecting" and "extending"
paulson
parents:
7630
diff
changeset
|
187 |
qed "constrains_INT_distrib"; |
c6a8b73b6c2a
working shapshot with "projecting" and "extending"
paulson
parents:
7630
diff
changeset
|
188 |
|
4776 | 189 |
(** Intersection **) |
190 |
||
5069 | 191 |
Goalw [constrains_def] |
7345 | 192 |
"[| F : A co A'; F : B co B' |] ==> F : (A Int B) co (A' Int B')"; |
4776 | 193 |
by (Blast_tac 1); |
194 |
qed "constrains_Int"; |
|
195 |
||
5069 | 196 |
Goalw [constrains_def] |
7345 | 197 |
"ALL i:I. F : (A i) co (A' i) ==> F : (INT i:I. A i) co (INT i:I. A' i)"; |
4776 | 198 |
by (Blast_tac 1); |
8334
7896bcbd8641
Added Tanja's Detects and Reachability theories. Also
paulson
parents:
8327
diff
changeset
|
199 |
bind_thm ("constrains_INT", ballI RS result()); |
4776 | 200 |
|
6536 | 201 |
Goalw [constrains_def] "F : A co A' ==> A <= A'"; |
6295
351b3c2b0d83
removed the infernal States, eqStates, compatible, etc.
paulson
parents:
6012
diff
changeset
|
202 |
by Auto_tac; |
5277
e4297d03e5d2
A higher-level treatment of LeadsTo, minimizing use of "reachable"
paulson
parents:
5253
diff
changeset
|
203 |
qed "constrains_imp_subset"; |
4776 | 204 |
|
6536 | 205 |
(*The reasoning is by subsets since "co" refers to single actions |
6012
1894bfc4aee9
Addition of the States component; parts of Comp not working
paulson
parents:
5804
diff
changeset
|
206 |
only. So this rule isn't that useful.*) |
6295
351b3c2b0d83
removed the infernal States, eqStates, compatible, etc.
paulson
parents:
6012
diff
changeset
|
207 |
Goalw [constrains_def] |
6536 | 208 |
"[| F : A co B; F : B co C |] ==> F : A co C"; |
6295
351b3c2b0d83
removed the infernal States, eqStates, compatible, etc.
paulson
parents:
6012
diff
changeset
|
209 |
by (Blast_tac 1); |
5277
e4297d03e5d2
A higher-level treatment of LeadsTo, minimizing use of "reachable"
paulson
parents:
5253
diff
changeset
|
210 |
qed "constrains_trans"; |
4776 | 211 |
|
6295
351b3c2b0d83
removed the infernal States, eqStates, compatible, etc.
paulson
parents:
6012
diff
changeset
|
212 |
Goalw [constrains_def] |
7345 | 213 |
"[| F : A co (A' Un B); F : B co B' |] ==> F : A co (A' Un B')"; |
6295
351b3c2b0d83
removed the infernal States, eqStates, compatible, etc.
paulson
parents:
6012
diff
changeset
|
214 |
by (Clarify_tac 1); |
351b3c2b0d83
removed the infernal States, eqStates, compatible, etc.
paulson
parents:
6012
diff
changeset
|
215 |
by (Blast_tac 1); |
6012
1894bfc4aee9
Addition of the States component; parts of Comp not working
paulson
parents:
5804
diff
changeset
|
216 |
qed "constrains_cancel"; |
1894bfc4aee9
Addition of the States component; parts of Comp not working
paulson
parents:
5804
diff
changeset
|
217 |
|
4776 | 218 |
|
7630 | 219 |
(*** unless ***) |
220 |
||
221 |
Goalw [unless_def] "F : (A-B) co (A Un B) ==> F : A unless B"; |
|
222 |
by (assume_tac 1); |
|
223 |
qed "unlessI"; |
|
224 |
||
225 |
Goalw [unless_def] "F : A unless B ==> F : (A-B) co (A Un B)"; |
|
226 |
by (assume_tac 1); |
|
227 |
qed "unlessD"; |
|
228 |
||
229 |
||
4776 | 230 |
(*** stable ***) |
231 |
||
6536 | 232 |
Goalw [stable_def] "F : A co A ==> F : stable A"; |
4776 | 233 |
by (assume_tac 1); |
234 |
qed "stableI"; |
|
235 |
||
6536 | 236 |
Goalw [stable_def] "F : stable A ==> F : A co A"; |
4776 | 237 |
by (assume_tac 1); |
238 |
qed "stableD"; |
|
239 |
||
7594
8a188ef6545e
working version with co-guarantees-leadsto results
paulson
parents:
7403
diff
changeset
|
240 |
Goalw [stable_def, constrains_def] "stable UNIV = UNIV"; |
8a188ef6545e
working version with co-guarantees-leadsto results
paulson
parents:
7403
diff
changeset
|
241 |
by Auto_tac; |
8a188ef6545e
working version with co-guarantees-leadsto results
paulson
parents:
7403
diff
changeset
|
242 |
qed "stable_UNIV"; |
8a188ef6545e
working version with co-guarantees-leadsto results
paulson
parents:
7403
diff
changeset
|
243 |
Addsimps [stable_UNIV]; |
8a188ef6545e
working version with co-guarantees-leadsto results
paulson
parents:
7403
diff
changeset
|
244 |
|
5804
8e0a4c4fd67b
Revising the Client proof as suggested by Michel Charpentier. New lemmas
paulson
parents:
5669
diff
changeset
|
245 |
(** Union **) |
8e0a4c4fd67b
Revising the Client proof as suggested by Michel Charpentier. New lemmas
paulson
parents:
5669
diff
changeset
|
246 |
|
5069 | 247 |
Goalw [stable_def] |
5648 | 248 |
"[| F : stable A; F : stable A' |] ==> F : stable (A Un A')"; |
4776 | 249 |
by (blast_tac (claset() addIs [constrains_Un]) 1); |
250 |
qed "stable_Un"; |
|
251 |
||
5069 | 252 |
Goalw [stable_def] |
5804
8e0a4c4fd67b
Revising the Client proof as suggested by Michel Charpentier. New lemmas
paulson
parents:
5669
diff
changeset
|
253 |
"ALL i:I. F : stable (A i) ==> F : stable (UN i:I. A i)"; |
8334
7896bcbd8641
Added Tanja's Detects and Reachability theories. Also
paulson
parents:
8327
diff
changeset
|
254 |
by (blast_tac (claset() addIs [constrains_UN]) 1); |
7896bcbd8641
Added Tanja's Detects and Reachability theories. Also
paulson
parents:
8327
diff
changeset
|
255 |
bind_thm ("stable_UN", ballI RS result()); |
5804
8e0a4c4fd67b
Revising the Client proof as suggested by Michel Charpentier. New lemmas
paulson
parents:
5669
diff
changeset
|
256 |
|
8e0a4c4fd67b
Revising the Client proof as suggested by Michel Charpentier. New lemmas
paulson
parents:
5669
diff
changeset
|
257 |
(** Intersection **) |
8e0a4c4fd67b
Revising the Client proof as suggested by Michel Charpentier. New lemmas
paulson
parents:
5669
diff
changeset
|
258 |
|
8e0a4c4fd67b
Revising the Client proof as suggested by Michel Charpentier. New lemmas
paulson
parents:
5669
diff
changeset
|
259 |
Goalw [stable_def] |
8069
19b9f92ca503
working with weak LeadsTo in guarantees precondition\!
paulson
parents:
7915
diff
changeset
|
260 |
"[| F : stable A; F : stable A' |] ==> F : stable (A Int A')"; |
4776 | 261 |
by (blast_tac (claset() addIs [constrains_Int]) 1); |
262 |
qed "stable_Int"; |
|
263 |
||
5804
8e0a4c4fd67b
Revising the Client proof as suggested by Michel Charpentier. New lemmas
paulson
parents:
5669
diff
changeset
|
264 |
Goalw [stable_def] |
8e0a4c4fd67b
Revising the Client proof as suggested by Michel Charpentier. New lemmas
paulson
parents:
5669
diff
changeset
|
265 |
"ALL i:I. F : stable (A i) ==> F : stable (INT i:I. A i)"; |
8334
7896bcbd8641
Added Tanja's Detects and Reachability theories. Also
paulson
parents:
8327
diff
changeset
|
266 |
by (blast_tac (claset() addIs [constrains_INT]) 1); |
7896bcbd8641
Added Tanja's Detects and Reachability theories. Also
paulson
parents:
8327
diff
changeset
|
267 |
bind_thm ("stable_INT", ballI RS result()); |
5804
8e0a4c4fd67b
Revising the Client proof as suggested by Michel Charpentier. New lemmas
paulson
parents:
5669
diff
changeset
|
268 |
|
5277
e4297d03e5d2
A higher-level treatment of LeadsTo, minimizing use of "reachable"
paulson
parents:
5253
diff
changeset
|
269 |
Goalw [stable_def, constrains_def] |
7345 | 270 |
"[| F : stable C; F : A co (C Un A') |] ==> F : (C Un A) co (C Un A')"; |
4776 | 271 |
by (Blast_tac 1); |
5277
e4297d03e5d2
A higher-level treatment of LeadsTo, minimizing use of "reachable"
paulson
parents:
5253
diff
changeset
|
272 |
qed "stable_constrains_Un"; |
4776 | 273 |
|
5277
e4297d03e5d2
A higher-level treatment of LeadsTo, minimizing use of "reachable"
paulson
parents:
5253
diff
changeset
|
274 |
Goalw [stable_def, constrains_def] |
8069
19b9f92ca503
working with weak LeadsTo in guarantees precondition\!
paulson
parents:
7915
diff
changeset
|
275 |
"[| F : stable C; F : (C Int A) co A' |] ==> F : (C Int A) co (C Int A')"; |
4776 | 276 |
by (Blast_tac 1); |
5277
e4297d03e5d2
A higher-level treatment of LeadsTo, minimizing use of "reachable"
paulson
parents:
5253
diff
changeset
|
277 |
qed "stable_constrains_Int"; |
4776 | 278 |
|
8069
19b9f92ca503
working with weak LeadsTo in guarantees precondition\!
paulson
parents:
7915
diff
changeset
|
279 |
(*[| F : stable C; F : (C Int A) co A |] ==> F : stable (C Int A) *) |
5648 | 280 |
bind_thm ("stable_constrains_stable", stable_constrains_Int RS stableI); |
281 |
||
282 |
||
5804
8e0a4c4fd67b
Revising the Client proof as suggested by Michel Charpentier. New lemmas
paulson
parents:
5669
diff
changeset
|
283 |
(*** invariant ***) |
5648 | 284 |
|
285 |
Goal "[| Init F<=A; F: stable A |] ==> F : invariant A"; |
|
286 |
by (asm_simp_tac (simpset() addsimps [invariant_def]) 1); |
|
287 |
qed "invariantI"; |
|
288 |
||
289 |
(*Could also say "invariant A Int invariant B <= invariant (A Int B)"*) |
|
290 |
Goal "[| F : invariant A; F : invariant B |] ==> F : invariant (A Int B)"; |
|
291 |
by (auto_tac (claset(), simpset() addsimps [invariant_def, stable_Int])); |
|
292 |
qed "invariant_Int"; |
|
293 |
||
294 |
||
295 |
(*** increasing ***) |
|
296 |
||
8216 | 297 |
Goalw [increasing_def] |
298 |
"F : increasing f ==> F : stable {s. z <= f s}"; |
|
299 |
by (Blast_tac 1); |
|
300 |
qed "increasingD"; |
|
301 |
||
5648 | 302 |
Goalw [increasing_def, stable_def, constrains_def] |
6712 | 303 |
"mono g ==> increasing f <= increasing (g o f)"; |
5648 | 304 |
by Auto_tac; |
6712 | 305 |
by (blast_tac (claset() addIs [monoD, order_trans]) 1); |
306 |
qed "mono_increasing_o"; |
|
5648 | 307 |
|
8216 | 308 |
(*Holds by the theorem (Suc m <= n) = (m < n) *) |
5648 | 309 |
Goalw [increasing_def] |
8216 | 310 |
"!!z::nat. F : increasing f ==> F: stable {s. z < f s}"; |
5648 | 311 |
by (simp_tac (simpset() addsimps [Suc_le_eq RS sym]) 1); |
312 |
by (Blast_tac 1); |
|
8216 | 313 |
qed "strict_increasingD"; |
5648 | 314 |
|
315 |
||
316 |
(** The Elimination Theorem. The "free" m has become universally quantified! |
|
317 |
Should the premise be !!m instead of ALL m ? Would make it harder to use |
|
318 |
in forward proof. **) |
|
319 |
||
5069 | 320 |
Goalw [constrains_def] |
6536 | 321 |
"[| ALL m:M. F : {s. s x = m} co (B m) |] \ |
322 |
\ ==> F : {s. s x : M} co (UN m:M. B m)"; |
|
4776 | 323 |
by (Blast_tac 1); |
324 |
qed "elimination"; |
|
325 |
||
326 |
(*As above, but for the trivial case of a one-variable state, in which the |
|
327 |
state is identified with its one variable.*) |
|
5069 | 328 |
Goalw [constrains_def] |
6536 | 329 |
"(ALL m:M. F : {m} co (B m)) ==> F : M co (UN m:M. B m)"; |
4776 | 330 |
by (Blast_tac 1); |
331 |
qed "elimination_sing"; |
|
332 |
||
333 |
||
334 |
||
335 |
(*** Theoretical Results from Section 6 ***) |
|
336 |
||
5069 | 337 |
Goalw [constrains_def, strongest_rhs_def] |
6536 | 338 |
"F : A co (strongest_rhs F A )"; |
4776 | 339 |
by (Blast_tac 1); |
340 |
qed "constrains_strongest_rhs"; |
|
341 |
||
5069 | 342 |
Goalw [constrains_def, strongest_rhs_def] |
6536 | 343 |
"F : A co B ==> strongest_rhs F A <= B"; |
4776 | 344 |
by (Blast_tac 1); |
345 |
qed "strongest_rhs_is_strongest"; |