|
444
|
1 |
theory ClosedForms imports
|
|
|
2 |
"BasicIdentities"
|
|
443
|
3 |
begin
|
|
|
4 |
|
|
453
|
5 |
|
|
465
|
6 |
lemma idem_after_simp1:
|
|
|
7 |
shows "rsimp_ALTs (rdistinct (rflts [rsimp aa]) {}) = rsimp aa"
|
|
|
8 |
apply(case_tac "rsimp aa")
|
|
|
9 |
apply simp+
|
|
|
10 |
apply (metis no_alt_short_list_after_simp no_further_dB_after_simp)
|
|
|
11 |
by simp
|
|
456
|
12 |
|
|
476
|
13 |
lemma identity_wwo0:
|
|
|
14 |
shows "rsimp (rsimp_ALTs (RZERO # rs)) = rsimp (rsimp_ALTs rs)"
|
|
|
15 |
by (metis idem_after_simp1 list.exhaust list.simps(8) list.simps(9) rflts.simps(2) rsimp.simps(2) rsimp.simps(3) rsimp_ALTs.simps(1) rsimp_ALTs.simps(2) rsimp_ALTs.simps(3))
|
|
|
16 |
|
|
456
|
17 |
|
|
|
18 |
lemma distinct_removes_last:
|
|
465
|
19 |
shows "\<lbrakk>a \<in> set as\<rbrakk>
|
|
456
|
20 |
\<Longrightarrow> rdistinct as rset = rdistinct (as @ [a]) rset"
|
|
|
21 |
and "rdistinct (ab # as @ [ab]) rset1 = rdistinct (ab # as) rset1"
|
|
|
22 |
apply(induct as arbitrary: rset ab rset1 a)
|
|
|
23 |
apply simp
|
|
|
24 |
apply simp
|
|
|
25 |
apply(case_tac "aa \<in> rset")
|
|
|
26 |
apply(case_tac "a = aa")
|
|
|
27 |
apply (metis append_Cons)
|
|
|
28 |
apply simp
|
|
|
29 |
apply(case_tac "a \<in> set as")
|
|
|
30 |
apply (metis append_Cons rdistinct.simps(2) set_ConsD)
|
|
|
31 |
apply(case_tac "a = aa")
|
|
|
32 |
prefer 2
|
|
|
33 |
apply simp
|
|
|
34 |
apply (metis append_Cons)
|
|
|
35 |
apply(case_tac "ab \<in> rset1")
|
|
|
36 |
prefer 2
|
|
|
37 |
apply(subgoal_tac "rdistinct (ab # (a # as) @ [ab]) rset1 =
|
|
|
38 |
ab # (rdistinct ((a # as) @ [ab]) (insert ab rset1))")
|
|
|
39 |
prefer 2
|
|
|
40 |
apply force
|
|
|
41 |
apply(simp only:)
|
|
|
42 |
apply(subgoal_tac "rdistinct (ab # a # as) rset1 = ab # (rdistinct (a # as) (insert ab rset1))")
|
|
|
43 |
apply(simp only:)
|
|
|
44 |
apply(subgoal_tac "rdistinct ((a # as) @ [ab]) (insert ab rset1) = rdistinct (a # as) (insert ab rset1)")
|
|
|
45 |
apply blast
|
|
|
46 |
apply(case_tac "a \<in> insert ab rset1")
|
|
|
47 |
apply simp
|
|
|
48 |
apply (metis insertI1)
|
|
|
49 |
apply simp
|
|
|
50 |
apply (meson insertI1)
|
|
|
51 |
apply simp
|
|
|
52 |
apply(subgoal_tac "rdistinct ((a # as) @ [ab]) rset1 = rdistinct (a # as) rset1")
|
|
|
53 |
apply simp
|
|
|
54 |
by (metis append_Cons insert_iff insert_is_Un rdistinct.simps(2))
|
|
|
55 |
|
|
|
56 |
|
|
465
|
57 |
lemma distinct_removes_middle:
|
|
|
58 |
shows "\<lbrakk>a \<in> set as\<rbrakk>
|
|
|
59 |
\<Longrightarrow> rdistinct (as @ as2) rset = rdistinct (as @ [a] @ as2) rset"
|
|
|
60 |
and "rdistinct (ab # as @ [ab] @ as3) rset1 = rdistinct (ab # as @ as3) rset1"
|
|
|
61 |
apply(induct as arbitrary: rset rset1 ab as2 as3 a)
|
|
|
62 |
apply simp
|
|
|
63 |
apply simp
|
|
|
64 |
apply(case_tac "a \<in> rset")
|
|
|
65 |
apply simp
|
|
|
66 |
apply metis
|
|
453
|
67 |
apply simp
|
|
465
|
68 |
apply (metis insertI1)
|
|
|
69 |
apply(case_tac "a = ab")
|
|
453
|
70 |
apply simp
|
|
465
|
71 |
apply(case_tac "ab \<in> rset")
|
|
453
|
72 |
apply simp
|
|
465
|
73 |
apply presburger
|
|
|
74 |
apply (meson insertI1)
|
|
|
75 |
apply(case_tac "a \<in> rset")
|
|
|
76 |
apply (metis (no_types, opaque_lifting) Un_insert_left append_Cons insert_iff rdistinct.simps(2) sup_bot_left)
|
|
|
77 |
apply(case_tac "ab \<in> rset")
|
|
|
78 |
apply simp
|
|
|
79 |
apply (meson insert_iff)
|
|
|
80 |
apply simp
|
|
|
81 |
by (metis insertI1)
|
|
453
|
82 |
|
|
|
83 |
|
|
465
|
84 |
lemma distinct_removes_middle3:
|
|
|
85 |
shows "\<lbrakk>a \<in> set as\<rbrakk>
|
|
|
86 |
\<Longrightarrow> rdistinct (as @ a #as2) rset = rdistinct (as @ as2) rset"
|
|
|
87 |
using distinct_removes_middle(1) by fastforce
|
|
|
88 |
|
|
|
89 |
lemma distinct_removes_last2:
|
|
|
90 |
shows "\<lbrakk>a \<in> set as\<rbrakk>
|
|
|
91 |
\<Longrightarrow> rdistinct as rset = rdistinct (as @ [a]) rset"
|
|
|
92 |
by (simp add: distinct_removes_last(1))
|
|
|
93 |
|
|
|
94 |
lemma distinct_removes_middle2:
|
|
|
95 |
shows "a \<in> set as \<Longrightarrow> rdistinct (as @ [a] @ rs) {} = rdistinct (as @ rs) {}"
|
|
|
96 |
by (metis distinct_removes_middle(1))
|
|
|
97 |
|
|
|
98 |
lemma distinct_removes_list:
|
|
476
|
99 |
shows "\<lbrakk> \<forall>r \<in> set rs. r \<in> set as\<rbrakk> \<Longrightarrow> rdistinct (as @ rs) {} = rdistinct as {}"
|
|
465
|
100 |
apply(induct rs)
|
|
|
101 |
apply simp+
|
|
476
|
102 |
apply(subgoal_tac "rdistinct (as @ a # rs) {} = rdistinct (as @ rs) {}")
|
|
465
|
103 |
prefer 2
|
|
|
104 |
apply (metis append_Cons append_Nil distinct_removes_middle(1))
|
|
|
105 |
by presburger
|
|
453
|
106 |
|
|
451
|
107 |
|
|
453
|
108 |
lemma spawn_simp_rsimpalts:
|
|
|
109 |
shows "rsimp (rsimp_ALTs rs) = rsimp (rsimp_ALTs (map rsimp rs))"
|
|
|
110 |
apply(cases rs)
|
|
|
111 |
apply simp
|
|
|
112 |
apply(case_tac list)
|
|
|
113 |
apply simp
|
|
|
114 |
apply(subst rsimp_idem[symmetric])
|
|
|
115 |
apply simp
|
|
|
116 |
apply(subgoal_tac "rsimp_ALTs rs = RALTS rs")
|
|
|
117 |
apply(simp only:)
|
|
|
118 |
apply(subgoal_tac "rsimp_ALTs (map rsimp rs) = RALTS (map rsimp rs)")
|
|
|
119 |
apply(simp only:)
|
|
|
120 |
prefer 2
|
|
|
121 |
apply simp
|
|
|
122 |
prefer 2
|
|
|
123 |
using rsimp_ALTs.simps(3) apply presburger
|
|
|
124 |
apply auto
|
|
|
125 |
apply(subst rsimp_idem)+
|
|
|
126 |
by (metis comp_apply rsimp_idem)
|
|
|
127 |
|
|
|
128 |
lemma map_concat_cons:
|
|
|
129 |
shows "map f rsa @ f a # rs = map f (rsa @ [a]) @ rs"
|
|
|
130 |
by simp
|
|
|
131 |
|
|
|
132 |
lemma neg_removal_element_of:
|
|
|
133 |
shows " \<not> a \<notin> aset \<Longrightarrow> a \<in> aset"
|
|
|
134 |
by simp
|
|
|
135 |
|
|
465
|
136 |
lemma flts_removes0:
|
|
|
137 |
shows " rflts (rs @ [RZERO]) =
|
|
|
138 |
rflts rs"
|
|
|
139 |
apply(induct rs)
|
|
|
140 |
apply simp
|
|
|
141 |
by (metis append_Cons rflts.simps(2) rflts.simps(3) rflts_def_idiot)
|
|
|
142 |
|
|
|
143 |
lemma flts_keeps1:
|
|
|
144 |
shows " rflts (rs @ [RONE]) =
|
|
|
145 |
rflts rs @ [RONE] "
|
|
|
146 |
apply (induct rs)
|
|
|
147 |
apply simp
|
|
|
148 |
by (metis append.assoc append_Cons rflts.simps(2) rflts.simps(3) rflts_def_idiot)
|
|
|
149 |
|
|
|
150 |
lemma flts_keeps_others:
|
|
|
151 |
shows "\<lbrakk>a \<noteq> RZERO; \<nexists>rs1. a = RALTS rs1\<rbrakk> \<Longrightarrow>rflts (rs @ [a]) = rflts rs @ [a]"
|
|
|
152 |
apply(induct rs)
|
|
|
153 |
apply simp
|
|
|
154 |
apply (simp add: rflts_def_idiot)
|
|
|
155 |
apply(case_tac a)
|
|
|
156 |
apply simp
|
|
|
157 |
using flts_keeps1 apply blast
|
|
|
158 |
apply (metis append.assoc append_Cons rflts.simps(2) rflts.simps(3) rflts_def_idiot)
|
|
|
159 |
apply (metis append.assoc append_Cons rflts.simps(2) rflts.simps(3) rflts_def_idiot)
|
|
|
160 |
apply blast
|
|
|
161 |
by (metis append.assoc append_Cons rflts.simps(2) rflts.simps(3) rflts_def_idiot)
|
|
|
162 |
|
|
|
163 |
|
|
|
164 |
lemma rflts_def_idiot2:
|
|
|
165 |
shows "\<lbrakk>a \<noteq> RZERO; \<nexists>rs1. a = RALTS rs1; a \<in> set rs\<rbrakk> \<Longrightarrow> a \<in> set (rflts rs)"
|
|
|
166 |
apply(induct rs)
|
|
|
167 |
apply simp
|
|
|
168 |
by (metis append.assoc in_set_conv_decomp insert_iff list.simps(15) rflts.simps(2) rflts.simps(3) rflts_def_idiot)
|
|
|
169 |
|
|
|
170 |
lemma rflts_spills_last:
|
|
|
171 |
shows "a = RALTS rs \<Longrightarrow> rflts (rs1 @ [a]) = rflts rs1 @ rs"
|
|
|
172 |
apply (induct rs1)
|
|
|
173 |
apply simp
|
|
|
174 |
by (metis append.assoc append_Cons rflts.simps(2) rflts.simps(3) rflts_def_idiot)
|
|
|
175 |
|
|
|
176 |
|
|
|
177 |
lemma spilled_alts_contained:
|
|
|
178 |
shows "\<lbrakk>a = RALTS rs ; a \<in> set rs1\<rbrakk> \<Longrightarrow> \<forall>r \<in> set rs. r \<in> set (rflts rs1)"
|
|
|
179 |
apply(induct rs1)
|
|
|
180 |
apply simp
|
|
|
181 |
apply(case_tac "a = aa")
|
|
|
182 |
apply simp
|
|
|
183 |
apply(subgoal_tac " a \<in> set rs1")
|
|
|
184 |
prefer 2
|
|
|
185 |
apply (meson set_ConsD)
|
|
|
186 |
apply(case_tac aa)
|
|
|
187 |
using rflts.simps(2) apply presburger
|
|
|
188 |
apply fastforce
|
|
|
189 |
apply fastforce
|
|
|
190 |
apply fastforce
|
|
|
191 |
apply fastforce
|
|
|
192 |
by fastforce
|
|
|
193 |
|
|
|
194 |
lemma distinct_removes_duplicate_flts:
|
|
|
195 |
shows " a \<in> set rsa
|
|
|
196 |
\<Longrightarrow> rdistinct (rflts (map rsimp rsa @ [rsimp a])) {} =
|
|
|
197 |
rdistinct (rflts (map rsimp rsa)) {}"
|
|
|
198 |
apply(subgoal_tac "rsimp a \<in> set (map rsimp rsa)")
|
|
|
199 |
prefer 2
|
|
|
200 |
apply simp
|
|
|
201 |
apply(induct "rsimp a")
|
|
|
202 |
apply simp
|
|
|
203 |
using flts_removes0 apply presburger
|
|
|
204 |
apply(subgoal_tac " rdistinct (rflts (map rsimp rsa @ [rsimp a])) {} =
|
|
|
205 |
rdistinct (rflts (map rsimp rsa @ [RONE])) {}")
|
|
|
206 |
apply (simp only:)
|
|
|
207 |
apply(subst flts_keeps1)
|
|
|
208 |
apply (metis distinct_removes_last2 rflts_def_idiot2 rrexp.simps(20) rrexp.simps(6))
|
|
|
209 |
apply presburger
|
|
|
210 |
apply(subgoal_tac " rdistinct (rflts (map rsimp rsa @ [rsimp a])) {} =
|
|
|
211 |
rdistinct ((rflts (map rsimp rsa)) @ [RCHAR x]) {}")
|
|
|
212 |
apply (simp only:)
|
|
|
213 |
prefer 2
|
|
|
214 |
apply (metis flts_keeps_others rrexp.distinct(21) rrexp.distinct(3))
|
|
|
215 |
apply (metis distinct_removes_last2 rflts_def_idiot2 rrexp.distinct(21) rrexp.distinct(3))
|
|
|
216 |
|
|
|
217 |
apply (metis distinct_removes_last2 flts_keeps_others rflts_def_idiot2 rrexp.distinct(25) rrexp.distinct(5))
|
|
|
218 |
prefer 2
|
|
|
219 |
apply (metis distinct_removes_last2 flts_keeps_others flts_removes0 rflts_def_idiot2 rrexp.distinct(29))
|
|
|
220 |
apply(subgoal_tac "rflts (map rsimp rsa @ [rsimp a]) = rflts (map rsimp rsa) @ x")
|
|
|
221 |
prefer 2
|
|
|
222 |
apply (simp add: rflts_spills_last)
|
|
|
223 |
apply(simp only:)
|
|
|
224 |
apply(subgoal_tac "\<forall> r \<in> set x. r \<in> set (rflts (map rsimp rsa))")
|
|
|
225 |
prefer 2
|
|
|
226 |
using spilled_alts_contained apply presburger
|
|
|
227 |
by (metis append_self_conv distinct_removes_list in_set_conv_decomp rev_exhaust)
|
|
|
228 |
|
|
|
229 |
lemma flts_middle0:
|
|
|
230 |
shows "rflts (rsa @ RZERO # rsb) = rflts (rsa @ rsb)"
|
|
|
231 |
apply(induct rsa)
|
|
|
232 |
apply simp
|
|
|
233 |
by (metis append_Cons rflts.simps(2) rflts.simps(3) rflts_def_idiot)
|
|
|
234 |
|
|
|
235 |
lemma flts_middle01:
|
|
|
236 |
shows "rflts (rsa @ [RZERO] @ rsb) = rflts (rsa @ rsb)"
|
|
|
237 |
by (simp add: flts_middle0)
|
|
|
238 |
|
|
|
239 |
lemma flts_append1:
|
|
|
240 |
shows "\<lbrakk>a \<noteq> RZERO; \<nexists>rs1. a = RALTS rs1; a \<in> set rs\<rbrakk> \<Longrightarrow>
|
|
|
241 |
rflts (rsa @ [a] @ rsb) = rflts rsa @ [a] @ (rflts rsb)"
|
|
|
242 |
apply(induct rsa arbitrary: rsb)
|
|
|
243 |
apply simp
|
|
|
244 |
using rflts_def_idiot apply presburger
|
|
|
245 |
apply(case_tac aa)
|
|
|
246 |
apply simp+
|
|
|
247 |
done
|
|
|
248 |
|
|
|
249 |
lemma flts_append:
|
|
|
250 |
shows "rflts (rs1 @ rs2) = rflts rs1 @ rflts rs2"
|
|
|
251 |
apply(induct rs1)
|
|
|
252 |
apply simp
|
|
|
253 |
apply(case_tac a)
|
|
|
254 |
apply simp+
|
|
|
255 |
done
|
|
|
256 |
|
|
|
257 |
lemma simp_removes_duplicate1:
|
|
|
258 |
shows " a \<in> set rsa \<Longrightarrow> rsimp (RALTS (rsa @ [a])) = rsimp (RALTS (rsa))"
|
|
|
259 |
and " rsimp (RALTS (a1 # rsa @ [a1])) = rsimp (RALTS (a1 # rsa))"
|
|
|
260 |
apply(induct rsa arbitrary: a1)
|
|
|
261 |
apply simp
|
|
|
262 |
apply simp
|
|
|
263 |
prefer 2
|
|
|
264 |
apply(case_tac "a = aa")
|
|
|
265 |
apply simp
|
|
|
266 |
apply simp
|
|
|
267 |
apply (metis Cons_eq_appendI Cons_eq_map_conv distinct_removes_duplicate_flts list.set_intros(2))
|
|
|
268 |
apply (metis append_Cons append_Nil distinct_removes_duplicate_flts list.set_intros(1) list.simps(8) list.simps(9))
|
|
|
269 |
by (metis (mono_tags, lifting) append_Cons distinct_removes_duplicate_flts list.set_intros(1) list.simps(8) list.simps(9) map_append rsimp.simps(2))
|
|
|
270 |
|
|
|
271 |
lemma simp_removes_duplicate2:
|
|
|
272 |
shows "a \<in> set rsa \<Longrightarrow> rsimp (RALTS (rsa @ [a] @ rsb)) = rsimp (RALTS (rsa @ rsb))"
|
|
|
273 |
apply(induct rsb arbitrary: rsa)
|
|
|
274 |
apply simp
|
|
|
275 |
using distinct_removes_duplicate_flts apply auto[1]
|
|
|
276 |
by (metis append.assoc head_one_more_simp rsimp.simps(2) simp_flatten simp_removes_duplicate1(1))
|
|
|
277 |
|
|
|
278 |
lemma simp_removes_duplicate3:
|
|
|
279 |
shows "a \<in> set rsa \<Longrightarrow> rsimp (RALTS (rsa @ a # rsb)) = rsimp (RALTS (rsa @ rsb))"
|
|
|
280 |
using simp_removes_duplicate2 by auto
|
|
|
281 |
|
|
|
282 |
lemma distinct_removes_middle4:
|
|
|
283 |
shows "a \<in> set rsa \<Longrightarrow> rdistinct (rsa @ [a] @ rsb) rset = rdistinct (rsa @ rsb) rset"
|
|
|
284 |
using distinct_removes_middle(1) by fastforce
|
|
|
285 |
|
|
|
286 |
lemma distinct_removes_middle_list:
|
|
|
287 |
shows "\<forall>a \<in> set x. a \<in> set rsa \<Longrightarrow> rdistinct (rsa @ x @ rsb) rset = rdistinct (rsa @ rsb) rset"
|
|
|
288 |
apply(induct x)
|
|
|
289 |
apply simp
|
|
|
290 |
by (simp add: distinct_removes_middle3)
|
|
|
291 |
|
|
|
292 |
|
|
|
293 |
lemma distinct_removes_duplicate_flts2:
|
|
|
294 |
shows " a \<in> set rsa
|
|
|
295 |
\<Longrightarrow> rdistinct (rflts (rsa @ [a] @ rsb)) {} =
|
|
|
296 |
rdistinct (rflts (rsa @ rsb)) {}"
|
|
|
297 |
apply(induct a arbitrary: rsb)
|
|
|
298 |
using flts_middle01 apply presburger
|
|
|
299 |
apply(subgoal_tac "rflts (rsa @ [RONE] @ rsb) = rflts rsa @ [RONE] @ rflts rsb")
|
|
|
300 |
prefer 2
|
|
|
301 |
using flts_append1 apply blast
|
|
|
302 |
apply simp
|
|
|
303 |
apply(subgoal_tac "RONE \<in> set (rflts rsa)")
|
|
|
304 |
prefer 2
|
|
|
305 |
using rflts_def_idiot2 apply blast
|
|
|
306 |
apply(subst distinct_removes_middle3)
|
|
|
307 |
apply simp
|
|
|
308 |
using flts_append apply presburger
|
|
|
309 |
apply simp
|
|
|
310 |
apply (metis distinct_removes_middle3 flts_append in_set_conv_decomp rflts.simps(5))
|
|
|
311 |
apply (metis distinct_removes_middle(1) flts_append flts_append1 rflts_def_idiot2 rrexp.distinct(25) rrexp.distinct(5))
|
|
|
312 |
apply(subgoal_tac "rflts (rsa @ [RALTS x] @ rsb) = rflts rsa @ x @ rflts rsb")
|
|
|
313 |
prefer 2
|
|
|
314 |
apply (simp add: flts_append)
|
|
|
315 |
apply (simp only:)
|
|
|
316 |
|
|
|
317 |
apply(subgoal_tac "\<forall>r1 \<in> set x. r1 \<in> set (rflts rsa)")
|
|
|
318 |
prefer 2
|
|
|
319 |
using spilled_alts_contained apply blast
|
|
|
320 |
apply(subst flts_append)
|
|
|
321 |
using distinct_removes_middle_list apply blast
|
|
|
322 |
using distinct_removes_middle2 flts_append rflts_def_idiot2 by fastforce
|
|
|
323 |
|
|
|
324 |
|
|
|
325 |
lemma simp_removes_duplicate:
|
|
|
326 |
shows "a \<in> set rsa \<Longrightarrow> rsimp (rsimp_ALTs (rsa @ a # rs)) = rsimp (rsimp_ALTs (rsa @ rs))"
|
|
|
327 |
apply(subgoal_tac "rsimp (rsimp_ALTs (rsa @ a # rs)) = rsimp (RALTS (rsa @ a # rs))")
|
|
|
328 |
prefer 2
|
|
|
329 |
apply (smt (verit, best) Cons_eq_append_conv append_is_Nil_conv empty_set equals0D list.distinct(1) rsimp_ALTs.elims)
|
|
|
330 |
apply(simp only:)
|
|
|
331 |
apply simp
|
|
|
332 |
apply(subgoal_tac "(rdistinct (rflts (map rsimp rsa @ rsimp a # map rsimp rs)) {}) = (rdistinct (rflts (map rsimp rsa @ map rsimp rs)) {})")
|
|
|
333 |
apply(simp only:)
|
|
|
334 |
prefer 2
|
|
|
335 |
apply(subgoal_tac "rsimp a \<in> set (map rsimp rsa)")
|
|
|
336 |
prefer 2
|
|
|
337 |
apply simp
|
|
|
338 |
using distinct_removes_duplicate_flts2 apply force
|
|
|
339 |
apply(case_tac rsa)
|
|
|
340 |
apply simp
|
|
|
341 |
apply(case_tac rs)
|
|
|
342 |
apply simp
|
|
|
343 |
apply(case_tac list)
|
|
|
344 |
apply simp
|
|
|
345 |
using idem_after_simp1 apply presburger
|
|
|
346 |
apply simp+
|
|
|
347 |
apply(subgoal_tac "rsimp_ALTs (aa # list @ aaa # lista) = RALTS (aa # list @ aaa # lista)")
|
|
|
348 |
apply simp
|
|
|
349 |
using rsimpalts_conscons by presburger
|
|
467
|
350 |
|
|
|
351 |
|
|
|
352 |
|
|
|
353 |
|
|
|
354 |
lemma distinct_flts_no0:
|
|
468
|
355 |
shows " rflts (map rsimp (rdistinct rs (insert RZERO rset))) =
|
|
|
356 |
rflts (map rsimp (rdistinct rs rset)) "
|
|
|
357 |
|
|
|
358 |
apply(induct rs arbitrary: rset)
|
|
467
|
359 |
apply simp
|
|
|
360 |
apply(case_tac a)
|
|
468
|
361 |
apply simp+
|
|
|
362 |
apply (smt (verit, ccfv_SIG) rflts.simps(2) rflts.simps(3) rflts_def_idiot)
|
|
|
363 |
prefer 2
|
|
|
364 |
apply simp
|
|
|
365 |
by (smt (verit, ccfv_threshold) Un_insert_right insert_iff list.simps(9) rdistinct.simps(2) rflts.simps(2) rflts.simps(3) rflts_def_idiot rrexp.distinct(7))
|
|
|
366 |
|
|
467
|
367 |
|
|
|
368 |
|
|
471
|
369 |
|
|
|
370 |
inductive frewrite:: "rrexp list \<Rightarrow> rrexp list \<Rightarrow> bool" ("_ \<leadsto>f _" [10, 10] 10)
|
|
|
371 |
where
|
|
|
372 |
"(RZERO # rs) \<leadsto>f rs"
|
|
|
373 |
| "((RALTS rs) # rsa) \<leadsto>f (rs @ rsa)"
|
|
|
374 |
| "rs1 \<leadsto>f rs2 \<Longrightarrow> (r # rs1) \<leadsto>f (r # rs2)"
|
|
|
375 |
|
|
|
376 |
|
|
|
377 |
inductive
|
|
|
378 |
frewrites:: "rrexp list \<Rightarrow> rrexp list \<Rightarrow> bool" ("_ \<leadsto>f* _" [10, 10] 10)
|
|
|
379 |
where
|
|
473
|
380 |
[intro, simp]:"rs \<leadsto>f* rs"
|
|
|
381 |
| [intro]: "\<lbrakk>rs1 \<leadsto>f* rs2; rs2 \<leadsto>f rs3\<rbrakk> \<Longrightarrow> rs1 \<leadsto>f* rs3"
|
|
|
382 |
|
|
|
383 |
inductive grewrite:: "rrexp list \<Rightarrow> rrexp list \<Rightarrow> bool" ("_ \<leadsto>g _" [10, 10] 10)
|
|
|
384 |
where
|
|
|
385 |
"(RZERO # rs) \<leadsto>g rs"
|
|
|
386 |
| "((RALTS rs) # rsa) \<leadsto>g (rs @ rsa)"
|
|
|
387 |
| "rs1 \<leadsto>g rs2 \<Longrightarrow> (r # rs1) \<leadsto>g (r # rs2)"
|
|
|
388 |
| "rsa @ [a] @ rsb @ [a] @ rsc \<leadsto>g rsa @ [a] @ rsb @ rsc"
|
|
|
389 |
|
|
|
390 |
|
|
|
391 |
inductive
|
|
|
392 |
grewrites:: "rrexp list \<Rightarrow> rrexp list \<Rightarrow> bool" ("_ \<leadsto>g* _" [10, 10] 10)
|
|
|
393 |
where
|
|
|
394 |
[intro, simp]:"rs \<leadsto>g* rs"
|
|
|
395 |
| [intro]: "\<lbrakk>rs1 \<leadsto>g* rs2; rs2 \<leadsto>g rs3\<rbrakk> \<Longrightarrow> rs1 \<leadsto>g* rs3"
|
|
|
396 |
(*
|
|
|
397 |
inductive
|
|
|
398 |
frewrites2:: "rrexp list \<Rightarrow> rrexp list \<Rightarrow> bool" ("_ <\<leadsto>f* _" [10, 10] 10)
|
|
|
399 |
where
|
|
|
400 |
[intro]: "\<lbrakk>rs1 \<leadsto>f* rs2; rs2 \<leadsto>f* rs1\<rbrakk> \<Longrightarrow> rs1 <\<leadsto>f* rs2"
|
|
|
401 |
*)
|
|
471
|
402 |
|
|
|
403 |
lemma fr_in_rstar : "r1 \<leadsto>f r2 \<Longrightarrow> r1 \<leadsto>f* r2"
|
|
|
404 |
using frewrites.intros(1) frewrites.intros(2) by blast
|
|
|
405 |
|
|
|
406 |
lemma freal_trans[trans]:
|
|
|
407 |
assumes a1: "r1 \<leadsto>f* r2" and a2: "r2 \<leadsto>f* r3"
|
|
|
408 |
shows "r1 \<leadsto>f* r3"
|
|
|
409 |
using a2 a1
|
|
|
410 |
apply(induct r2 r3 arbitrary: r1 rule: frewrites.induct)
|
|
|
411 |
apply(auto)
|
|
|
412 |
done
|
|
|
413 |
|
|
|
414 |
|
|
|
415 |
lemma many_steps_later: "\<lbrakk>r1 \<leadsto>f r2; r2 \<leadsto>f* r3 \<rbrakk> \<Longrightarrow> r1 \<leadsto>f* r3"
|
|
|
416 |
by (meson fr_in_rstar freal_trans)
|
|
|
417 |
|
|
|
418 |
|
|
475
|
419 |
lemma gr_in_rstar : "r1 \<leadsto>g r2 \<Longrightarrow> r1 \<leadsto>g* r2"
|
|
|
420 |
using grewrites.intros(1) grewrites.intros(2) by blast
|
|
|
421 |
|
|
|
422 |
lemma greal_trans[trans]:
|
|
|
423 |
assumes a1: "r1 \<leadsto>g* r2" and a2: "r2 \<leadsto>g* r3"
|
|
|
424 |
shows "r1 \<leadsto>g* r3"
|
|
|
425 |
using a2 a1
|
|
|
426 |
apply(induct r2 r3 arbitrary: r1 rule: grewrites.induct)
|
|
|
427 |
apply(auto)
|
|
|
428 |
done
|
|
|
429 |
|
|
|
430 |
|
|
|
431 |
lemma gmany_steps_later: "\<lbrakk>r1 \<leadsto>g r2; r2 \<leadsto>g* r3 \<rbrakk> \<Longrightarrow> r1 \<leadsto>g* r3"
|
|
|
432 |
by (meson gr_in_rstar greal_trans)
|
|
|
433 |
|
|
|
434 |
|
|
|
435 |
|
|
471
|
436 |
lemma frewrite_append:
|
|
|
437 |
shows "\<lbrakk> rsa \<leadsto>f rsb \<rbrakk> \<Longrightarrow> rs @ rsa \<leadsto>f rs @ rsb"
|
|
|
438 |
apply(induct rs)
|
|
472
|
439 |
apply simp+
|
|
|
440 |
using frewrite.intros(3) by blast
|
|
475
|
441 |
|
|
|
442 |
lemma grewrite_append:
|
|
|
443 |
shows "\<lbrakk> rsa \<leadsto>g rsb \<rbrakk> \<Longrightarrow> rs @ rsa \<leadsto>g rs @ rsb"
|
|
|
444 |
apply(induct rs)
|
|
|
445 |
apply simp+
|
|
|
446 |
using grewrite.intros(3) by blast
|
|
472
|
447 |
|
|
471
|
448 |
|
|
|
449 |
|
|
|
450 |
lemma frewrites_cons:
|
|
|
451 |
shows "\<lbrakk> rsa \<leadsto>f* rsb \<rbrakk> \<Longrightarrow> r # rsa \<leadsto>f* r # rsb"
|
|
472
|
452 |
apply(induct rsa rsb rule: frewrites.induct)
|
|
|
453 |
apply simp
|
|
|
454 |
using frewrite.intros(3) by blast
|
|
471
|
455 |
|
|
|
456 |
|
|
475
|
457 |
lemma grewrites_cons:
|
|
|
458 |
shows "\<lbrakk> rsa \<leadsto>g* rsb \<rbrakk> \<Longrightarrow> r # rsa \<leadsto>g* r # rsb"
|
|
|
459 |
apply(induct rsa rsb rule: grewrites.induct)
|
|
|
460 |
apply simp
|
|
|
461 |
using grewrite.intros(3) by blast
|
|
|
462 |
|
|
|
463 |
|
|
471
|
464 |
lemma frewrites_append:
|
|
|
465 |
shows " \<lbrakk>rsa \<leadsto>f* rsb\<rbrakk> \<Longrightarrow> (rs @ rsa) \<leadsto>f* (rs @ rsb)"
|
|
472
|
466 |
apply(induct rs)
|
|
471
|
467 |
apply simp
|
|
472
|
468 |
by (simp add: frewrites_cons)
|
|
471
|
469 |
|
|
475
|
470 |
lemma grewrites_append:
|
|
|
471 |
shows " \<lbrakk>rsa \<leadsto>g* rsb\<rbrakk> \<Longrightarrow> (rs @ rsa) \<leadsto>g* (rs @ rsb)"
|
|
|
472 |
apply(induct rs)
|
|
|
473 |
apply simp
|
|
|
474 |
by (simp add: grewrites_cons)
|
|
|
475 |
|
|
471
|
476 |
|
|
|
477 |
|
|
|
478 |
lemma frewrites_concat:
|
|
|
479 |
shows "\<lbrakk>rs1 \<leadsto>f rs2; rsa \<leadsto>f* rsb \<rbrakk> \<Longrightarrow> (rs1 @ rsa) \<leadsto>f* (rs2 @ rsb)"
|
|
|
480 |
apply(induct rs1 rs2 rule: frewrite.induct)
|
|
|
481 |
apply(simp)
|
|
|
482 |
apply(subgoal_tac "(RZERO # rs @ rsa) \<leadsto>f (rs @ rsa)")
|
|
|
483 |
prefer 2
|
|
|
484 |
using frewrite.intros(1) apply blast
|
|
|
485 |
apply(subgoal_tac "(rs @ rsa) \<leadsto>f* (rs @ rsb)")
|
|
|
486 |
using many_steps_later apply blast
|
|
472
|
487 |
apply (simp add: frewrites_append)
|
|
|
488 |
apply (metis append.assoc append_Cons frewrite.intros(2) frewrites_append many_steps_later)
|
|
|
489 |
using frewrites_cons by auto
|
|
471
|
490 |
|
|
475
|
491 |
lemma grewrites_concat:
|
|
|
492 |
shows "\<lbrakk>rs1 \<leadsto>g rs2; rsa \<leadsto>g* rsb \<rbrakk> \<Longrightarrow> (rs1 @ rsa) \<leadsto>g* (rs2 @ rsb)"
|
|
|
493 |
apply(induct rs1 rs2 rule: grewrite.induct)
|
|
|
494 |
apply(simp)
|
|
|
495 |
apply(subgoal_tac "(RZERO # rs @ rsa) \<leadsto>g (rs @ rsa)")
|
|
|
496 |
prefer 2
|
|
|
497 |
using grewrite.intros(1) apply blast
|
|
|
498 |
apply(subgoal_tac "(rs @ rsa) \<leadsto>g* (rs @ rsb)")
|
|
|
499 |
using gmany_steps_later apply blast
|
|
|
500 |
apply (simp add: grewrites_append)
|
|
|
501 |
apply (metis append.assoc append_Cons grewrite.intros(2) grewrites_append gmany_steps_later)
|
|
|
502 |
using grewrites_cons apply auto
|
|
|
503 |
apply(subgoal_tac "rsaa @ a # rsba @ a # rsc @ rsa \<leadsto>g* rsaa @ a # rsba @ a # rsc @ rsb")
|
|
|
504 |
using grewrite.intros(4) grewrites.intros(2) apply force
|
|
|
505 |
using grewrites_append by auto
|
|
|
506 |
|
|
|
507 |
|
|
|
508 |
lemma grewritess_concat:
|
|
|
509 |
shows "\<lbrakk>rsa \<leadsto>g* rsb; rsc \<leadsto>g* rsd \<rbrakk> \<Longrightarrow> (rsa @ rsc) \<leadsto>g* (rsb @ rsd)"
|
|
|
510 |
apply(induct rsa rsb rule: grewrites.induct)
|
|
|
511 |
apply(case_tac rs)
|
|
|
512 |
apply simp
|
|
|
513 |
using grewrites_append apply blast
|
|
|
514 |
by (meson greal_trans grewrites.simps grewrites_concat)
|
|
|
515 |
|
|
476
|
516 |
fun alt_set:: "rrexp \<Rightarrow> rrexp set"
|
|
|
517 |
where
|
|
|
518 |
"alt_set (RALTS rs) = set rs \<union> \<Union> (alt_set ` (set rs))"
|
|
|
519 |
| "alt_set r = {r}"
|
|
|
520 |
|
|
|
521 |
lemma alt_set_has_all:
|
|
|
522 |
shows "RALTS rs \<in> alt_set rx \<Longrightarrow> set rs \<subseteq> alt_set rx"
|
|
|
523 |
apply(induct rx arbitrary: rs)
|
|
|
524 |
apply simp_all
|
|
|
525 |
apply(rename_tac rSS rss)
|
|
|
526 |
using in_mono by fastforce
|
|
|
527 |
|
|
|
528 |
|
|
|
529 |
|
|
|
530 |
|
|
|
531 |
lemma grewrite_equal_rsimp:
|
|
|
532 |
shows "\<lbrakk>rs1 \<leadsto>g rs2; rsimp_ALTs (rdistinct (rflts (map rsimp rs1)) (rset \<union> \<Union>(alt_set ` rset))) =
|
|
|
533 |
rsimp_ALTs (rdistinct (rflts (map rsimp rs2)) (rset \<union> \<Union>(alt_set ` rset)))\<rbrakk>
|
|
|
534 |
\<Longrightarrow> rsimp_ALTs (rdistinct (rflts (rsimp r # map rsimp rs1)) (rset \<union> \<Union>(alt_set ` rset))) =
|
|
|
535 |
rsimp_ALTs (rdistinct (rflts (rsimp r # map rsimp rs2)) (rset \<union> \<Union>(alt_set ` rset)))"
|
|
|
536 |
apply(induct rs1 rs2 arbitrary:rset rule: grewrite.induct)
|
|
|
537 |
apply simp
|
|
|
538 |
apply (metis append_Cons append_Nil flts_middle0)
|
|
|
539 |
apply(case_tac "rsimp r \<in> rset")
|
|
|
540 |
apply simp
|
|
|
541 |
oops
|
|
|
542 |
|
|
|
543 |
|
|
|
544 |
|
|
|
545 |
lemma grewrite_equal_rsimp:
|
|
|
546 |
shows "rs1 \<leadsto>g rs2 \<Longrightarrow> rsimp (RALTS rs1) = rsimp (RALTS rs2)"
|
|
|
547 |
apply(induct rs1 rs2 rule: grewrite.induct)
|
|
|
548 |
apply simp
|
|
|
549 |
using simp_flatten apply blast
|
|
|
550 |
prefer 2
|
|
|
551 |
apply (smt (verit) append.assoc append_Cons in_set_conv_decomp simp_removes_duplicate2)
|
|
|
552 |
apply simp
|
|
|
553 |
apply(case_tac "rdistinct (rflts (map rsimp rs1)) {}")
|
|
|
554 |
apply(case_tac "rsimp r = RZERO")
|
|
|
555 |
apply simp
|
|
|
556 |
apply(case_tac "\<exists>rs. rsimp r = RALTS rs")
|
|
|
557 |
prefer 2
|
|
|
558 |
|
|
|
559 |
apply(subgoal_tac "rdistinct (rflts (rsimp r # map rsimp rs1)) {} =
|
|
|
560 |
rsimp r # rdistinct (rflts (map rsimp rs1)) {rsimp r}")
|
|
|
561 |
prefer 2
|
|
|
562 |
apply (simp add: list.inject rflts_def_idiot)
|
|
|
563 |
apply(simp only:)
|
|
|
564 |
|
|
|
565 |
sorry
|
|
|
566 |
|
|
|
567 |
|
|
475
|
568 |
lemma grewrites_equal_rsimp:
|
|
|
569 |
shows "rs1 \<leadsto>g* rs2 \<Longrightarrow> rsimp (RALTS rs1) = rsimp (RALTS rs2)"
|
|
476
|
570 |
apply (induct rs1 rs2 rule: grewrites.induct)
|
|
475
|
571 |
apply simp
|
|
476
|
572 |
using grewrite_equal_rsimp by presburger
|
|
|
573 |
|
|
|
574 |
|
|
|
575 |
|
|
|
576 |
|
|
|
577 |
lemma grewrites_equal_simp_2:
|
|
|
578 |
shows "rsimp (RALTS rs1) = rsimp (RALTS rs2) \<Longrightarrow> rs1 \<leadsto>g* rs2"
|
|
475
|
579 |
sorry
|
|
|
580 |
|
|
476
|
581 |
lemma grewrites_last:
|
|
|
582 |
shows "r # [RALTS rs] \<leadsto>g* r # rs"
|
|
|
583 |
by (metis gr_in_rstar grewrite.intros(2) grewrite.intros(3) self_append_conv)
|
|
|
584 |
|
|
|
585 |
lemma simp_flatten2:
|
|
|
586 |
shows "rsimp (RALTS (r # [RALTS rs])) = rsimp (RALTS (r # rs))"
|
|
|
587 |
using grewrites_equal_rsimp grewrites_last by blast
|
|
475
|
588 |
|
|
473
|
589 |
lemma frewrites_middle:
|
|
|
590 |
shows "rs1 \<leadsto>f* rs2 \<Longrightarrow> r # (RALTS rs # rs1) \<leadsto>f* r # (rs @ rs1)"
|
|
|
591 |
by (simp add: fr_in_rstar frewrite.intros(2) frewrite.intros(3))
|
|
471
|
592 |
|
|
473
|
593 |
lemma frewrites_alt:
|
|
|
594 |
shows "rs1 \<leadsto>f* rs2 \<Longrightarrow> (RALT r1 r2) # rs1 \<leadsto>f* r1 # r2 # rs2"
|
|
|
595 |
by (metis Cons_eq_appendI append_self_conv2 frewrite.intros(2) frewrites_cons many_steps_later)
|
|
471
|
596 |
|
|
|
597 |
lemma early_late_der_frewrites:
|
|
|
598 |
shows "map (rder x) (rflts rs) \<leadsto>f* rflts (map (rder x) rs)"
|
|
|
599 |
apply(induct rs)
|
|
|
600 |
apply simp
|
|
|
601 |
apply(case_tac a)
|
|
|
602 |
apply simp+
|
|
|
603 |
using frewrite.intros(1) many_steps_later apply blast
|
|
|
604 |
apply(case_tac "x = x3")
|
|
472
|
605 |
apply simp
|
|
|
606 |
using frewrites_cons apply presburger
|
|
|
607 |
using frewrite.intros(1) many_steps_later apply fastforce
|
|
|
608 |
apply(case_tac "rnullable x41")
|
|
473
|
609 |
apply simp+
|
|
|
610 |
apply (simp add: frewrites_alt)
|
|
|
611 |
apply (simp add: frewrites_cons)
|
|
|
612 |
apply (simp add: frewrites_append)
|
|
|
613 |
by (simp add: frewrites_cons)
|
|
471
|
614 |
|
|
|
615 |
|
|
|
616 |
|
|
|
617 |
|
|
|
618 |
|
|
473
|
619 |
lemma with_wo0_distinct:
|
|
|
620 |
shows "rdistinct rs rset \<leadsto>f* rdistinct rs (insert RZERO rset)"
|
|
|
621 |
apply(induct rs arbitrary: rset)
|
|
|
622 |
apply simp
|
|
|
623 |
apply(case_tac a)
|
|
|
624 |
apply(case_tac "RZERO \<in> rset")
|
|
|
625 |
apply simp+
|
|
|
626 |
using fr_in_rstar frewrite.intros(1) apply presburger
|
|
|
627 |
apply (case_tac "RONE \<in> rset")
|
|
|
628 |
apply simp+
|
|
|
629 |
using frewrites_cons apply presburger
|
|
|
630 |
apply(case_tac "a \<in> rset")
|
|
|
631 |
apply simp
|
|
|
632 |
apply (simp add: frewrites_cons)
|
|
|
633 |
apply(case_tac "a \<in> rset")
|
|
|
634 |
apply simp
|
|
|
635 |
apply (simp add: frewrites_cons)
|
|
|
636 |
apply(case_tac "a \<in> rset")
|
|
|
637 |
apply simp
|
|
|
638 |
apply (simp add: frewrites_cons)
|
|
|
639 |
apply(case_tac "a \<in> rset")
|
|
|
640 |
apply simp
|
|
|
641 |
apply (simp add: frewrites_cons)
|
|
|
642 |
done
|
|
|
643 |
|
|
476
|
644 |
(*Interesting lemma: not obvious but easily proven by sledgehammer*)
|
|
473
|
645 |
|
|
476
|
646 |
|
|
|
647 |
|
|
|
648 |
|
|
|
649 |
(*lemma induction last rule not go through
|
|
|
650 |
example:
|
|
|
651 |
r #
|
|
|
652 |
rdistinct rs1
|
|
|
653 |
(insert RZERO
|
|
|
654 |
(insert r
|
|
|
655 |
(rset \<union>
|
|
|
656 |
\<Union> (alt_set `
|
|
|
657 |
rset)))) \<leadsto>g* r #
|
|
|
658 |
rdistinct rs2
|
|
|
659 |
(insert RZERO (insert r (rset \<union> \<Union> (alt_set ` rset))))
|
|
|
660 |
rs2 = [+rs] rs3 = rs,
|
|
|
661 |
r = +rs
|
|
|
662 |
[] \<leadsto>g* rs which is wrong
|
|
|
663 |
*)
|
|
473
|
664 |
lemma frewrite_with_distinct:
|
|
|
665 |
shows " \<lbrakk>rs2 \<leadsto>f rs3\<rbrakk>
|
|
|
666 |
\<Longrightarrow> rdistinct rs2
|
|
476
|
667 |
(insert RZERO (rset \<union> \<Union> (alt_set ` rset))) \<leadsto>g*
|
|
473
|
668 |
rdistinct rs3
|
|
|
669 |
(insert RZERO (rset \<union> \<Union> (alt_set ` rset)))"
|
|
476
|
670 |
apply(induct rs2 rs3 arbitrary: rset rule: frewrite.induct)
|
|
473
|
671 |
apply(case_tac "RZERO \<in> (rset \<union> \<Union> (alt_set ` rset))")
|
|
|
672 |
apply simp
|
|
|
673 |
apply simp
|
|
476
|
674 |
|
|
473
|
675 |
|
|
476
|
676 |
oops
|
|
|
677 |
|
|
469
|
678 |
|
|
|
679 |
|
|
473
|
680 |
lemma frewrites_with_distinct:
|
|
476
|
681 |
shows "\<lbrakk>rsa \<leadsto>f rsb \<rbrakk> \<Longrightarrow>
|
|
|
682 |
( (rs1 @ (rdistinct rsa (insert RZERO (set rs1 \<union> \<Union>(alt_set ` (set rs1) )))) \<leadsto>g*
|
|
|
683 |
rs1 @ (rdistinct rsb (insert RZERO (set rs1 \<union> \<Union>(alt_set ` (set rs1) )))))
|
|
|
684 |
\<or> ( rs1 @ (rdistinct rsb (insert RZERO (set rs1 \<union> \<Union>(alt_set ` (set rs1) )))) \<leadsto>g*
|
|
|
685 |
rs1 @ (rdistinct rsa (insert RZERO (set rs1 \<union> \<Union>(alt_set ` (set rs1) )))))
|
|
|
686 |
)
|
|
|
687 |
"
|
|
|
688 |
apply(induct rsa rsb arbitrary: rs1 rule: frewrite.induct)
|
|
|
689 |
apply simp
|
|
|
690 |
apply(case_tac "RALTS rs \<in> set rs1")
|
|
|
691 |
apply(subgoal_tac "set rs \<subseteq> \<Union> (alt_set `set rs1)")
|
|
|
692 |
apply (metis (full_types) Un_iff Un_insert_left
|
|
|
693 |
Un_insert_right grewrites.intros(1) le_supI2 rdistinct.simps(2) rdistinct_concat)
|
|
|
694 |
apply (metis Un_subset_iff Union_upper alt_set.simps(1) imageI)
|
|
|
695 |
|
|
|
696 |
apply(case_tac "RALTS rs \<in> \<Union> (alt_set ` set rs1)")
|
|
|
697 |
apply simp
|
|
|
698 |
apply (smt (z3) UN_insert Un_iff alt_set.simps(1) alt_set_has_all dual_order.trans grewrites.intros(1) insert_absorb rdistinct_concat subset_insertI)
|
|
|
699 |
|
|
|
700 |
|
|
|
701 |
oops
|
|
|
702 |
|
|
|
703 |
|
|
|
704 |
|
|
|
705 |
lemma rd_flts_set:
|
|
|
706 |
shows "rs1 \<leadsto>f* rs2 \<Longrightarrow> rdistinct rs1 ({RZERO} \<union> (rset \<union> \<Union>(alt_set ` rset))) \<leadsto>g*
|
|
|
707 |
rdistinct rs2 ({RZERO} \<union> (rset \<union> \<Union>(alt_set ` rset)))"
|
|
473
|
708 |
apply(induct rs1 rs2 rule: frewrites.induct)
|
|
|
709 |
apply simp
|
|
476
|
710 |
oops
|
|
|
711 |
|
|
|
712 |
lemma frewrite_simpeq:
|
|
|
713 |
shows "rs1 \<leadsto>f rs2 \<Longrightarrow> rsimp (RALTS rs1) = rsimp (RALTS rs2)"
|
|
|
714 |
apply(induct rs1 rs2 rule: frewrite.induct)
|
|
|
715 |
apply simp
|
|
|
716 |
using simp_flatten apply presburger
|
|
|
717 |
by (meson grewrites_cons grewrites_equal_rsimp grewrites_equal_simp_2)
|
|
|
718 |
|
|
|
719 |
lemma frewrite_rd_grewrites:
|
|
|
720 |
shows "rs1 \<leadsto>f rs2 \<Longrightarrow>
|
|
|
721 |
\<exists>rs3. (rs1 \<leadsto>g* rs3) \<and> (rs2 \<leadsto>g* rs3) "
|
|
|
722 |
apply(induct rs1 rs2 rule: frewrite.induct)
|
|
|
723 |
apply(rule_tac x = "rs" in exI)
|
|
|
724 |
apply(rule conjI)
|
|
|
725 |
apply(rule gr_in_rstar)
|
|
|
726 |
apply(rule grewrite.intros)
|
|
|
727 |
apply(rule grewrites.intros)
|
|
|
728 |
using grewrite.intros(2) apply blast
|
|
|
729 |
by (meson grewrites_cons)
|
|
473
|
730 |
|
|
476
|
731 |
|
|
|
732 |
lemma frewrites_rd_grewrites:
|
|
|
733 |
shows "rs1 \<leadsto>f* rs2 \<Longrightarrow>
|
|
|
734 |
\<exists>rs3. (rs1 \<leadsto>g* rs3) \<and> (rs2 \<leadsto>g* rs3)"
|
|
|
735 |
apply(induct rs1 rs2 rule: frewrites.induct)
|
|
|
736 |
apply simp
|
|
|
737 |
apply(rule exI)
|
|
|
738 |
apply(rule grewrites.intros)
|
|
|
739 |
by (metis frewrite_simpeq grewrites_equal_rsimp grewrites_equal_simp_2)
|
|
473
|
740 |
|
|
476
|
741 |
|
|
|
742 |
|
|
|
743 |
|
|
|
744 |
|
|
|
745 |
lemma frewrite_simpeq2:
|
|
|
746 |
shows "rs1 \<leadsto>f rs2 \<Longrightarrow> rsimp (RALTS (rdistinct rs1 {})) = rsimp (RALTS (rdistinct rs2 {}))"
|
|
|
747 |
apply(induct rs1 rs2 rule: frewrite.induct)
|
|
|
748 |
apply simp
|
|
|
749 |
apply (simp add: distinct_flts_no0)
|
|
|
750 |
apply simp
|
|
473
|
751 |
(*a more refined notion of \<leadsto>* is needed,
|
|
|
752 |
this lemma fails when rs1 contains some RALTS rs where elements
|
|
|
753 |
of rs appear in later parts of rs1, which will be picked up by rs2
|
|
|
754 |
and deduplicated*)
|
|
476
|
755 |
lemma frewrites_simpeq:
|
|
473
|
756 |
shows "rs1 \<leadsto>f* rs2 \<Longrightarrow>
|
|
476
|
757 |
rsimp (RALTS (rdistinct rs1 {})) = rsimp (RALTS ( rdistinct rs2 {})) "
|
|
|
758 |
apply(induct rs1 rs2 rule: frewrites.induct)
|
|
|
759 |
apply simp
|
|
|
760 |
|
|
|
761 |
sorry
|
|
|
762 |
|
|
|
763 |
|
|
473
|
764 |
|
|
|
765 |
lemma frewrite_single_step:
|
|
|
766 |
shows " rs2 \<leadsto>f rs3 \<Longrightarrow> rsimp (RALTS rs2) = rsimp (RALTS rs3)"
|
|
|
767 |
apply(induct rs2 rs3 rule: frewrite.induct)
|
|
|
768 |
apply simp
|
|
|
769 |
using simp_flatten apply blast
|
|
|
770 |
by (metis (no_types, opaque_lifting) list.simps(9) rsimp.simps(2) simp_flatten2)
|
|
|
771 |
|
|
|
772 |
lemma frewrites_equivalent_simp:
|
|
|
773 |
shows "rs1 \<leadsto>f* rs2 \<Longrightarrow> rsimp (RALTS rs1) = rsimp (RALTS rs2)"
|
|
|
774 |
apply(induct rs1 rs2 rule: frewrites.induct)
|
|
|
775 |
apply simp
|
|
|
776 |
using frewrite_single_step by presburger
|
|
|
777 |
|
|
476
|
778 |
lemma grewrite_simpalts:
|
|
|
779 |
shows " rs2 \<leadsto>g rs3 \<Longrightarrow> rsimp (rsimp_ALTs rs2) = rsimp (rsimp_ALTs rs3)"
|
|
|
780 |
apply(induct rs2 rs3 rule : grewrite.induct)
|
|
|
781 |
using identity_wwo0 apply presburger
|
|
|
782 |
apply (metis frewrite.intros(1) frewrite_single_step identity_wwo0 rsimp_ALTs.simps(3) simp_flatten)
|
|
|
783 |
apply (smt (verit, ccfv_SIG) gmany_steps_later grewrites.intros(1) grewrites_cons grewrites_equal_rsimp identity_wwo0 rsimp_ALTs.simps(3))
|
|
|
784 |
apply simp
|
|
|
785 |
apply(subst rsimp_alts_equal)
|
|
|
786 |
apply(case_tac "rsa = [] \<and> rsb = [] \<and> rsc = []")
|
|
|
787 |
apply(subgoal_tac "rsa @ a # rsb @ rsc = [a]")
|
|
|
788 |
apply (simp only:)
|
|
|
789 |
apply (metis append_Nil frewrite.intros(1) frewrite_single_step identity_wwo0 rsimp_ALTs.simps(3) simp_removes_duplicate1(2))
|
|
|
790 |
apply simp
|
|
|
791 |
by (smt (verit, best) append.assoc append_Cons frewrite.intros(1) frewrite_single_step identity_wwo0 in_set_conv_decomp rsimp_ALTs.simps(3) simp_removes_duplicate3)
|
|
|
792 |
|
|
|
793 |
|
|
|
794 |
lemma grewrites_simpalts:
|
|
|
795 |
shows " rs2 \<leadsto>g* rs3 \<Longrightarrow> rsimp (rsimp_ALTs rs2) = rsimp (rsimp_ALTs rs3)"
|
|
|
796 |
apply(induct rs2 rs3 rule: grewrites.induct)
|
|
|
797 |
apply simp
|
|
|
798 |
using grewrite_simpalts by presburger
|
|
|
799 |
(*
|
|
473
|
800 |
lemma frewrites_dB_wwo0_simp:
|
|
|
801 |
shows "rdistinct rs1 {RZERO} \<leadsto>f* rdistinct rs2 {RZERO}
|
|
|
802 |
\<Longrightarrow> rsimp (RALTS (rdistinct rs1 {})) = rsimp (RALTS (rdistinct rs2 {}))"
|
|
|
803 |
|
|
|
804 |
sorry
|
|
476
|
805 |
*)
|
|
|
806 |
lemma "rsimp (rsimp_ALTs (RZERO # rdistinct (map (rder x) (rflts rs)) {RZERO})) =
|
|
|
807 |
rsimp (rsimp_ALTs (rdistinct (map (rder x) (rflts rs)) {})) "
|
|
|
808 |
|
|
|
809 |
sorry
|
|
473
|
810 |
|
|
|
811 |
|
|
|
812 |
|
|
467
|
813 |
lemma simp_der_flts:
|
|
471
|
814 |
shows "rsimp (RALTS (rdistinct (map (rder x) (rflts rs)) {})) =
|
|
|
815 |
rsimp (RALTS (rdistinct (rflts (map (rder x) rs)) {}))"
|
|
473
|
816 |
apply(subgoal_tac "map (rder x) (rflts rs) \<leadsto>f* rflts (map (rder x) rs)")
|
|
|
817 |
apply(subgoal_tac "rdistinct (map (rder x) (rflts rs)) {RZERO}
|
|
476
|
818 |
\<leadsto>g* rdistinct ( rflts (map (rder x) rs)) {RZERO}")
|
|
473
|
819 |
apply(subgoal_tac "rsimp (RALTS (rdistinct (map (rder x) (rflts rs)) {}))
|
|
|
820 |
= rsimp (RALTS ( rdistinct ( rflts (map (rder x) rs)) {}))")
|
|
|
821 |
apply meson
|
|
476
|
822 |
apply (metis distinct_flts_no0 grewrites_equal_rsimp rsimp.simps(2))
|
|
|
823 |
sorry
|
|
|
824 |
|
|
|
825 |
|
|
|
826 |
|
|
|
827 |
|
|
|
828 |
|
|
|
829 |
|
|
|
830 |
|
|
|
831 |
|
|
|
832 |
lemma simp_der_pierce_flts_prelim:
|
|
|
833 |
shows "rsimp (rsimp_ALTs (rdistinct (map (rder x) (rflts rs)) {}))
|
|
|
834 |
= rsimp (rsimp_ALTs (rdistinct (rflts (map (rder x) rs)) {}))"
|
|
|
835 |
apply(subgoal_tac "map (rder x) (rflts rs) \<leadsto>g* rflts (map (rder x) rs)")
|
|
|
836 |
apply(subgoal_tac "rdistinct (map (rder x) (rflts rs)) {RZERO} \<leadsto>g* rdistinct (rflts (map (rder x) rs)) {RZERO}")
|
|
|
837 |
using grewrites_equal_simp_2 grewrites_simpalts simp_der_flts apply blast
|
|
|
838 |
apply (simp add: early_late_der_frewrites frewrites_with_distinct2_grewrites)
|
|
|
839 |
using early_late_der_frewrites frewrites_equivalent_simp grewrites_equal_simp_2 by blast
|
|
467
|
840 |
|
|
|
841 |
|
|
465
|
842 |
lemma simp_der_pierce_flts:
|
|
471
|
843 |
shows " rsimp (
|
|
|
844 |
rsimp_ALTs (rdistinct (map (rder x) (rflts (map (rsimp \<circ> (\<lambda>r. rders_simp r xs)) rs))) {})
|
|
|
845 |
) =
|
|
|
846 |
rsimp (
|
|
|
847 |
rsimp_ALTs (rdistinct (rflts (map (rder x) (map (rsimp \<circ> (\<lambda>r. rders_simp r xs)) rs))) {})
|
|
|
848 |
)"
|
|
476
|
849 |
using simp_der_pierce_flts_prelim by presburger
|
|
465
|
850 |
|
|
453
|
851 |
|
|
|
852 |
|
|
|
853 |
lemma simp_more_distinct:
|
|
465
|
854 |
shows "rsimp (rsimp_ALTs (rsa @ rs)) = rsimp (rsimp_ALTs (rsa @ (rdistinct rs (set rsa)))) "
|
|
467
|
855 |
|
|
|
856 |
|
|
465
|
857 |
|
|
453
|
858 |
|
|
|
859 |
sorry
|
|
|
860 |
|
|
|
861 |
lemma non_empty_list:
|
|
|
862 |
shows "a \<in> set as \<Longrightarrow> as \<noteq> []"
|
|
|
863 |
by (metis empty_iff empty_set)
|
|
|
864 |
|
|
456
|
865 |
lemma distinct_comp:
|
|
|
866 |
shows "rdistinct (rs1@rs2) {} = (rdistinct rs1 {}) @ (rdistinct rs2 (set rs1))"
|
|
|
867 |
apply(induct rs2 arbitrary: rs1)
|
|
|
868 |
apply simp
|
|
|
869 |
apply(subgoal_tac "rs1 @ a # rs2 = (rs1 @ [a]) @ rs2")
|
|
|
870 |
apply(simp only:)
|
|
|
871 |
apply(case_tac "a \<in> set rs1")
|
|
|
872 |
apply simp
|
|
|
873 |
oops
|
|
453
|
874 |
|
|
456
|
875 |
lemma instantiate1:
|
|
|
876 |
shows "\<lbrakk>\<And>ab rset1. rdistinct (ab # as) rset1 = rdistinct (ab # as @ [ab]) rset1\<rbrakk> \<Longrightarrow>
|
|
|
877 |
rdistinct (aa # as) rset = rdistinct (aa # as @ [aa]) rset"
|
|
|
878 |
apply(drule_tac x = "aa" in meta_spec)
|
|
|
879 |
apply(drule_tac x = "rset" in meta_spec)
|
|
453
|
880 |
apply simp
|
|
456
|
881 |
done
|
|
|
882 |
|
|
|
883 |
|
|
|
884 |
lemma not_head_elem:
|
|
|
885 |
shows " \<lbrakk>aa \<in> set (a # as); aa \<notin> (set as)\<rbrakk> \<Longrightarrow> a = aa"
|
|
|
886 |
|
|
|
887 |
by fastforce
|
|
|
888 |
|
|
|
889 |
(*
|
|
|
890 |
apply simp
|
|
|
891 |
apply (metis append_Cons)
|
|
|
892 |
apply(case_tac "ab \<in> rset1")
|
|
|
893 |
apply (metis (no_types, opaque_lifting) Un_insert_left append_Cons insert_iff rdistinct.simps(2) sup_bot_left)
|
|
|
894 |
apply(subgoal_tac "rdistinct (ab # (aa # as) @ [ab]) rset1 =
|
|
|
895 |
ab # (rdistinct ((aa # as) @ [ab]) (insert ab rset1))")
|
|
|
896 |
apply(simp only:)
|
|
|
897 |
apply(subgoal_tac "rdistinct (ab # aa # as) rset1 = ab # (rdistinct (aa # as) (insert ab rset1))")
|
|
|
898 |
apply(simp only:)
|
|
|
899 |
apply(subgoal_tac "rdistinct ((aa # as) @ [ab]) (insert ab rset1) = rdistinct (aa # as) (insert ab rset1)")
|
|
|
900 |
apply blast
|
|
|
901 |
*)
|
|
|
902 |
|
|
453
|
903 |
|
|
|
904 |
lemma flts_identity1:
|
|
|
905 |
shows "rflts (rs @ [RONE]) = rflts rs @ [RONE] "
|
|
|
906 |
apply(induct rs)
|
|
|
907 |
apply simp+
|
|
|
908 |
apply(case_tac a)
|
|
|
909 |
apply simp
|
|
|
910 |
apply simp+
|
|
|
911 |
done
|
|
|
912 |
|
|
|
913 |
lemma flts_identity10:
|
|
|
914 |
shows " rflts (rs @ [RCHAR c]) = rflts rs @ [RCHAR c]"
|
|
|
915 |
apply(induct rs)
|
|
|
916 |
apply simp+
|
|
|
917 |
apply(case_tac a)
|
|
|
918 |
apply simp+
|
|
|
919 |
done
|
|
|
920 |
|
|
|
921 |
lemma flts_identity11:
|
|
|
922 |
shows " rflts (rs @ [RSEQ r1 r2]) = rflts rs @ [RSEQ r1 r2]"
|
|
|
923 |
apply(induct rs)
|
|
|
924 |
apply simp+
|
|
|
925 |
apply(case_tac a)
|
|
|
926 |
apply simp+
|
|
|
927 |
done
|
|
|
928 |
|
|
|
929 |
lemma flts_identity12:
|
|
|
930 |
shows " rflts (rs @ [RSTAR r0]) = rflts rs @ [RSTAR r0]"
|
|
|
931 |
apply(induct rs)
|
|
|
932 |
apply simp+
|
|
|
933 |
apply(case_tac a)
|
|
|
934 |
apply simp+
|
|
|
935 |
done
|
|
|
936 |
|
|
|
937 |
lemma flts_identity2:
|
|
|
938 |
shows "a \<noteq> RZERO \<and> (\<forall>rs. a \<noteq> RALTS rs) \<Longrightarrow> rflts (rs @ [a]) = rflts rs @ [a]"
|
|
|
939 |
apply(case_tac a)
|
|
|
940 |
apply simp
|
|
|
941 |
using flts_identity1 apply auto[1]
|
|
|
942 |
using flts_identity10 apply blast
|
|
|
943 |
using flts_identity11 apply auto[1]
|
|
|
944 |
apply blast
|
|
|
945 |
using flts_identity12 by presburger
|
|
456
|
946 |
|
|
|
947 |
lemma flts_identity3:
|
|
|
948 |
shows "a = RZERO \<Longrightarrow> rflts (rs @ [a]) = rflts rs"
|
|
|
949 |
apply simp
|
|
|
950 |
apply(induct rs)
|
|
|
951 |
apply simp+
|
|
|
952 |
apply(case_tac aa)
|
|
|
953 |
apply simp+
|
|
|
954 |
done
|
|
|
955 |
|
|
|
956 |
lemma distinct_removes_last3:
|
|
465
|
957 |
shows "\<lbrakk>a \<in> set as\<rbrakk>
|
|
456
|
958 |
\<Longrightarrow> rdistinct as {} = rdistinct (as @ [a]) {}"
|
|
465
|
959 |
by (simp add: distinct_removes_last2)
|
|
456
|
960 |
|
|
|
961 |
lemma set_inclusion_with_flts1:
|
|
|
962 |
shows " \<lbrakk>RONE \<in> set rs\<rbrakk> \<Longrightarrow> RONE \<in> set (rflts rs)"
|
|
|
963 |
apply(induct rs)
|
|
|
964 |
apply simp
|
|
|
965 |
apply(case_tac " RONE \<in> set rs")
|
|
|
966 |
apply simp
|
|
|
967 |
apply (metis Un_upper2 insert_absorb insert_subset list.set_intros(2) rflts.simps(2) rflts.simps(3) rflts_def_idiot set_append)
|
|
|
968 |
apply(case_tac "RONE = a")
|
|
|
969 |
apply simp
|
|
|
970 |
apply simp
|
|
|
971 |
done
|
|
|
972 |
|
|
|
973 |
lemma set_inclusion_with_flts10:
|
|
|
974 |
shows " \<lbrakk>RCHAR x \<in> set rs\<rbrakk> \<Longrightarrow> RCHAR x \<in> set (rflts rs)"
|
|
|
975 |
apply(induct rs)
|
|
|
976 |
apply simp
|
|
|
977 |
apply(case_tac " RCHAR x \<in> set rs")
|
|
|
978 |
apply simp
|
|
|
979 |
apply (metis Un_upper2 insert_absorb insert_subset rflts.simps(2) rflts.simps(3) rflts_def_idiot set_append set_subset_Cons)
|
|
|
980 |
apply(case_tac "RCHAR x = a")
|
|
|
981 |
apply simp
|
|
|
982 |
apply fastforce
|
|
|
983 |
apply simp
|
|
|
984 |
done
|
|
|
985 |
|
|
|
986 |
lemma set_inclusion_with_flts11:
|
|
|
987 |
shows " \<lbrakk>RSEQ r1 r2 \<in> set rs\<rbrakk> \<Longrightarrow> RSEQ r1 r2 \<in> set (rflts rs)"
|
|
|
988 |
apply(induct rs)
|
|
|
989 |
apply simp
|
|
|
990 |
apply(case_tac " RSEQ r1 r2 \<in> set rs")
|
|
|
991 |
apply simp
|
|
|
992 |
apply (metis Un_upper2 insert_absorb insert_subset rflts.simps(2) rflts.simps(3) rflts_def_idiot set_append set_subset_Cons)
|
|
|
993 |
apply(case_tac "RSEQ r1 r2 = a")
|
|
|
994 |
apply simp
|
|
|
995 |
apply fastforce
|
|
|
996 |
apply simp
|
|
|
997 |
done
|
|
|
998 |
|
|
|
999 |
|
|
|
1000 |
lemma set_inclusion_with_flts:
|
|
|
1001 |
shows " \<lbrakk>a \<in> set as; rsimp a \<in> set (map rsimp as); rsimp a = RONE\<rbrakk> \<Longrightarrow> rsimp a \<in> set (rflts (map rsimp as))"
|
|
|
1002 |
by (simp add: set_inclusion_with_flts1)
|
|
453
|
1003 |
|
|
456
|
1004 |
lemma "\<And>x5. \<lbrakk>a \<in> set as; rsimp a \<in> set (map rsimp as); rsimp a = RALTS x5\<rbrakk>
|
|
|
1005 |
\<Longrightarrow> rsimp_ALTs (rdistinct (rflts (map rsimp as @ [rsimp a])) {}) =
|
|
|
1006 |
rsimp_ALTs (rdistinct (rflts (map rsimp as @ x5)) {})"
|
|
|
1007 |
|
|
465
|
1008 |
sorry
|
|
|
1009 |
|
|
453
|
1010 |
|
|
|
1011 |
lemma last_elem_dup1:
|
|
|
1012 |
shows " a \<in> set as \<Longrightarrow> rsimp (RALTS (as @ [a] )) = rsimp (RALTS (as ))"
|
|
|
1013 |
apply simp
|
|
|
1014 |
apply(subgoal_tac "rsimp a \<in> set (map rsimp as)")
|
|
|
1015 |
prefer 2
|
|
|
1016 |
apply simp
|
|
456
|
1017 |
apply(case_tac "rsimp a")
|
|
|
1018 |
apply simp
|
|
|
1019 |
|
|
|
1020 |
using flts_identity3 apply presburger
|
|
|
1021 |
apply(subst flts_identity2)
|
|
|
1022 |
using rrexp.distinct(1) rrexp.distinct(15) apply presburger
|
|
|
1023 |
apply(subst distinct_removes_last3[symmetric])
|
|
|
1024 |
using set_inclusion_with_flts apply blast
|
|
|
1025 |
apply simp
|
|
|
1026 |
apply (metis distinct_removes_last3 flts_identity10 set_inclusion_with_flts10)
|
|
|
1027 |
apply (metis distinct_removes_last3 flts_identity11 set_inclusion_with_flts11)
|
|
453
|
1028 |
sorry
|
|
|
1029 |
|
|
|
1030 |
lemma last_elem_dup:
|
|
|
1031 |
shows " a \<in> set as \<Longrightarrow> rsimp (rsimp_ALTs (as @ [a] )) = rsimp (rsimp_ALTs (as ))"
|
|
|
1032 |
apply(induct as rule: rev_induct)
|
|
|
1033 |
apply simp
|
|
|
1034 |
apply simp
|
|
|
1035 |
apply(subgoal_tac "xs \<noteq> []")
|
|
|
1036 |
prefer 2
|
|
|
1037 |
|
|
|
1038 |
|
|
|
1039 |
|
|
|
1040 |
|
|
|
1041 |
sorry
|
|
|
1042 |
|
|
|
1043 |
lemma appeared_before_remove_later:
|
|
|
1044 |
shows "a \<in> set as \<Longrightarrow> rsimp (rsimp_ALTs ( as @ a # rs)) = rsimp (rsimp_ALTs (as @ rs))"
|
|
|
1045 |
and "a \<in> set as \<Longrightarrow> rsimp (rsimp_ALTs as ) = rsimp (rsimp_ALTs (as @ [a]))"
|
|
|
1046 |
apply(induct rs arbitrary: as)
|
|
|
1047 |
apply simp
|
|
|
1048 |
|
|
|
1049 |
|
|
|
1050 |
sorry
|
|
|
1051 |
|
|
|
1052 |
lemma distinct_remove_later:
|
|
|
1053 |
shows "\<lbrakk>rder x a \<in> rder x ` set rsa\<rbrakk>
|
|
|
1054 |
\<Longrightarrow> rsimp (rsimp_ALTs (map (rder x) rsa @ rder x a # map (rder x) (rdistinct rs (insert a (set rsa))))) =
|
|
|
1055 |
rsimp (rsimp_ALTs (map (rder x) rsa @ map (rder x) (rdistinct rs (set rsa))))"
|
|
451
|
1056 |
|
|
|
1057 |
sorry
|
|
|
1058 |
|
|
|
1059 |
|
|
453
|
1060 |
lemma distinct_der_general:
|
|
|
1061 |
shows "rsimp (rsimp_ALTs (map (rder x) (rsa @ (rdistinct rs (set rsa))))) =
|
|
|
1062 |
rsimp ( rsimp_ALTs ((map (rder x) rsa)@(rdistinct (map (rder x) rs) (set (map (rder x) rsa)))) )"
|
|
|
1063 |
apply(induct rs arbitrary: rsa)
|
|
|
1064 |
apply simp
|
|
|
1065 |
apply(case_tac "a \<in> set rsa")
|
|
|
1066 |
apply(subgoal_tac "rder x a \<in> set (map (rder x) rsa)")
|
|
|
1067 |
apply simp
|
|
|
1068 |
apply simp
|
|
|
1069 |
apply(case_tac "rder x a \<notin> set (map (rder x) rsa)")
|
|
|
1070 |
apply(simp)
|
|
|
1071 |
apply(subst map_concat_cons)+
|
|
|
1072 |
apply(drule_tac x = "rsa @ [a]" in meta_spec)
|
|
|
1073 |
apply simp
|
|
|
1074 |
apply(drule neg_removal_element_of)
|
|
|
1075 |
apply simp
|
|
|
1076 |
apply(subst distinct_remove_later)
|
|
|
1077 |
apply simp
|
|
|
1078 |
apply(drule_tac x = "rsa" in meta_spec)
|
|
|
1079 |
by blast
|
|
|
1080 |
|
|
|
1081 |
|
|
|
1082 |
|
|
|
1083 |
|
|
451
|
1084 |
lemma distinct_der:
|
|
|
1085 |
shows "rsimp (rsimp_ALTs (map (rder x) (rdistinct rs {}))) = rsimp ( rsimp_ALTs (rdistinct (map (rder x) rs) {}))"
|
|
453
|
1086 |
by (metis distinct_der_general list.simps(8) self_append_conv2 set_empty)
|
|
451
|
1087 |
|
|
453
|
1088 |
|
|
|
1089 |
|
|
|
1090 |
|
|
|
1091 |
lemma rders_simp_lambda:
|
|
|
1092 |
shows " rsimp \<circ> rder x \<circ> (\<lambda>r. rders_simp r xs) = (\<lambda>r. rders_simp r (xs @ [x]))"
|
|
|
1093 |
using rders_simp_append by auto
|
|
451
|
1094 |
|
|
453
|
1095 |
lemma rders_simp_nonempty_simped:
|
|
|
1096 |
shows "xs \<noteq> [] \<Longrightarrow> rsimp \<circ> (\<lambda>r. rders_simp r xs) = (\<lambda>r. rders_simp r xs)"
|
|
|
1097 |
using rders_simp_same_simpders rsimp_idem by auto
|
|
|
1098 |
|
|
|
1099 |
lemma repeated_altssimp:
|
|
|
1100 |
shows "\<forall>r \<in> set rs. rsimp r = r \<Longrightarrow> rsimp (rsimp_ALTs (rdistinct (rflts rs) {})) =
|
|
|
1101 |
rsimp_ALTs (rdistinct (rflts rs) {})"
|
|
|
1102 |
by (metis map_idI rsimp.simps(2) rsimp_idem)
|
|
451
|
1103 |
|
|
465
|
1104 |
|
|
|
1105 |
lemma add0_isomorphic:
|
|
|
1106 |
shows "rsimp_ALTs (rdistinct (rflts [rsimp r, RZERO]) {}) = rsimp r"
|
|
|
1107 |
sorry
|
|
|
1108 |
|
|
|
1109 |
|
|
|
1110 |
lemma distinct_append_simp:
|
|
|
1111 |
shows " rsimp (rsimp_ALTs rs1) = rsimp (rsimp_ALTs rs2) \<Longrightarrow>
|
|
|
1112 |
rsimp (rsimp_ALTs (f a # rs1)) =
|
|
|
1113 |
rsimp (rsimp_ALTs (f a # rs2))"
|
|
|
1114 |
apply(case_tac rs1)
|
|
|
1115 |
apply simp
|
|
|
1116 |
apply(case_tac rs2)
|
|
|
1117 |
apply simp
|
|
|
1118 |
apply simp
|
|
|
1119 |
prefer 2
|
|
|
1120 |
apply(case_tac list)
|
|
|
1121 |
apply(case_tac rs2)
|
|
|
1122 |
apply simp
|
|
|
1123 |
using add0_isomorphic apply blast
|
|
|
1124 |
apply simp
|
|
467
|
1125 |
oops
|
|
465
|
1126 |
|
|
444
|
1127 |
lemma alts_closed_form: shows
|
|
|
1128 |
"rsimp (rders_simp (RALTS rs) s) =
|
|
|
1129 |
rsimp (RALTS (map (\<lambda>r. rders_simp r s) rs))"
|
|
|
1130 |
apply(induct s rule: rev_induct)
|
|
|
1131 |
apply simp
|
|
|
1132 |
apply simp
|
|
|
1133 |
apply(subst rders_simp_append)
|
|
|
1134 |
apply(subgoal_tac " rsimp (rders_simp (rders_simp (RALTS rs) xs) [x]) =
|
|
|
1135 |
rsimp(rders_simp (rsimp_ALTs (rdistinct (rflts (map (rsimp \<circ> (\<lambda>r. rders_simp r xs)) rs)) {})) [x])")
|
|
|
1136 |
prefer 2
|
|
|
1137 |
apply (metis inside_simp_removal rders_simp_one_char)
|
|
|
1138 |
apply(simp only: )
|
|
451
|
1139 |
apply(subst rders_simp_one_char)
|
|
|
1140 |
apply(subst rsimp_idem)
|
|
|
1141 |
apply(subgoal_tac "rsimp (rder x (rsimp_ALTs (rdistinct (rflts (map (rsimp \<circ> (\<lambda>r. rders_simp r xs)) rs)) {}))) =
|
|
|
1142 |
rsimp ((rsimp_ALTs (map (rder x) (rdistinct (rflts (map (rsimp \<circ> (\<lambda>r. rders_simp r xs)) rs)) {})))) ")
|
|
|
1143 |
prefer 2
|
|
|
1144 |
using rder_rsimp_ALTs_commute apply presburger
|
|
|
1145 |
apply(simp only:)
|
|
|
1146 |
apply(subgoal_tac "rsimp (rsimp_ALTs (map (rder x) (rdistinct (rflts (map (rsimp \<circ> (\<lambda>r. rders_simp r xs)) rs)) {})))
|
|
|
1147 |
= rsimp (rsimp_ALTs (rdistinct (map (rder x) (rflts (map (rsimp \<circ> (\<lambda>r. rders_simp r xs)) rs))) {}))")
|
|
|
1148 |
prefer 2
|
|
|
1149 |
|
|
|
1150 |
using distinct_der apply presburger
|
|
|
1151 |
apply(simp only:)
|
|
453
|
1152 |
apply(subgoal_tac " rsimp (rsimp_ALTs (rdistinct (map (rder x) (rflts (map (rsimp \<circ> (\<lambda>r. rders_simp r xs)) rs))) {})) =
|
|
|
1153 |
rsimp (rsimp_ALTs (rdistinct ( (rflts (map (rder x) (map (rsimp \<circ> (\<lambda>r. rders_simp r xs)) rs)))) {}))")
|
|
|
1154 |
apply(simp only:)
|
|
|
1155 |
apply(subgoal_tac " rsimp (rsimp_ALTs (rdistinct (rflts (map (rder x) (map (rsimp \<circ> (\<lambda>r. rders_simp r xs)) rs))) {})) =
|
|
|
1156 |
rsimp (rsimp_ALTs (rdistinct (rflts ( (map (rsimp \<circ> (rder x) \<circ> (\<lambda>r. rders_simp r xs)) rs))) {}))")
|
|
|
1157 |
apply(simp only:)
|
|
|
1158 |
apply(subst rders_simp_lambda)
|
|
|
1159 |
apply(subst rders_simp_nonempty_simped)
|
|
|
1160 |
apply simp
|
|
|
1161 |
apply(subgoal_tac "\<forall>r \<in> set (map (\<lambda>r. rders_simp r (xs @ [x])) rs). rsimp r = r")
|
|
|
1162 |
prefer 2
|
|
|
1163 |
apply (simp add: rders_simp_same_simpders rsimp_idem)
|
|
|
1164 |
apply(subst repeated_altssimp)
|
|
|
1165 |
apply simp
|
|
|
1166 |
apply fastforce
|
|
465
|
1167 |
apply (metis inside_simp_removal list.map_comp rder.simps(4) rsimp.simps(2) rsimp_idem)
|
|
476
|
1168 |
using simp_der_pierce_flts by blast
|
|
443
|
1169 |
|
|
444
|
1170 |
lemma alts_closed_form_variant: shows
|
|
|
1171 |
"s \<noteq> [] \<Longrightarrow> rders_simp (RALTS rs) s =
|
|
|
1172 |
rsimp (RALTS (map (\<lambda>r. rders_simp r s) rs))"
|
|
|
1173 |
sorry
|
|
443
|
1174 |
|
|
|
1175 |
|
|
|
1176 |
|
|
444
|
1177 |
lemma star_closed_form:
|
|
|
1178 |
shows "rders_simp (RSTAR r0) (c#s) =
|
|
|
1179 |
rsimp ( RALTS ( (map (\<lambda>s1. RSEQ (rders_simp r0 s1) (RSTAR r0) ) (star_updates s r0 [[c]]) ) ))"
|
|
|
1180 |
apply(induct s)
|
|
|
1181 |
apply simp
|
|
|
1182 |
sorry
|
|
443
|
1183 |
|
|
|
1184 |
|
|
|
1185 |
|
|
|
1186 |
lemma seq_closed_form: shows
|
|
|
1187 |
"rsimp (rders_simp (RSEQ r1 r2) s) =
|
|
|
1188 |
rsimp ( RALTS ( (RSEQ (rders_simp r1 s) r2) #
|
|
445
|
1189 |
(map (rders_simp r2) (vsuf s r1))
|
|
443
|
1190 |
)
|
|
|
1191 |
)"
|
|
|
1192 |
apply(induct s)
|
|
|
1193 |
apply simp
|
|
|
1194 |
sorry
|
|
|
1195 |
|
|
|
1196 |
|
|
444
|
1197 |
lemma seq_closed_form_variant: shows
|
|
|
1198 |
"s \<noteq> [] \<Longrightarrow> (rders_simp (RSEQ r1 r2) s) =
|
|
|
1199 |
rsimp (RALTS ((RSEQ (rders_simp r1 s) r2) # (map (rders_simp r2) (vsuf s r1))))"
|
|
445
|
1200 |
apply(induct s rule: rev_induct)
|
|
|
1201 |
apply simp
|
|
|
1202 |
apply(subst rders_simp_append)
|
|
|
1203 |
apply(subst rders_simp_one_char)
|
|
|
1204 |
apply(subst rsimp_idem[symmetric])
|
|
|
1205 |
apply(subst rders_simp_one_char[symmetric])
|
|
|
1206 |
apply(subst rders_simp_append[symmetric])
|
|
|
1207 |
apply(insert seq_closed_form)
|
|
|
1208 |
apply(subgoal_tac "rsimp (rders_simp (RSEQ r1 r2) (xs @ [x]))
|
|
|
1209 |
= rsimp (RALTS (RSEQ (rders_simp r1 (xs @ [x])) r2 # map (rders_simp r2) (vsuf (xs @ [x]) r1)))")
|
|
|
1210 |
apply force
|
|
|
1211 |
by presburger
|
|
443
|
1212 |
|
|
476
|
1213 |
lemma simp_helps_der_pierce:
|
|
|
1214 |
shows " rsimp
|
|
|
1215 |
(rder x
|
|
|
1216 |
(rsimp_ALTs rs)) =
|
|
|
1217 |
rsimp
|
|
|
1218 |
(rsimp_ALTs
|
|
|
1219 |
(map (rder x )
|
|
|
1220 |
rs
|
|
|
1221 |
)
|
|
|
1222 |
)"
|
|
|
1223 |
sorry
|
|
|
1224 |
|
|
444
|
1225 |
end |