| author | Christian Urban <urbanc@in.tum.de> |
| Thu, 06 Jul 2017 16:05:33 +0100 | |
| changeset 264 | e2828c4a1e23 |
| parent 263 | 00c9a95d492e |
| child 265 | d36be1e356c0 |
| permissions | -rw-r--r-- |
|
248
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
1 |
|
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
2 |
theory Positions |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
3 |
imports "Lexer" |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
4 |
begin |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
5 |
|
| 254 | 6 |
|
7 |
section {* Position in values *}
|
|
8 |
||
|
248
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
9 |
fun |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
10 |
at :: "val \<Rightarrow> nat list \<Rightarrow> val" |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
11 |
where |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
12 |
"at v [] = v" |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
13 |
| "at (Left v) (0#ps)= at v ps" |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
14 |
| "at (Right v) (Suc 0#ps)= at v ps" |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
15 |
| "at (Seq v1 v2) (0#ps)= at v1 ps" |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
16 |
| "at (Seq v1 v2) (Suc 0#ps)= at v2 ps" |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
17 |
| "at (Stars vs) (n#ps)= at (nth vs n) ps" |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
18 |
|
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
19 |
fun Pos :: "val \<Rightarrow> (nat list) set" |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
20 |
where |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
21 |
"Pos (Void) = {[]}"
|
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
22 |
| "Pos (Char c) = {[]}"
|
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
23 |
| "Pos (Left v) = {[]} \<union> {0#ps | ps. ps \<in> Pos v}"
|
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
24 |
| "Pos (Right v) = {[]} \<union> {1#ps | ps. ps \<in> Pos v}"
|
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
25 |
| "Pos (Seq v1 v2) = {[]} \<union> {0#ps | ps. ps \<in> Pos v1} \<union> {1#ps | ps. ps \<in> Pos v2}"
|
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
26 |
| "Pos (Stars []) = {[]}"
|
| 251 | 27 |
| "Pos (Stars (v#vs)) = {[]} \<union> {0#ps | ps. ps \<in> Pos v} \<union> {Suc n#ps | n ps. n#ps \<in> Pos (Stars vs)}"
|
|
248
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
28 |
|
| 253 | 29 |
lemma Pos_stars: |
30 |
"Pos (Stars vs) = {[]} \<union> (\<Union>n < length vs. {n#ps | ps. ps \<in> Pos (vs ! n)})"
|
|
31 |
apply(induct vs) |
|
32 |
apply(simp) |
|
33 |
apply(simp) |
|
34 |
apply(simp add: insert_ident) |
|
35 |
apply(rule subset_antisym) |
|
36 |
apply(auto) |
|
37 |
apply(auto)[1] |
|
38 |
using less_Suc_eq_0_disj by auto |
|
39 |
||
|
248
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
40 |
lemma Pos_empty: |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
41 |
shows "[] \<in> Pos v" |
| 251 | 42 |
by (induct v rule: Pos.induct)(auto) |
|
248
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
43 |
|
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
44 |
fun intlen :: "'a list \<Rightarrow> int" |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
45 |
where |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
46 |
"intlen [] = 0" |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
47 |
| "intlen (x#xs) = 1 + intlen xs" |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
48 |
|
| 255 | 49 |
lemma intlen_bigger: |
|
248
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
50 |
shows "0 \<le> intlen xs" |
| 251 | 51 |
by (induct xs)(auto) |
|
248
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
52 |
|
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
53 |
lemma intlen_append: |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
54 |
shows "intlen (xs @ ys) = intlen xs + intlen ys" |
| 251 | 55 |
by (induct xs arbitrary: ys) (auto) |
|
248
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
56 |
|
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
57 |
lemma intlen_length: |
| 256 | 58 |
shows "intlen xs < intlen ys \<longleftrightarrow> length xs < length ys" |
59 |
apply(induct xs arbitrary: ys) |
|
| 264 | 60 |
apply (auto simp add: intlen_bigger not_less) |
61 |
apply (metis intlen.elims intlen_bigger le_imp_0_less) |
|
62 |
apply (smt Suc_lessI intlen.simps(2) length_Suc_conv nat_neq_iff) |
|
|
248
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
63 |
by (smt Suc_lessE intlen.simps(2) length_Suc_conv) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
64 |
|
| 255 | 65 |
|
|
248
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
66 |
definition pflat_len :: "val \<Rightarrow> nat list => int" |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
67 |
where |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
68 |
"pflat_len v p \<equiv> (if p \<in> Pos v then intlen (flat (at v p)) else -1)" |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
69 |
|
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
70 |
lemma pflat_len_simps: |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
71 |
shows "pflat_len (Seq v1 v2) (0#p) = pflat_len v1 p" |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
72 |
and "pflat_len (Seq v1 v2) (Suc 0#p) = pflat_len v2 p" |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
73 |
and "pflat_len (Left v) (0#p) = pflat_len v p" |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
74 |
and "pflat_len (Left v) (Suc 0#p) = -1" |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
75 |
and "pflat_len (Right v) (Suc 0#p) = pflat_len v p" |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
76 |
and "pflat_len (Right v) (0#p) = -1" |
| 251 | 77 |
and "pflat_len (Stars (v#vs)) (Suc n#p) = pflat_len (Stars vs) (n#p)" |
78 |
and "pflat_len (Stars (v#vs)) (0#p) = pflat_len v p" |
|
|
248
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
79 |
and "pflat_len v [] = intlen (flat v)" |
| 251 | 80 |
by (auto simp add: pflat_len_def Pos_empty) |
|
248
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
81 |
|
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
82 |
lemma pflat_len_Stars_simps: |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
83 |
assumes "n < length vs" |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
84 |
shows "pflat_len (Stars vs) (n#p) = pflat_len (vs!n) p" |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
85 |
using assms |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
86 |
apply(induct vs arbitrary: n p) |
| 251 | 87 |
apply(auto simp add: less_Suc_eq_0_disj pflat_len_simps) |
|
248
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
88 |
done |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
89 |
|
| 254 | 90 |
lemma outside_lemma: |
91 |
assumes "p \<notin> Pos v1 \<union> Pos v2" |
|
92 |
shows "pflat_len v1 p = pflat_len v2 p" |
|
93 |
using assms by (auto simp add: pflat_len_def) |
|
| 252 | 94 |
|
95 |
||
96 |
section {* Orderings *}
|
|
97 |
||
98 |
||
| 257 | 99 |
definition prefix_list:: "'a list \<Rightarrow> 'a list \<Rightarrow> bool" ("_ \<sqsubseteq>pre _" [60,59] 60)
|
|
248
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
100 |
where |
| 252 | 101 |
"ps1 \<sqsubseteq>pre ps2 \<equiv> \<exists>ps'. ps1 @ps' = ps2" |
|
248
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
102 |
|
| 257 | 103 |
definition sprefix_list:: "'a list \<Rightarrow> 'a list \<Rightarrow> bool" ("_ \<sqsubset>spre _" [60,59] 60)
|
|
248
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
104 |
where |
| 252 | 105 |
"ps1 \<sqsubset>spre ps2 \<equiv> ps1 \<sqsubseteq>pre ps2 \<and> ps1 \<noteq> ps2" |
|
248
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
106 |
|
| 257 | 107 |
inductive lex_list :: "nat list \<Rightarrow> nat list \<Rightarrow> bool" ("_ \<sqsubset>lex _" [60,59] 60)
|
|
248
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
108 |
where |
| 252 | 109 |
"[] \<sqsubset>lex (p#ps)" |
|
248
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
110 |
| "ps1 \<sqsubset>lex ps2 \<Longrightarrow> (p#ps1) \<sqsubset>lex (p#ps2)" |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
111 |
| "p1 < p2 \<Longrightarrow> (p1#ps1) \<sqsubset>lex (p2#ps2)" |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
112 |
|
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
113 |
lemma lex_irrfl: |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
114 |
fixes ps1 ps2 :: "nat list" |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
115 |
assumes "ps1 \<sqsubset>lex ps2" |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
116 |
shows "ps1 \<noteq> ps2" |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
117 |
using assms |
| 257 | 118 |
by(induct rule: lex_list.induct)(auto) |
119 |
||
| 251 | 120 |
lemma lex_simps [simp]: |
|
248
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
121 |
fixes xs ys :: "nat list" |
| 251 | 122 |
shows "[] \<sqsubset>lex ys \<longleftrightarrow> ys \<noteq> []" |
123 |
and "xs \<sqsubset>lex [] \<longleftrightarrow> False" |
|
|
248
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
124 |
and "(x # xs) \<sqsubset>lex (y # ys) \<longleftrightarrow> (x < y \<or> (\<not> y < x \<and> xs \<sqsubset>lex ys))" |
| 264 | 125 |
apply(auto elim: lex_list.cases intro: lex_list.intros) |
126 |
apply(auto simp add: neq_Nil_conv not_less_iff_gr_or_eq intro: lex_list.intros) |
|
127 |
done |
|
|
248
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
128 |
|
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
129 |
lemma lex_trans: |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
130 |
fixes ps1 ps2 ps3 :: "nat list" |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
131 |
assumes "ps1 \<sqsubset>lex ps2" "ps2 \<sqsubset>lex ps3" |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
132 |
shows "ps1 \<sqsubset>lex ps3" |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
133 |
using assms |
| 264 | 134 |
by (induct arbitrary: ps3 rule: lex_list.induct) |
135 |
(auto elim: lex_list.cases) |
|
136 |
||
|
248
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
137 |
|
| 257 | 138 |
lemma lex_trichotomous: |
|
248
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
139 |
fixes p q :: "nat list" |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
140 |
shows "p = q \<or> p \<sqsubset>lex q \<or> q \<sqsubset>lex p" |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
141 |
apply(induct p arbitrary: q) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
142 |
apply(auto) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
143 |
apply(case_tac q) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
144 |
apply(auto) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
145 |
done |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
146 |
|
| 254 | 147 |
|
148 |
||
149 |
||
150 |
section {* Ordering of values according to Okui & Suzuki *}
|
|
151 |
||
|
248
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
152 |
|
| 261 | 153 |
definition PosOrd:: "val \<Rightarrow> nat list \<Rightarrow> val \<Rightarrow> bool" ("_ \<sqsubset>val _ _" [60, 60, 59] 60)
|
154 |
where |
|
| 264 | 155 |
"v1 \<sqsubset>val p v2 \<equiv> pflat_len v1 p > pflat_len v2 p \<and> |
156 |
(\<forall>q \<in> Pos v1 \<union> Pos v2. q \<sqsubset>lex p \<longrightarrow> pflat_len v1 q = pflat_len v2 q)" |
|
157 |
||
158 |
definition PosOrd2:: "val \<Rightarrow> nat list \<Rightarrow> val \<Rightarrow> bool" ("_ \<sqsubset>val2 _ _" [60, 60, 59] 60)
|
|
159 |
where |
|
160 |
"v1 \<sqsubset>val2 p v2 \<equiv> p \<in> Pos v1 \<and> |
|
| 261 | 161 |
pflat_len v1 p > pflat_len v2 p \<and> |
162 |
(\<forall>q \<in> Pos v1 \<union> Pos v2. q \<sqsubset>lex p \<longrightarrow> pflat_len v1 q = pflat_len v2 q)" |
|
163 |
||
| 264 | 164 |
lemma XXX: |
165 |
"v1 \<sqsubset>val p v2 \<longleftrightarrow> v1 \<sqsubset>val2 p v2" |
|
166 |
apply(auto simp add: PosOrd_def PosOrd2_def) |
|
167 |
apply(auto simp add: pflat_len_def split: if_splits) |
|
168 |
by (smt intlen_bigger) |
|
169 |
||
170 |
||
171 |
(* some tests *) |
|
172 |
||
| 261 | 173 |
definition ValFlat_ord:: "val \<Rightarrow> nat list \<Rightarrow> val \<Rightarrow> bool" ("_ \<sqsubset>fval _ _")
|
|
248
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
174 |
where |
| 261 | 175 |
"v1 \<sqsubset>fval p v2 \<equiv> p \<in> Pos v1 \<and> |
176 |
(p \<notin> Pos v2 \<or> flat (at v2 p) \<sqsubset>spre flat (at v1 p)) \<and> |
|
177 |
(\<forall>q \<in> Pos v1 \<union> Pos v2. q \<sqsubset>lex p \<longrightarrow> (pflat_len v1 q = pflat_len v2 q))" |
|
178 |
||
179 |
lemma |
|
180 |
assumes "v1 \<sqsubset>fval p v2" |
|
181 |
shows "v1 \<sqsubset>val p v2" |
|
182 |
using assms |
|
183 |
unfolding ValFlat_ord_def PosOrd_def |
|
184 |
apply(clarify) |
|
185 |
apply(simp add: pflat_len_def) |
|
186 |
apply(auto)[1] |
|
187 |
apply(smt intlen_bigger) |
|
188 |
apply(simp add: sprefix_list_def prefix_list_def) |
|
189 |
apply(auto)[1] |
|
190 |
apply(drule sym) |
|
191 |
apply(simp add: intlen_append) |
|
192 |
apply (metis intlen.simps(1) intlen_length length_greater_0_conv list.size(3)) |
|
193 |
apply(smt intlen_bigger) |
|
194 |
done |
|
195 |
||
196 |
lemma |
|
197 |
assumes "v1 \<sqsubset>val p v2" "flat (at v2 p) \<sqsubset>spre flat (at v1 p)" |
|
198 |
shows "v1 \<sqsubset>fval p v2" |
|
199 |
using assms |
|
200 |
unfolding ValFlat_ord_def PosOrd_def |
|
201 |
apply(clarify) |
|
| 264 | 202 |
oops |
|
248
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
203 |
|
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
204 |
|
| 261 | 205 |
definition PosOrd_ex:: "val \<Rightarrow> val \<Rightarrow> bool" ("_ :\<sqsubset>val _" [60, 59] 60)
|
|
248
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
206 |
where |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
207 |
"v1 :\<sqsubset>val v2 \<equiv> (\<exists>p. v1 \<sqsubset>val p v2)" |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
208 |
|
| 261 | 209 |
definition PosOrd_ex1:: "val \<Rightarrow> val \<Rightarrow> bool" ("_ :\<sqsubseteq>val _" [60, 59] 60)
|
|
248
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
210 |
where |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
211 |
"v1 :\<sqsubseteq>val v2 \<equiv> v1 :\<sqsubset>val v2 \<or> v1 = v2" |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
212 |
|
| 261 | 213 |
lemma PosOrd_shorterE: |
| 255 | 214 |
assumes "v1 :\<sqsubset>val v2" |
215 |
shows "length (flat v2) \<le> length (flat v1)" |
|
216 |
using assms |
|
| 261 | 217 |
apply(auto simp add: PosOrd_ex_def PosOrd_def) |
| 255 | 218 |
apply(case_tac p) |
219 |
apply(simp add: pflat_len_simps) |
|
| 257 | 220 |
apply(simp add: intlen_length) |
| 255 | 221 |
apply(simp) |
222 |
apply(drule_tac x="[]" in bspec) |
|
223 |
apply(simp add: Pos_empty) |
|
224 |
apply(simp add: pflat_len_simps) |
|
225 |
by (metis intlen_length le_less less_irrefl linear) |
|
226 |
||
227 |
||
| 261 | 228 |
lemma PosOrd_shorterI: |
|
248
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
229 |
assumes "length (flat v') < length (flat v)" |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
230 |
shows "v :\<sqsubset>val v'" |
| 251 | 231 |
using assms |
| 261 | 232 |
unfolding PosOrd_ex_def |
| 264 | 233 |
by (metis intlen_length lex_simps(2) pflat_len_simps(9) PosOrd_def) |
|
248
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
234 |
|
| 261 | 235 |
lemma PosOrd_spreI: |
|
248
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
236 |
assumes "(flat v') \<sqsubset>spre (flat v)" |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
237 |
shows "v :\<sqsubset>val v'" |
| 251 | 238 |
using assms |
| 261 | 239 |
apply(rule_tac PosOrd_shorterI) |
| 251 | 240 |
by (metis append_eq_conv_conj le_less_linear prefix_list_def sprefix_list_def take_all) |
|
248
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
241 |
|
| 261 | 242 |
lemma PosOrd_Left_Right: |
243 |
assumes "flat v1 = flat v2" |
|
244 |
shows "Left v1 :\<sqsubset>val Right v2" |
|
245 |
unfolding PosOrd_ex_def |
|
246 |
apply(rule_tac x="[0]" in exI) |
|
247 |
using assms |
|
| 264 | 248 |
apply(auto simp add: PosOrd_def pflat_len_simps) |
| 261 | 249 |
apply(smt intlen_bigger) |
250 |
done |
|
| 256 | 251 |
|
| 261 | 252 |
lemma PosOrd_LeftI: |
| 251 | 253 |
assumes "v :\<sqsubset>val v'" "flat v = flat v'" |
254 |
shows "(Left v) :\<sqsubset>val (Left v')" |
|
|
248
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
255 |
using assms(1) |
| 261 | 256 |
unfolding PosOrd_ex_def |
| 251 | 257 |
apply(auto) |
258 |
apply(rule_tac x="0#p" in exI) |
|
|
248
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
259 |
using assms(2) |
| 261 | 260 |
apply(auto simp add: PosOrd_def pflat_len_simps) |
|
248
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
261 |
done |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
262 |
|
| 261 | 263 |
lemma PosOrd_RightI: |
| 251 | 264 |
assumes "v :\<sqsubset>val v'" "flat v = flat v'" |
265 |
shows "(Right v) :\<sqsubset>val (Right v')" |
|
|
248
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
266 |
using assms(1) |
| 261 | 267 |
unfolding PosOrd_ex_def |
| 251 | 268 |
apply(auto) |
269 |
apply(rule_tac x="Suc 0#p" in exI) |
|
|
248
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
270 |
using assms(2) |
| 261 | 271 |
apply(auto simp add: PosOrd_def pflat_len_simps) |
|
248
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
272 |
done |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
273 |
|
| 261 | 274 |
lemma PosOrd_LeftE: |
| 252 | 275 |
assumes "(Left v1) :\<sqsubset>val (Left v2)" |
276 |
shows "v1 :\<sqsubset>val v2" |
|
277 |
using assms |
|
| 261 | 278 |
apply(simp add: PosOrd_ex_def) |
| 252 | 279 |
apply(erule exE) |
| 264 | 280 |
apply(case_tac p) |
| 261 | 281 |
apply(simp add: PosOrd_def) |
|
248
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
282 |
apply(auto simp add: pflat_len_simps) |
| 252 | 283 |
apply(rule_tac x="[]" in exI) |
284 |
apply(simp add: Pos_empty pflat_len_simps) |
|
| 261 | 285 |
apply(auto simp add: pflat_len_simps PosOrd_def) |
| 264 | 286 |
apply(case_tac a) |
287 |
apply(auto simp add: pflat_len_simps)[1] |
|
288 |
apply(rule_tac x="list" in exI) |
|
| 252 | 289 |
apply(auto) |
290 |
apply(drule_tac x="0#q" in bspec) |
|
291 |
apply(simp) |
|
292 |
apply(simp add: pflat_len_simps) |
|
293 |
apply(drule_tac x="0#q" in bspec) |
|
294 |
apply(simp) |
|
295 |
apply(simp add: pflat_len_simps) |
|
| 264 | 296 |
apply(simp add: pflat_len_def) |
| 252 | 297 |
done |
|
248
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
298 |
|
| 261 | 299 |
lemma PosOrd_RightE: |
| 252 | 300 |
assumes "(Right v1) :\<sqsubset>val (Right v2)" |
301 |
shows "v1 :\<sqsubset>val v2" |
|
302 |
using assms |
|
| 261 | 303 |
apply(simp add: PosOrd_ex_def) |
| 252 | 304 |
apply(erule exE) |
| 264 | 305 |
apply(case_tac p) |
| 261 | 306 |
apply(simp add: PosOrd_def) |
|
248
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
307 |
apply(auto simp add: pflat_len_simps) |
| 252 | 308 |
apply(rule_tac x="[]" in exI) |
309 |
apply(simp add: Pos_empty pflat_len_simps) |
|
| 264 | 310 |
apply(case_tac a) |
311 |
apply(simp add: pflat_len_def PosOrd_def) |
|
312 |
apply(case_tac nat) |
|
313 |
prefer 2 |
|
314 |
apply(simp add: pflat_len_def PosOrd_def) |
|
| 261 | 315 |
apply(auto simp add: pflat_len_simps PosOrd_def) |
| 264 | 316 |
apply(rule_tac x="list" in exI) |
| 252 | 317 |
apply(auto) |
318 |
apply(drule_tac x="Suc 0#q" in bspec) |
|
319 |
apply(simp) |
|
320 |
apply(simp add: pflat_len_simps) |
|
321 |
apply(drule_tac x="Suc 0#q" in bspec) |
|
322 |
apply(simp) |
|
323 |
apply(simp add: pflat_len_simps) |
|
324 |
done |
|
325 |
||
|
248
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
326 |
|
| 261 | 327 |
lemma PosOrd_SeqI1: |
| 252 | 328 |
assumes "v1 :\<sqsubset>val v1'" "flat (Seq v1 v2) = flat (Seq v1' v2')" |
329 |
shows "(Seq v1 v2) :\<sqsubset>val (Seq v1' v2')" |
|
|
248
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
330 |
using assms(1) |
| 261 | 331 |
apply(subst (asm) PosOrd_ex_def) |
332 |
apply(subst (asm) PosOrd_def) |
|
| 252 | 333 |
apply(clarify) |
| 261 | 334 |
apply(subst PosOrd_ex_def) |
| 252 | 335 |
apply(rule_tac x="0#p" in exI) |
| 261 | 336 |
apply(subst PosOrd_def) |
|
248
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
337 |
apply(rule conjI) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
338 |
apply(simp add: pflat_len_simps) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
339 |
apply(rule ballI) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
340 |
apply(rule impI) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
341 |
apply(simp only: Pos.simps) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
342 |
apply(auto)[1] |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
343 |
apply(simp add: pflat_len_simps) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
344 |
using assms(2) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
345 |
apply(simp) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
346 |
apply(auto simp add: pflat_len_simps)[2] |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
347 |
done |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
348 |
|
| 261 | 349 |
lemma PosOrd_SeqI2: |
| 252 | 350 |
assumes "v2 :\<sqsubset>val v2'" "flat v2 = flat v2'" |
351 |
shows "(Seq v v2) :\<sqsubset>val (Seq v v2')" |
|
|
248
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
352 |
using assms(1) |
| 261 | 353 |
apply(subst (asm) PosOrd_ex_def) |
354 |
apply(subst (asm) PosOrd_def) |
|
| 252 | 355 |
apply(clarify) |
| 261 | 356 |
apply(subst PosOrd_ex_def) |
| 252 | 357 |
apply(rule_tac x="Suc 0#p" in exI) |
| 261 | 358 |
apply(subst PosOrd_def) |
|
248
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
359 |
apply(rule conjI) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
360 |
apply(simp add: pflat_len_simps) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
361 |
apply(rule ballI) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
362 |
apply(rule impI) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
363 |
apply(simp only: Pos.simps) |
| 252 | 364 |
apply(auto)[1] |
365 |
apply(simp add: pflat_len_simps) |
|
366 |
using assms(2) |
|
367 |
apply(simp) |
|
368 |
apply(auto simp add: pflat_len_simps) |
|
|
248
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
369 |
done |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
370 |
|
| 261 | 371 |
lemma PosOrd_SeqE: |
| 254 | 372 |
assumes "(Seq v1 v2) :\<sqsubset>val (Seq v1' v2')" |
373 |
shows "v1 :\<sqsubset>val v1' \<or> v2 :\<sqsubset>val v2'" |
|
374 |
using assms |
|
| 261 | 375 |
apply(simp add: PosOrd_ex_def) |
| 254 | 376 |
apply(erule exE) |
377 |
apply(case_tac p) |
|
| 261 | 378 |
apply(simp add: PosOrd_def) |
| 254 | 379 |
apply(auto simp add: pflat_len_simps intlen_append)[1] |
380 |
apply(rule_tac x="[]" in exI) |
|
381 |
apply(drule_tac x="[]" in spec) |
|
382 |
apply(simp add: Pos_empty pflat_len_simps) |
|
383 |
apply(case_tac a) |
|
384 |
apply(rule disjI1) |
|
| 261 | 385 |
apply(simp add: PosOrd_def) |
| 254 | 386 |
apply(auto simp add: pflat_len_simps intlen_append)[1] |
387 |
apply(rule_tac x="list" in exI) |
|
388 |
apply(simp) |
|
389 |
apply(rule ballI) |
|
390 |
apply(rule impI) |
|
|
248
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
391 |
apply(drule_tac x="0#q" in bspec) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
392 |
apply(simp) |
| 254 | 393 |
apply(simp add: pflat_len_simps) |
394 |
apply(case_tac nat) |
|
395 |
apply(rule disjI2) |
|
| 261 | 396 |
apply(simp add: PosOrd_def) |
| 254 | 397 |
apply(auto simp add: pflat_len_simps intlen_append) |
398 |
apply(rule_tac x="list" in exI) |
|
399 |
apply(simp add: Pos_empty) |
|
400 |
apply(rule ballI) |
|
401 |
apply(rule impI) |
|
| 264 | 402 |
apply(auto)[1] |
| 254 | 403 |
apply(drule_tac x="Suc 0#q" in bspec) |
|
248
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
404 |
apply(simp) |
| 254 | 405 |
apply(simp add: pflat_len_simps) |
| 264 | 406 |
apply(drule_tac x="Suc 0#q" in bspec) |
407 |
apply(simp) |
|
408 |
apply(simp add: pflat_len_simps) |
|
409 |
apply(simp add: PosOrd_def pflat_len_def) |
|
|
248
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
410 |
done |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
411 |
|
| 261 | 412 |
lemma PosOrd_StarsI: |
| 254 | 413 |
assumes "v1 :\<sqsubset>val v2" "flat (Stars (v1#vs1)) = flat (Stars (v2#vs2))" |
414 |
shows "(Stars (v1#vs1)) :\<sqsubset>val (Stars (v2#vs2))" |
|
|
248
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
415 |
using assms(1) |
| 261 | 416 |
apply(subst (asm) PosOrd_ex_def) |
417 |
apply(subst (asm) PosOrd_def) |
|
| 254 | 418 |
apply(clarify) |
| 261 | 419 |
apply(subst PosOrd_ex_def) |
420 |
apply(subst PosOrd_def) |
|
| 254 | 421 |
apply(rule_tac x="0#p" in exI) |
422 |
apply(simp add: pflat_len_Stars_simps pflat_len_simps) |
|
423 |
using assms(2) |
|
424 |
apply(simp add: pflat_len_simps intlen_append) |
|
425 |
apply(auto simp add: pflat_len_Stars_simps pflat_len_simps) |
|
|
248
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
426 |
done |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
427 |
|
| 261 | 428 |
lemma PosOrd_StarsI2: |
| 254 | 429 |
assumes "(Stars vs1) :\<sqsubset>val (Stars vs2)" "flat (Stars vs1) = flat (Stars vs2)" |
430 |
shows "(Stars (v#vs1)) :\<sqsubset>val (Stars (v#vs2))" |
|
|
248
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
431 |
using assms(1) |
| 261 | 432 |
apply(subst (asm) PosOrd_ex_def) |
433 |
apply(subst (asm) PosOrd_def) |
|
| 254 | 434 |
apply(clarify) |
| 261 | 435 |
apply(subst PosOrd_ex_def) |
436 |
apply(subst PosOrd_def) |
|
| 254 | 437 |
apply(case_tac p) |
438 |
apply(simp add: pflat_len_simps) |
|
439 |
apply(rule_tac x="[]" in exI) |
|
440 |
apply(simp add: pflat_len_Stars_simps pflat_len_simps intlen_append) |
|
441 |
apply(rule_tac x="Suc a#list" in exI) |
|
442 |
apply(simp add: pflat_len_Stars_simps pflat_len_simps) |
|
443 |
using assms(2) |
|
444 |
apply(simp add: pflat_len_simps intlen_append) |
|
445 |
apply(auto simp add: pflat_len_Stars_simps pflat_len_simps) |
|
446 |
done |
|
447 |
||
| 261 | 448 |
lemma PosOrd_Stars_appendI: |
| 254 | 449 |
assumes "Stars vs1 :\<sqsubset>val Stars vs2" "flat (Stars vs1) = flat (Stars vs2)" |
450 |
shows "Stars (vs @ vs1) :\<sqsubset>val Stars (vs @ vs2)" |
|
451 |
using assms |
|
452 |
apply(induct vs) |
|
|
248
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
453 |
apply(simp) |
| 261 | 454 |
apply(simp add: PosOrd_StarsI2) |
| 254 | 455 |
done |
456 |
||
| 261 | 457 |
lemma PosOrd_StarsE2: |
| 254 | 458 |
assumes "Stars (v # vs1) :\<sqsubset>val Stars (v # vs2)" |
459 |
shows "Stars vs1 :\<sqsubset>val Stars vs2" |
|
460 |
using assms |
|
| 261 | 461 |
apply(subst (asm) PosOrd_ex_def) |
|
248
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
462 |
apply(erule exE) |
| 254 | 463 |
apply(case_tac p) |
464 |
apply(simp) |
|
| 261 | 465 |
apply(simp add: PosOrd_def pflat_len_simps intlen_append) |
466 |
apply(subst PosOrd_ex_def) |
|
| 254 | 467 |
apply(rule_tac x="[]" in exI) |
| 261 | 468 |
apply(simp add: PosOrd_def pflat_len_simps Pos_empty) |
| 254 | 469 |
apply(simp) |
470 |
apply(case_tac a) |
|
471 |
apply(clarify) |
|
| 264 | 472 |
apply(auto simp add: pflat_len_simps PosOrd_def pflat_len_def split: if_splits)[1] |
| 254 | 473 |
apply(clarify) |
| 261 | 474 |
apply(simp add: PosOrd_ex_def) |
| 254 | 475 |
apply(rule_tac x="nat#list" in exI) |
| 261 | 476 |
apply(auto simp add: PosOrd_def pflat_len_simps intlen_append)[1] |
| 254 | 477 |
apply(case_tac q) |
| 261 | 478 |
apply(simp add: PosOrd_def pflat_len_simps intlen_append) |
| 254 | 479 |
apply(clarify) |
480 |
apply(drule_tac x="Suc a # lista" in bspec) |
|
481 |
apply(simp) |
|
| 261 | 482 |
apply(auto simp add: PosOrd_def pflat_len_simps intlen_append)[1] |
| 254 | 483 |
apply(case_tac q) |
| 261 | 484 |
apply(simp add: PosOrd_def pflat_len_simps intlen_append) |
| 254 | 485 |
apply(clarify) |
486 |
apply(drule_tac x="Suc a # lista" in bspec) |
|
|
248
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
487 |
apply(simp) |
| 261 | 488 |
apply(auto simp add: PosOrd_def pflat_len_simps intlen_append)[1] |
| 254 | 489 |
done |
490 |
||
| 261 | 491 |
lemma PosOrd_Stars_appendE: |
| 254 | 492 |
assumes "Stars (vs @ vs1) :\<sqsubset>val Stars (vs @ vs2)" |
493 |
shows "Stars vs1 :\<sqsubset>val Stars vs2" |
|
494 |
using assms |
|
495 |
apply(induct vs) |
|
496 |
apply(simp) |
|
| 261 | 497 |
apply(simp add: PosOrd_StarsE2) |
| 254 | 498 |
done |
499 |
||
| 261 | 500 |
lemma PosOrd_Stars_append_eq: |
| 254 | 501 |
assumes "flat (Stars vs1) = flat (Stars vs2)" |
502 |
shows "Stars (vs @ vs1) :\<sqsubset>val Stars (vs @ vs2) \<longleftrightarrow> Stars vs1 :\<sqsubset>val Stars vs2" |
|
503 |
using assms |
|
504 |
apply(rule_tac iffI) |
|
| 261 | 505 |
apply(erule PosOrd_Stars_appendE) |
506 |
apply(rule PosOrd_Stars_appendI) |
|
| 254 | 507 |
apply(auto) |
|
248
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
508 |
done |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
509 |
|
| 261 | 510 |
lemma PosOrd_trans: |
|
248
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
511 |
assumes "v1 :\<sqsubset>val v2" "v2 :\<sqsubset>val v3" |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
512 |
shows "v1 :\<sqsubset>val v3" |
| 264 | 513 |
proof - |
514 |
from assms obtain p p' |
|
515 |
where as: "v1 \<sqsubset>val p v2" "v2 \<sqsubset>val p' v3" unfolding PosOrd_ex_def by blast |
|
516 |
have "p = p' \<or> p \<sqsubset>lex p' \<or> p' \<sqsubset>lex p" |
|
517 |
by (rule lex_trichotomous) |
|
518 |
moreover |
|
519 |
{ assume "p = p'"
|
|
520 |
with as have "v1 \<sqsubset>val p v3" unfolding PosOrd_def |
|
521 |
by (smt outside_lemma) |
|
522 |
then have " v1 :\<sqsubset>val v3" unfolding PosOrd_ex_def by blast |
|
523 |
} |
|
524 |
moreover |
|
525 |
{ assume "p \<sqsubset>lex p'"
|
|
526 |
with as have "v1 \<sqsubset>val p v3" unfolding PosOrd_def |
|
527 |
by (metis lex_trans outside_lemma) |
|
528 |
then have " v1 :\<sqsubset>val v3" unfolding PosOrd_ex_def by blast |
|
529 |
} |
|
530 |
moreover |
|
531 |
{ assume "p' \<sqsubset>lex p"
|
|
532 |
with as have "v1 \<sqsubset>val p' v3" unfolding PosOrd_def |
|
533 |
by (smt Un_iff intlen_bigger lex_trans pflat_len_def) |
|
534 |
then have "v1 :\<sqsubset>val v3" unfolding PosOrd_ex_def by blast |
|
535 |
} |
|
536 |
ultimately show "v1 :\<sqsubset>val v3" by blast |
|
537 |
qed |
|
538 |
||
| 254 | 539 |
|
| 261 | 540 |
lemma PosOrd_irrefl: |
| 256 | 541 |
assumes "v :\<sqsubset>val v" |
542 |
shows "False" |
|
| 264 | 543 |
using assms unfolding PosOrd_ex_def PosOrd_def |
544 |
by auto |
|
| 256 | 545 |
|
| 261 | 546 |
lemma PosOrd_almost_trichotomous: |
| 256 | 547 |
shows "v1 :\<sqsubset>val v2 \<or> v2 :\<sqsubset>val v1 \<or> (intlen (flat v1) = intlen (flat v2))" |
| 261 | 548 |
apply(auto simp add: PosOrd_ex_def) |
549 |
apply(auto simp add: PosOrd_def) |
|
| 256 | 550 |
apply(rule_tac x="[]" in exI) |
551 |
apply(auto simp add: Pos_empty pflat_len_simps) |
|
552 |
apply(drule_tac x="[]" in spec) |
|
553 |
apply(auto simp add: Pos_empty pflat_len_simps) |
|
554 |
done |
|
555 |
||
556 |
lemma WW1: |
|
557 |
assumes "v1 :\<sqsubset>val v2" "v2 :\<sqsubset>val v1" |
|
558 |
shows "False" |
|
559 |
using assms |
|
| 261 | 560 |
apply(auto simp add: PosOrd_ex_def PosOrd_def) |
| 264 | 561 |
using assms PosOrd_irrefl PosOrd_trans by blast |
| 256 | 562 |
|
563 |
lemma WW2: |
|
564 |
assumes "\<not>(v1 :\<sqsubset>val v2)" |
|
565 |
shows "v1 = v2 \<or> v2 :\<sqsubset>val v1" |
|
566 |
using assms |
|
567 |
oops |
|
568 |
||
| 261 | 569 |
lemma PosOrd_SeqE2: |
| 256 | 570 |
assumes "(Seq v1 v2) :\<sqsubset>val (Seq v1' v2')" |
571 |
shows "v1 :\<sqsubset>val v1' \<or> (v1 = v1' \<and> v2 :\<sqsubset>val v2')" |
|
572 |
using assms |
|
| 261 | 573 |
apply(frule_tac PosOrd_SeqE) |
| 256 | 574 |
apply(erule disjE) |
575 |
apply(simp) |
|
576 |
apply(auto) |
|
577 |
apply(case_tac "v1 :\<sqsubset>val v1'") |
|
578 |
apply(simp) |
|
| 261 | 579 |
apply(auto simp add: PosOrd_ex_def) |
| 256 | 580 |
apply(case_tac "v1 = v1'") |
581 |
apply(simp) |
|
582 |
oops |
|
| 254 | 583 |
|
584 |
section {* CPT and CPTpre *}
|
|
|
248
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
585 |
|
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
586 |
|
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
587 |
inductive |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
588 |
CPrf :: "val \<Rightarrow> rexp \<Rightarrow> bool" ("\<Turnstile> _ : _" [100, 100] 100)
|
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
589 |
where |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
590 |
"\<lbrakk>\<Turnstile> v1 : r1; \<Turnstile> v2 : r2\<rbrakk> \<Longrightarrow> \<Turnstile> Seq v1 v2 : SEQ r1 r2" |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
591 |
| "\<Turnstile> v1 : r1 \<Longrightarrow> \<Turnstile> Left v1 : ALT r1 r2" |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
592 |
| "\<Turnstile> v2 : r2 \<Longrightarrow> \<Turnstile> Right v2 : ALT r1 r2" |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
593 |
| "\<Turnstile> Void : ONE" |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
594 |
| "\<Turnstile> Char c : CHAR c" |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
595 |
| "\<Turnstile> Stars [] : STAR r" |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
596 |
| "\<lbrakk>\<Turnstile> v : r; flat v \<noteq> []; \<Turnstile> Stars vs : STAR r\<rbrakk> \<Longrightarrow> \<Turnstile> Stars (v # vs) : STAR r" |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
597 |
|
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
598 |
lemma Prf_CPrf: |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
599 |
assumes "\<Turnstile> v : r" |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
600 |
shows "\<turnstile> v : r" |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
601 |
using assms |
| 254 | 602 |
by (induct) (auto intro: Prf.intros) |
603 |
||
| 256 | 604 |
lemma pflat_len_equal_iff: |
605 |
assumes "\<Turnstile> v1 : r" "\<Turnstile> v2 : r" |
|
606 |
and "\<forall>p. pflat_len v1 p = pflat_len v2 p" |
|
607 |
shows "v1 = v2" |
|
608 |
using assms |
|
609 |
apply(induct v1 r arbitrary: v2 rule: CPrf.induct) |
|
610 |
apply(rotate_tac 4) |
|
611 |
apply(erule CPrf.cases) |
|
612 |
apply(simp_all)[7] |
|
613 |
apply (metis pflat_len_simps(1) pflat_len_simps(2)) |
|
614 |
apply(rotate_tac 2) |
|
615 |
apply(erule CPrf.cases) |
|
616 |
apply(simp_all)[7] |
|
617 |
apply (metis pflat_len_simps(3)) |
|
618 |
apply (metis intlen.simps(1) intlen_length length_greater_0_conv list.size(3) neg_0_le_iff_le not_less not_less_iff_gr_or_eq not_one_le_zero pflat_len_simps(3) pflat_len_simps(6) pflat_len_simps(9)) |
|
619 |
apply(rotate_tac 2) |
|
620 |
apply(erule CPrf.cases) |
|
621 |
apply(simp_all)[7] |
|
622 |
apply (metis intlen.simps(1) intlen_length length_greater_0_conv list.size(3) neg_0_le_iff_le not_less not_less_iff_gr_or_eq not_one_le_zero pflat_len_simps(3) pflat_len_simps(6) pflat_len_simps(9)) |
|
623 |
apply (metis pflat_len_simps(5)) |
|
624 |
apply(erule CPrf.cases) |
|
625 |
apply(simp_all)[7] |
|
626 |
apply(erule CPrf.cases) |
|
627 |
apply(simp_all)[7] |
|
628 |
apply(erule CPrf.cases) |
|
629 |
apply(simp_all)[7] |
|
630 |
apply (metis append_Cons flat.simps(6) flat.simps(7) intlen_length length_greater_0_conv neq_Nil_conv not_less_iff_gr_or_eq pflat_len_simps(9)) |
|
631 |
apply(rotate_tac 5) |
|
632 |
apply(erule CPrf.cases) |
|
633 |
apply(simp_all)[7] |
|
634 |
apply (metis append_Cons flat.simps(6) flat.simps(7) intlen_length length_greater_0_conv list.distinct(1) list.exhaust not_less_iff_gr_or_eq pflat_len_simps(9)) |
|
635 |
apply(auto) |
|
636 |
apply (metis pflat_len_simps(8)) |
|
637 |
apply(subgoal_tac "v = va") |
|
638 |
prefer 2 |
|
639 |
apply (metis pflat_len_simps(8)) |
|
640 |
apply(simp) |
|
641 |
apply(rotate_tac 3) |
|
642 |
apply(drule_tac x="Stars vsa" in meta_spec) |
|
643 |
apply(simp) |
|
644 |
apply(drule_tac meta_mp) |
|
645 |
apply(rule allI) |
|
646 |
apply(case_tac p) |
|
647 |
apply(simp add: pflat_len_simps) |
|
648 |
apply(drule_tac x="[]" in spec) |
|
649 |
apply(simp add: pflat_len_simps intlen_append) |
|
650 |
apply(drule_tac x="Suc a#list" in spec) |
|
651 |
apply(simp add: pflat_len_simps intlen_append) |
|
652 |
apply(simp) |
|
653 |
done |
|
654 |
||
| 261 | 655 |
lemma PosOrd_trichotomous_stronger: |
| 256 | 656 |
assumes "\<Turnstile> v1 : r" "\<Turnstile> v2 : r" |
657 |
shows "v1 :\<sqsubset>val v2 \<or> v2 :\<sqsubset>val v1 \<or> (v1 = v2)" |
|
658 |
oops |
|
659 |
||
| 254 | 660 |
lemma CPrf_stars: |
661 |
assumes "\<Turnstile> Stars vs : STAR r" |
|
662 |
shows "\<forall>v \<in> set vs. flat v \<noteq> [] \<and> \<Turnstile> v : r" |
|
663 |
using assms |
|
664 |
apply(induct vs) |
|
665 |
apply(auto) |
|
666 |
apply(erule CPrf.cases) |
|
667 |
apply(simp_all) |
|
668 |
apply(erule CPrf.cases) |
|
669 |
apply(simp_all) |
|
670 |
apply(erule CPrf.cases) |
|
671 |
apply(simp_all) |
|
672 |
apply(erule CPrf.cases) |
|
673 |
apply(simp_all) |
|
|
248
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
674 |
done |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
675 |
|
| 254 | 676 |
lemma CPrf_Stars_appendE: |
677 |
assumes "\<Turnstile> Stars (vs1 @ vs2) : STAR r" |
|
678 |
shows "\<Turnstile> Stars vs1 : STAR r \<and> \<Turnstile> Stars vs2 : STAR r" |
|
679 |
using assms |
|
680 |
apply(induct vs1 arbitrary: vs2) |
|
681 |
apply(auto intro: CPrf.intros)[1] |
|
682 |
apply(erule CPrf.cases) |
|
683 |
apply(simp_all) |
|
684 |
apply(auto intro: CPrf.intros) |
|
685 |
done |
|
686 |
||
687 |
definition PT :: "rexp \<Rightarrow> string \<Rightarrow> val set" |
|
688 |
where "PT r s \<equiv> {v. flat v = s \<and> \<turnstile> v : r}"
|
|
689 |
||
|
248
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
690 |
definition |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
691 |
"CPT r s = {v. flat v = s \<and> \<Turnstile> v : r}"
|
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
692 |
|
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
693 |
definition |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
694 |
"CPTpre r s = {v. \<exists>s'. flat v @ s' = s \<and> \<Turnstile> v : r}"
|
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
695 |
|
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
696 |
lemma CPT_CPTpre_subset: |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
697 |
shows "CPT r s \<subseteq> CPTpre r s" |
| 254 | 698 |
by(auto simp add: CPT_def CPTpre_def) |
|
248
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
699 |
|
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
700 |
lemma CPTpre_subsets: |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
701 |
"CPTpre ZERO s = {}"
|
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
702 |
"CPTpre ONE s \<subseteq> {Void}"
|
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
703 |
"CPTpre (CHAR c) s \<subseteq> {Char c}"
|
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
704 |
"CPTpre (ALT r1 r2) s \<subseteq> Left ` CPTpre r1 s \<union> Right ` CPTpre r2 s" |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
705 |
"CPTpre (SEQ r1 r2) s \<subseteq> {Seq v1 v2 | v1 v2. v1 \<in> CPTpre r1 s \<and> v2 \<in> CPTpre r2 (drop (length (flat v1)) s)}"
|
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
706 |
"CPTpre (STAR r) s \<subseteq> {Stars []} \<union>
|
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
707 |
{Stars (v#vs) | v vs. v \<in> CPTpre r s \<and> flat v \<noteq> [] \<and> Stars vs \<in> CPTpre (STAR r) (drop (length (flat v)) s)}"
|
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
708 |
"CPTpre (STAR r) [] = {Stars []}"
|
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
709 |
apply(auto simp add: CPTpre_def) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
710 |
apply(erule CPrf.cases) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
711 |
apply(simp_all) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
712 |
apply(erule CPrf.cases) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
713 |
apply(simp_all) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
714 |
apply(erule CPrf.cases) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
715 |
apply(simp_all) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
716 |
apply(erule CPrf.cases) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
717 |
apply(simp_all) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
718 |
apply(erule CPrf.cases) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
719 |
apply(simp_all) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
720 |
apply(erule CPrf.cases) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
721 |
apply(simp_all) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
722 |
apply(erule CPrf.cases) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
723 |
apply(simp_all) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
724 |
apply(rule CPrf.intros) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
725 |
done |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
726 |
|
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
727 |
|
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
728 |
lemma CPTpre_simps: |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
729 |
shows "CPTpre ONE s = {Void}"
|
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
730 |
and "CPTpre (CHAR c) (d#s) = (if c = d then {Char c} else {})"
|
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
731 |
and "CPTpre (ALT r1 r2) s = Left ` CPTpre r1 s \<union> Right ` CPTpre r2 s" |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
732 |
and "CPTpre (SEQ r1 r2) s = |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
733 |
{Seq v1 v2 | v1 v2. v1 \<in> CPTpre r1 s \<and> v2 \<in> CPTpre r2 (drop (length (flat v1)) s)}"
|
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
734 |
apply - |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
735 |
apply(rule subset_antisym) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
736 |
apply(rule CPTpre_subsets) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
737 |
apply(auto simp add: CPTpre_def intro: "CPrf.intros")[1] |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
738 |
apply(case_tac "c = d") |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
739 |
apply(simp) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
740 |
apply(rule subset_antisym) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
741 |
apply(rule CPTpre_subsets) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
742 |
apply(auto simp add: CPTpre_def intro: CPrf.intros)[1] |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
743 |
apply(simp) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
744 |
apply(auto simp add: CPTpre_def intro: CPrf.intros)[1] |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
745 |
apply(erule CPrf.cases) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
746 |
apply(simp_all) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
747 |
apply(rule subset_antisym) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
748 |
apply(rule CPTpre_subsets) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
749 |
apply(auto simp add: CPTpre_def intro: CPrf.intros)[1] |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
750 |
apply(rule subset_antisym) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
751 |
apply(rule CPTpre_subsets) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
752 |
apply(auto simp add: CPTpre_def intro: CPrf.intros)[1] |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
753 |
done |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
754 |
|
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
755 |
lemma CPT_simps: |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
756 |
shows "CPT ONE s = (if s = [] then {Void} else {})"
|
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
757 |
and "CPT (CHAR c) [d] = (if c = d then {Char c} else {})"
|
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
758 |
and "CPT (ALT r1 r2) s = Left ` CPT r1 s \<union> Right ` CPT r2 s" |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
759 |
and "CPT (SEQ r1 r2) s = |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
760 |
{Seq v1 v2 | v1 v2 s1 s2. s1 @ s2 = s \<and> v1 \<in> CPT r1 s1 \<and> v2 \<in> CPT r2 s2}"
|
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
761 |
apply - |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
762 |
apply(rule subset_antisym) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
763 |
apply(auto simp add: CPT_def)[1] |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
764 |
apply(erule CPrf.cases) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
765 |
apply(simp_all)[7] |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
766 |
apply(erule CPrf.cases) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
767 |
apply(simp_all)[7] |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
768 |
apply(auto simp add: CPT_def intro: CPrf.intros)[1] |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
769 |
apply(auto simp add: CPT_def intro: CPrf.intros)[1] |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
770 |
apply(erule CPrf.cases) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
771 |
apply(simp_all)[7] |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
772 |
apply(erule CPrf.cases) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
773 |
apply(simp_all)[7] |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
774 |
apply(auto simp add: CPT_def image_def intro: CPrf.intros)[1] |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
775 |
apply(erule CPrf.cases) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
776 |
apply(simp_all)[7] |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
777 |
apply(clarify) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
778 |
apply blast |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
779 |
apply(auto simp add: CPT_def image_def intro: CPrf.intros)[1] |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
780 |
apply(erule CPrf.cases) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
781 |
apply(simp_all)[7] |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
782 |
done |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
783 |
|
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
784 |
lemma test: |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
785 |
assumes "finite A" |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
786 |
shows "finite {vs. Stars vs \<in> A}"
|
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
787 |
using assms |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
788 |
apply(induct A) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
789 |
apply(simp) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
790 |
apply(auto) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
791 |
apply(case_tac x) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
792 |
apply(simp_all) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
793 |
done |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
794 |
|
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
795 |
lemma CPTpre_STAR_finite: |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
796 |
assumes "\<And>s. finite (CPTpre r s)" |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
797 |
shows "finite (CPTpre (STAR r) s)" |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
798 |
apply(induct s rule: length_induct) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
799 |
apply(case_tac xs) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
800 |
apply(simp) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
801 |
apply(simp add: CPTpre_subsets) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
802 |
apply(rule finite_subset) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
803 |
apply(rule CPTpre_subsets) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
804 |
apply(simp) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
805 |
apply(rule_tac B="(\<lambda>(v, vs). Stars (v#vs)) ` {(v, vs). v \<in> CPTpre r (a#list) \<and> flat v \<noteq> [] \<and> Stars vs \<in> CPTpre (STAR r) (drop (length (flat v)) (a#list))}" in finite_subset)
|
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
806 |
apply(auto)[1] |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
807 |
apply(rule finite_imageI) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
808 |
apply(simp add: Collect_case_prod_Sigma) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
809 |
apply(rule finite_SigmaI) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
810 |
apply(rule assms) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
811 |
apply(case_tac "flat v = []") |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
812 |
apply(simp) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
813 |
apply(drule_tac x="drop (length (flat v)) (a # list)" in spec) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
814 |
apply(simp) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
815 |
apply(auto)[1] |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
816 |
apply(rule test) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
817 |
apply(simp) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
818 |
done |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
819 |
|
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
820 |
lemma CPTpre_finite: |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
821 |
shows "finite (CPTpre r s)" |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
822 |
apply(induct r arbitrary: s) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
823 |
apply(simp add: CPTpre_subsets) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
824 |
apply(rule finite_subset) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
825 |
apply(rule CPTpre_subsets) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
826 |
apply(simp) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
827 |
apply(rule finite_subset) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
828 |
apply(rule CPTpre_subsets) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
829 |
apply(simp) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
830 |
apply(rule finite_subset) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
831 |
apply(rule CPTpre_subsets) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
832 |
apply(rule_tac B="(\<lambda>(v1, v2). Seq v1 v2) ` {(v1, v2). v1 \<in> CPTpre r1 s \<and> v2 \<in> CPTpre r2 (drop (length (flat v1)) s)}" in finite_subset)
|
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
833 |
apply(auto)[1] |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
834 |
apply(rule finite_imageI) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
835 |
apply(simp add: Collect_case_prod_Sigma) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
836 |
apply(rule finite_subset) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
837 |
apply(rule CPTpre_subsets) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
838 |
apply(simp) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
839 |
by (simp add: CPTpre_STAR_finite) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
840 |
|
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
841 |
|
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
842 |
lemma CPT_finite: |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
843 |
shows "finite (CPT r s)" |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
844 |
apply(rule finite_subset) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
845 |
apply(rule CPT_CPTpre_subset) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
846 |
apply(rule CPTpre_finite) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
847 |
done |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
848 |
|
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
849 |
lemma Posix_CPT: |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
850 |
assumes "s \<in> r \<rightarrow> v" |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
851 |
shows "v \<in> CPT r s" |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
852 |
using assms |
| 264 | 853 |
by (induct rule: Posix.induct) |
854 |
(auto simp add: CPT_def intro: CPrf.intros) |
|
|
248
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
855 |
|
| 261 | 856 |
section {* The Posix Value is smaller than any other Value *}
|
857 |
||
| 262 | 858 |
|
| 261 | 859 |
lemma Posix_PosOrd: |
| 262 | 860 |
assumes "s \<in> r \<rightarrow> v1" "v2 \<in> CPT r s" |
|
248
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
861 |
shows "v1 :\<sqsubseteq>val v2" |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
862 |
using assms |
| 261 | 863 |
proof (induct arbitrary: v2 rule: Posix.induct) |
864 |
case (Posix_ONE v) |
|
| 262 | 865 |
have "v \<in> CPT ONE []" by fact |
866 |
then have "v = Void" |
|
867 |
by (simp add: CPT_simps) |
|
| 261 | 868 |
then show "Void :\<sqsubseteq>val v" |
| 262 | 869 |
by (simp add: PosOrd_ex1_def) |
| 261 | 870 |
next |
871 |
case (Posix_CHAR c v) |
|
| 262 | 872 |
have "v \<in> CPT (CHAR c) [c]" by fact |
873 |
then have "v = Char c" |
|
874 |
by (simp add: CPT_simps) |
|
| 261 | 875 |
then show "Char c :\<sqsubseteq>val v" |
| 262 | 876 |
by (simp add: PosOrd_ex1_def) |
| 261 | 877 |
next |
878 |
case (Posix_ALT1 s r1 v r2 v2) |
|
879 |
have as1: "s \<in> r1 \<rightarrow> v" by fact |
|
| 262 | 880 |
have IH: "\<And>v2. v2 \<in> CPT r1 s \<Longrightarrow> v :\<sqsubseteq>val v2" by fact |
881 |
have "v2 \<in> CPT (ALT r1 r2) s" by fact |
|
882 |
then have "\<Turnstile> v2 : ALT r1 r2" "flat v2 = s" |
|
883 |
by(auto simp add: CPT_def prefix_list_def) |
|
| 261 | 884 |
then consider |
| 262 | 885 |
(Left) v3 where "v2 = Left v3" "\<Turnstile> v3 : r1" "flat v3 = s" |
886 |
| (Right) v3 where "v2 = Right v3" "\<Turnstile> v3 : r2" "flat v3 = s" |
|
| 261 | 887 |
by (auto elim: CPrf.cases) |
888 |
then show "Left v :\<sqsubseteq>val v2" |
|
889 |
proof(cases) |
|
890 |
case (Left v3) |
|
| 262 | 891 |
have "v3 \<in> CPT r1 s" using Left(2,3) |
892 |
by (auto simp add: CPT_def prefix_list_def) |
|
| 261 | 893 |
with IH have "v :\<sqsubseteq>val v3" by simp |
894 |
moreover |
|
| 262 | 895 |
have "flat v3 = flat v" using as1 Left(3) |
896 |
by (simp add: Posix1(2)) |
|
| 261 | 897 |
ultimately have "Left v :\<sqsubseteq>val Left v3" |
| 262 | 898 |
by (auto simp add: PosOrd_ex1_def PosOrd_LeftI) |
| 261 | 899 |
then show "Left v :\<sqsubseteq>val v2" unfolding Left . |
900 |
next |
|
901 |
case (Right v3) |
|
| 262 | 902 |
have "flat v3 = flat v" using as1 Right(3) |
903 |
by (simp add: Posix1(2)) |
|
| 261 | 904 |
then have "Left v :\<sqsubseteq>val Right v3" using Right(3) as1 |
| 262 | 905 |
by (auto simp add: PosOrd_ex1_def PosOrd_Left_Right) |
| 261 | 906 |
then show "Left v :\<sqsubseteq>val v2" unfolding Right . |
907 |
qed |
|
908 |
next |
|
909 |
case (Posix_ALT2 s r2 v r1 v2) |
|
910 |
have as1: "s \<in> r2 \<rightarrow> v" by fact |
|
911 |
have as2: "s \<notin> L r1" by fact |
|
| 262 | 912 |
have IH: "\<And>v2. v2 \<in> CPT r2 s \<Longrightarrow> v :\<sqsubseteq>val v2" by fact |
913 |
have "v2 \<in> CPT (ALT r1 r2) s" by fact |
|
914 |
then have "\<Turnstile> v2 : ALT r1 r2" "flat v2 = s" |
|
915 |
by(auto simp add: CPT_def prefix_list_def) |
|
| 261 | 916 |
then consider |
| 262 | 917 |
(Left) v3 where "v2 = Left v3" "\<Turnstile> v3 : r1" "flat v3 = s" |
918 |
| (Right) v3 where "v2 = Right v3" "\<Turnstile> v3 : r2" "flat v3 = s" |
|
| 261 | 919 |
by (auto elim: CPrf.cases) |
920 |
then show "Right v :\<sqsubseteq>val v2" |
|
921 |
proof (cases) |
|
922 |
case (Right v3) |
|
| 262 | 923 |
have "v3 \<in> CPT r2 s" using Right(2,3) |
924 |
by (auto simp add: CPT_def prefix_list_def) |
|
| 261 | 925 |
with IH have "v :\<sqsubseteq>val v3" by simp |
926 |
moreover |
|
| 262 | 927 |
have "flat v3 = flat v" using as1 Right(3) |
928 |
by (simp add: Posix1(2)) |
|
| 261 | 929 |
ultimately have "Right v :\<sqsubseteq>val Right v3" |
| 262 | 930 |
by (auto simp add: PosOrd_ex1_def PosOrd_RightI) |
| 261 | 931 |
then show "Right v :\<sqsubseteq>val v2" unfolding Right . |
932 |
next |
|
933 |
case (Left v3) |
|
| 262 | 934 |
have "v3 \<in> CPT r1 s" using Left(2,3) as2 |
935 |
by (auto simp add: CPT_def prefix_list_def) |
|
936 |
then have "flat v3 = flat v \<and> \<Turnstile> v3 : r1" using as1 Left(3) |
|
937 |
by (simp add: Posix1(2) CPT_def) |
|
938 |
then have "False" using as1 as2 Left |
|
939 |
by (auto simp add: Posix1(2) L_flat_Prf1 Prf_CPrf) |
|
940 |
then show "Right v :\<sqsubseteq>val v2" by simp |
|
| 261 | 941 |
qed |
942 |
next |
|
943 |
case (Posix_SEQ s1 r1 v1 s2 r2 v2 v3) |
|
| 264 | 944 |
have "s1 \<in> r1 \<rightarrow> v1" "s2 \<in> r2 \<rightarrow> v2" by fact+ |
945 |
then have as1: "s1 = flat v1" "s2 = flat v2" by (simp_all add: Posix1(2)) |
|
| 262 | 946 |
have IH1: "\<And>v3. v3 \<in> CPT r1 s1 \<Longrightarrow> v1 :\<sqsubseteq>val v3" by fact |
947 |
have IH2: "\<And>v3. v3 \<in> CPT r2 s2 \<Longrightarrow> v2 :\<sqsubseteq>val v3" by fact |
|
| 261 | 948 |
have cond: "\<not> (\<exists>s\<^sub>3 s\<^sub>4. s\<^sub>3 \<noteq> [] \<and> s\<^sub>3 @ s\<^sub>4 = s2 \<and> s1 @ s\<^sub>3 \<in> L r1 \<and> s\<^sub>4 \<in> L r2)" by fact |
| 262 | 949 |
have "v3 \<in> CPT (SEQ r1 r2) (s1 @ s2)" by fact |
| 261 | 950 |
then obtain v3a v3b where eqs: |
951 |
"v3 = Seq v3a v3b" "\<Turnstile> v3a : r1" "\<Turnstile> v3b : r2" |
|
| 262 | 952 |
"flat v3a @ flat v3b = s1 @ s2" |
953 |
by (force simp add: prefix_list_def CPT_def elim: CPrf.cases) |
|
954 |
with cond have "flat v3a \<sqsubseteq>pre s1" unfolding prefix_list_def |
|
955 |
by (smt L_flat_Prf1 Prf_CPrf append_eq_append_conv2 append_self_conv) |
|
956 |
then have "flat v3a \<sqsubset>spre s1 \<or> (flat v3a = s1 \<and> flat v3b = s2)" using eqs |
|
957 |
by (simp add: sprefix_list_def append_eq_conv_conj) |
|
958 |
then have q2: "v1 :\<sqsubset>val v3a \<or> (flat v3a = s1 \<and> flat v3b = s2)" |
|
| 264 | 959 |
using PosOrd_spreI as1(1) eqs by blast |
| 262 | 960 |
then have "v1 :\<sqsubset>val v3a \<or> (v3a \<in> CPT r1 s1 \<and> v3b \<in> CPT r2 s2)" using eqs(2,3) |
961 |
by (auto simp add: CPT_def) |
|
962 |
then have "v1 :\<sqsubset>val v3a \<or> (v1 :\<sqsubseteq>val v3a \<and> v2 :\<sqsubseteq>val v3b)" using IH1 IH2 by blast |
|
963 |
then have "Seq v1 v2 :\<sqsubseteq>val Seq v3a v3b" using eqs q2 as1 |
|
| 264 | 964 |
unfolding PosOrd_ex1_def by (auto simp add: PosOrd_SeqI1 PosOrd_SeqI2) |
| 262 | 965 |
then show "Seq v1 v2 :\<sqsubseteq>val v3" unfolding eqs by blast |
| 261 | 966 |
next |
967 |
case (Posix_STAR1 s1 r v s2 vs v3) |
|
| 264 | 968 |
have "s1 \<in> r \<rightarrow> v" "s2 \<in> STAR r \<rightarrow> Stars vs" by fact+ |
969 |
then have as1: "s1 = flat v" "s2 = flat (Stars vs)" by (auto dest: Posix1(2)) |
|
| 262 | 970 |
have IH1: "\<And>v3. v3 \<in> CPT r s1 \<Longrightarrow> v :\<sqsubseteq>val v3" by fact |
971 |
have IH2: "\<And>v3. v3 \<in> CPT (STAR r) s2 \<Longrightarrow> Stars vs :\<sqsubseteq>val v3" by fact |
|
| 261 | 972 |
have cond: "\<not> (\<exists>s\<^sub>3 s\<^sub>4. s\<^sub>3 \<noteq> [] \<and> s\<^sub>3 @ s\<^sub>4 = s2 \<and> s1 @ s\<^sub>3 \<in> L r \<and> s\<^sub>4 \<in> L (STAR r))" by fact |
973 |
have cond2: "flat v \<noteq> []" by fact |
|
| 262 | 974 |
have "v3 \<in> CPT (STAR r) (s1 @ s2)" by fact |
| 261 | 975 |
then consider |
976 |
(NonEmpty) v3a vs3 where |
|
977 |
"v3 = Stars (v3a # vs3)" "\<Turnstile> v3a : r" "\<Turnstile> Stars vs3 : STAR r" |
|
| 262 | 978 |
"flat (Stars (v3a # vs3)) = s1 @ s2" |
| 261 | 979 |
| (Empty) "v3 = Stars []" |
| 262 | 980 |
by (force simp add: CPT_def elim: CPrf.cases) |
| 261 | 981 |
then show "Stars (v # vs) :\<sqsubseteq>val v3" |
982 |
proof (cases) |
|
983 |
case (NonEmpty v3a vs3) |
|
| 262 | 984 |
have "flat (Stars (v3a # vs3)) = s1 @ s2" using NonEmpty(4) . |
985 |
with cond have "flat v3a \<sqsubseteq>pre s1" using NonEmpty(2,3) |
|
986 |
unfolding prefix_list_def |
|
987 |
by (smt L_flat_Prf1 Prf_CPrf append_Nil2 append_eq_append_conv2 flat.simps(7)) |
|
988 |
then have "flat v3a \<sqsubset>spre s1 \<or> (flat v3a = s1 \<and> flat (Stars vs3) = s2)" using NonEmpty(4) |
|
989 |
by (simp add: sprefix_list_def append_eq_conv_conj) |
|
990 |
then have q2: "v :\<sqsubset>val v3a \<or> (flat v3a = s1 \<and> flat (Stars vs3) = s2)" |
|
| 264 | 991 |
using PosOrd_spreI as1(1) NonEmpty(4) by blast |
| 262 | 992 |
then have "v :\<sqsubset>val v3a \<or> (v3a \<in> CPT r s1 \<and> Stars vs3 \<in> CPT (STAR r) s2)" |
993 |
using NonEmpty(2,3) by (auto simp add: CPT_def) |
|
| 264 | 994 |
then have "v :\<sqsubset>val v3a \<or> (v :\<sqsubseteq>val v3a \<and> Stars vs :\<sqsubseteq>val Stars vs3)" using IH1 IH2 by blast |
995 |
then have "v :\<sqsubset>val v3a \<or> (v = v3a \<and> Stars vs :\<sqsubseteq>val Stars vs3)" |
|
996 |
unfolding PosOrd_ex1_def by auto |
|
| 262 | 997 |
then have "Stars (v # vs) :\<sqsubseteq>val Stars (v3a # vs3)" using NonEmpty(4) q2 as1 |
998 |
unfolding PosOrd_ex1_def |
|
| 264 | 999 |
by (metis PosOrd_StarsI PosOrd_StarsI2 flat.simps(7) val.inject(5)) |
| 262 | 1000 |
then show "Stars (v # vs) :\<sqsubseteq>val v3" unfolding NonEmpty by blast |
| 261 | 1001 |
next |
1002 |
case Empty |
|
1003 |
have "v3 = Stars []" by fact |
|
1004 |
then show "Stars (v # vs) :\<sqsubseteq>val v3" |
|
1005 |
unfolding PosOrd_ex1_def using cond2 |
|
1006 |
by (simp add: PosOrd_shorterI) |
|
1007 |
qed |
|
1008 |
next |
|
1009 |
case (Posix_STAR2 r v2) |
|
| 262 | 1010 |
have "v2 \<in> CPT (STAR r) []" by fact |
1011 |
then have "v2 = Stars []" |
|
1012 |
unfolding CPT_def by (auto elim: CPrf.cases) |
|
| 261 | 1013 |
then show "Stars [] :\<sqsubseteq>val v2" |
1014 |
by (simp add: PosOrd_ex1_def) |
|
1015 |
qed |
|
| 253 | 1016 |
|
| 263 | 1017 |
lemma Posix_PosOrd_stronger: |
1018 |
assumes "s \<in> r \<rightarrow> v1" "v2 \<in> CPTpre r s" |
|
1019 |
shows "v1 :\<sqsubseteq>val v2" |
|
1020 |
proof - |
|
1021 |
from assms(2) have "v2 \<in> CPT r s \<or> flat v2 \<sqsubset>spre s" |
|
1022 |
unfolding CPTpre_def CPT_def sprefix_list_def prefix_list_def by auto |
|
1023 |
moreover |
|
1024 |
{ assume "v2 \<in> CPT r s"
|
|
| 264 | 1025 |
with assms(1) |
1026 |
have "v1 :\<sqsubseteq>val v2" by (rule Posix_PosOrd) |
|
| 263 | 1027 |
} |
1028 |
moreover |
|
1029 |
{ assume "flat v2 \<sqsubset>spre s"
|
|
1030 |
then have "flat v2 \<sqsubset>spre flat v1" using assms(1) |
|
1031 |
using Posix1(2) by blast |
|
1032 |
then have "v1 :\<sqsubseteq>val v2" |
|
1033 |
by (simp add: PosOrd_ex1_def PosOrd_spreI) |
|
1034 |
} |
|
1035 |
ultimately show "v1 :\<sqsubseteq>val v2" by blast |
|
1036 |
qed |
|
1037 |
||
| 261 | 1038 |
lemma Posix_PosOrd_reverse: |
|
248
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
1039 |
assumes "s \<in> r \<rightarrow> v1" |
| 263 | 1040 |
shows "\<not>(\<exists>v2 \<in> CPTpre r s. v2 :\<sqsubset>val v1)" |
|
248
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
1041 |
using assms |
| 263 | 1042 |
by (metis Posix_PosOrd_stronger less_irrefl PosOrd_def |
| 261 | 1043 |
PosOrd_ex1_def PosOrd_ex_def PosOrd_trans) |
|
248
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
1044 |
|
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
1045 |
|
| 261 | 1046 |
lemma PosOrd_Posix_Stars: |
|
248
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
1047 |
assumes "(Stars vs) \<in> CPT (STAR r) (flat (Stars vs))" "\<forall>v \<in> set vs. flat v \<in> r \<rightarrow> v" |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
1048 |
and "\<not>(\<exists>vs2 \<in> PT (STAR r) (flat (Stars vs)). vs2 :\<sqsubset>val (Stars vs))" |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
1049 |
shows "(flat (Stars vs)) \<in> (STAR r) \<rightarrow> Stars vs" |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
1050 |
using assms |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
1051 |
apply(induct vs) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
1052 |
apply(simp) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
1053 |
apply(rule Posix.intros) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
1054 |
apply(simp (no_asm)) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
1055 |
apply(rule Posix.intros) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
1056 |
apply(auto)[1] |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
1057 |
apply(auto simp add: CPT_def PT_def)[1] |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
1058 |
defer |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
1059 |
apply(simp) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
1060 |
apply(drule meta_mp) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
1061 |
apply(auto simp add: CPT_def PT_def)[1] |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
1062 |
apply(erule CPrf.cases) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
1063 |
apply(simp_all) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
1064 |
apply(drule meta_mp) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
1065 |
apply(auto simp add: CPT_def PT_def)[1] |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
1066 |
apply(erule Prf.cases) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
1067 |
apply(simp_all) |
| 264 | 1068 |
using CPrf_stars PosOrd_irrefl apply fastforce |
|
248
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
1069 |
apply(clarify) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
1070 |
apply(drule_tac x="Stars (a#v#vsa)" in spec) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
1071 |
apply(simp) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
1072 |
apply(drule mp) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
1073 |
apply (meson CPrf_stars Prf.intros(7) Prf_CPrf list.set_intros(1)) |
| 261 | 1074 |
apply(subst (asm) (2) PosOrd_ex_def) |
|
248
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
1075 |
apply(simp) |
| 261 | 1076 |
apply (metis flat.simps(7) flat_Stars PosOrd_StarsI2 PosOrd_ex_def) |
|
248
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
1077 |
apply(auto simp add: CPT_def PT_def)[1] |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
1078 |
using CPrf_stars apply auto[1] |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
1079 |
apply(auto)[1] |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
1080 |
apply(auto simp add: CPT_def PT_def)[1] |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
1081 |
apply(subgoal_tac "\<exists>vA. flat vA = flat a @ s\<^sub>3 \<and> \<turnstile> vA : r") |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
1082 |
prefer 2 |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
1083 |
apply (meson L_flat_Prf2) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
1084 |
apply(subgoal_tac "\<exists>vB. flat (Stars vB) = s\<^sub>4 \<and> \<turnstile> (Stars vB) : (STAR r)") |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
1085 |
apply(clarify) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
1086 |
apply(drule_tac x="Stars (vA # vB)" in spec) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
1087 |
apply(simp) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
1088 |
apply(drule mp) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
1089 |
using Prf.intros(7) apply blast |
| 261 | 1090 |
apply(subst (asm) (2) PosOrd_ex_def) |
|
248
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
1091 |
apply(simp) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
1092 |
prefer 2 |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
1093 |
apply(simp) |
| 254 | 1094 |
using Star_values_exists apply blast |
|
248
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
1095 |
prefer 2 |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
1096 |
apply(drule meta_mp) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
1097 |
apply(erule CPrf.cases) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
1098 |
apply(simp_all) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
1099 |
apply(drule meta_mp) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
1100 |
apply(auto)[1] |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
1101 |
prefer 2 |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
1102 |
apply(simp) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
1103 |
apply(erule CPrf.cases) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
1104 |
apply(simp_all) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
1105 |
apply(clarify) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
1106 |
apply(rotate_tac 3) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
1107 |
apply(erule Prf.cases) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
1108 |
apply(simp_all) |
| 261 | 1109 |
apply (metis CPrf_stars intlen.cases less_irrefl list.set_intros(1) PosOrd_def PosOrd_ex_def) |
|
248
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
1110 |
apply(drule_tac x="Stars (v#va#vsb)" in spec) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
1111 |
apply(drule mp) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
1112 |
apply (simp add: Posix1a Prf.intros(7)) |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
1113 |
apply(simp) |
| 261 | 1114 |
apply(subst (asm) (2) PosOrd_ex_def) |
|
248
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
1115 |
apply(simp) |
| 261 | 1116 |
apply (metis flat.simps(7) flat_Stars PosOrd_StarsI2 PosOrd_ex_def) |
| 264 | 1117 |
by (metis PosOrd_StarsI PosOrd_ex_def PosOrd_spreI append_assoc append_self_conv flat.simps(7) flat_Stars prefix_list_def sprefix_list_def) |
|
248
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
1118 |
|
| 254 | 1119 |
|
| 261 | 1120 |
section {* The Smallest Value is indeed the Posix Value *}
|
|
248
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
1121 |
|
| 261 | 1122 |
lemma PosOrd_Posix: |
1123 |
assumes "v1 \<in> CPT r s" "\<forall>v2 \<in> PT r s. \<not> v2 :\<sqsubset>val v1" |
|
|
248
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
1124 |
shows "s \<in> r \<rightarrow> v1" |
|
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
1125 |
using assms |
| 261 | 1126 |
proof(induct r arbitrary: s v1) |
1127 |
case (ZERO s v1) |
|
1128 |
have "v1 \<in> CPT ZERO s" by fact |
|
1129 |
then show "s \<in> ZERO \<rightarrow> v1" unfolding CPT_def |
|
1130 |
by (auto elim: CPrf.cases) |
|
1131 |
next |
|
1132 |
case (ONE s v1) |
|
1133 |
have "v1 \<in> CPT ONE s" by fact |
|
1134 |
then show "s \<in> ONE \<rightarrow> v1" unfolding CPT_def |
|
1135 |
by(auto elim!: CPrf.cases intro: Posix.intros) |
|
1136 |
next |
|
1137 |
case (CHAR c s v1) |
|
1138 |
have "v1 \<in> CPT (CHAR c) s" by fact |
|
1139 |
then show "s \<in> CHAR c \<rightarrow> v1" unfolding CPT_def |
|
1140 |
by (auto elim!: CPrf.cases intro: Posix.intros) |
|
1141 |
next |
|
1142 |
case (ALT r1 r2 s v1) |
|
1143 |
have IH1: "\<And>s v1. \<lbrakk>v1 \<in> CPT r1 s; \<forall>v2 \<in> PT r1 s. \<not> v2 :\<sqsubset>val v1\<rbrakk> \<Longrightarrow> s \<in> r1 \<rightarrow> v1" by fact |
|
1144 |
have IH2: "\<And>s v1. \<lbrakk>v1 \<in> CPT r2 s; \<forall>v2 \<in> PT r2 s. \<not> v2 :\<sqsubset>val v1\<rbrakk> \<Longrightarrow> s \<in> r2 \<rightarrow> v1" by fact |
|
1145 |
have as1: "\<forall>v2\<in>PT (ALT r1 r2) s. \<not> v2 :\<sqsubset>val v1" by fact |
|
1146 |
have as2: "v1 \<in> CPT (ALT r1 r2) s" by fact |
|
1147 |
then consider |
|
1148 |
(Left) v1' where |
|
1149 |
"v1 = Left v1'" "s = flat v1'" |
|
1150 |
"v1' \<in> CPT r1 s" |
|
1151 |
| (Right) v1' where |
|
1152 |
"v1 = Right v1'" "s = flat v1'" |
|
1153 |
"v1' \<in> CPT r2 s" |
|
1154 |
unfolding CPT_def by (auto elim: CPrf.cases) |
|
1155 |
then show "s \<in> ALT r1 r2 \<rightarrow> v1" |
|
1156 |
proof (cases) |
|
1157 |
case (Left v1') |
|
1158 |
have "v1' \<in> CPT r1 s" using as2 |
|
1159 |
unfolding CPT_def Left by (auto elim: CPrf.cases) |
|
1160 |
moreover |
|
1161 |
have "\<forall>v2 \<in> PT r1 s. \<not> v2 :\<sqsubset>val v1'" using as1 |
|
1162 |
unfolding PT_def Left using Prf.intros(2) PosOrd_LeftI by force |
|
1163 |
ultimately have "s \<in> r1 \<rightarrow> v1'" using IH1 by simp |
|
1164 |
then have "s \<in> ALT r1 r2 \<rightarrow> Left v1'" by (rule Posix.intros) |
|
1165 |
then show "s \<in> ALT r1 r2 \<rightarrow> v1" using Left by simp |
|
1166 |
next |
|
1167 |
case (Right v1') |
|
1168 |
have "v1' \<in> CPT r2 s" using as2 |
|
1169 |
unfolding CPT_def Right by (auto elim: CPrf.cases) |
|
1170 |
moreover |
|
1171 |
have "\<forall>v2 \<in> PT r2 s. \<not> v2 :\<sqsubset>val v1'" using as1 |
|
1172 |
unfolding PT_def Right using Prf.intros(3) PosOrd_RightI by force |
|
1173 |
ultimately have "s \<in> r2 \<rightarrow> v1'" using IH2 by simp |
|
1174 |
moreover |
|
1175 |
{ assume "s \<in> L r1"
|
|
1176 |
then obtain v' where "v' \<in> PT r1 s" |
|
1177 |
unfolding PT_def using L_flat_Prf2 by blast |
|
1178 |
then have "Left v' \<in> PT (ALT r1 r2) s" |
|
1179 |
unfolding PT_def by (auto intro: Prf.intros) |
|
1180 |
with as1 have "\<not> (Left v' :\<sqsubset>val Right v1') \<and> (flat v' = s)" |
|
1181 |
unfolding PT_def Right by (auto) |
|
1182 |
then have False using PosOrd_Left_Right Right by blast |
|
1183 |
} |
|
1184 |
then have "s \<notin> L r1" by rule |
|
1185 |
ultimately have "s \<in> ALT r1 r2 \<rightarrow> Right v1'" by (rule Posix.intros) |
|
1186 |
then show "s \<in> ALT r1 r2 \<rightarrow> v1" using Right by simp |
|
1187 |
qed |
|
1188 |
next |
|
1189 |
case (SEQ r1 r2 s v1) |
|
1190 |
have IH1: "\<And>s v1. \<lbrakk>v1 \<in> CPT r1 s; \<forall>v2 \<in> PT r1 s. \<not> v2 :\<sqsubset>val v1\<rbrakk> \<Longrightarrow> s \<in> r1 \<rightarrow> v1" by fact |
|
1191 |
have IH2: "\<And>s v1. \<lbrakk>v1 \<in> CPT r2 s; \<forall>v2 \<in> PT r2 s. \<not> v2 :\<sqsubset>val v1\<rbrakk> \<Longrightarrow> s \<in> r2 \<rightarrow> v1" by fact |
|
1192 |
have as1: "\<forall>v2\<in>PT (SEQ r1 r2) s. \<not> v2 :\<sqsubset>val v1" by fact |
|
1193 |
have as2: "v1 \<in> CPT (SEQ r1 r2) s" by fact |
|
1194 |
then obtain |
|
1195 |
v1a v1b where eqs: |
|
1196 |
"v1 = Seq v1a v1b" "s = flat v1a @ flat v1b" |
|
1197 |
"v1a \<in> CPT r1 (flat v1a)" "v1b \<in> CPT r2 (flat v1b)" |
|
1198 |
unfolding CPT_def by(auto elim: CPrf.cases) |
|
1199 |
have "\<forall>v2 \<in> PT r1 (flat v1a). \<not> v2 :\<sqsubset>val v1a" |
|
1200 |
proof |
|
1201 |
fix v2 |
|
1202 |
assume "v2 \<in> PT r1 (flat v1a)" |
|
1203 |
with eqs(2,4) have "Seq v2 v1b \<in> PT (SEQ r1 r2) s" |
|
1204 |
by (simp add: CPT_def PT_def Prf.intros(1) Prf_CPrf) |
|
1205 |
with as1 have "\<not> Seq v2 v1b :\<sqsubset>val Seq v1a v1b \<and> flat (Seq v2 v1b) = flat (Seq v1a v1b)" |
|
1206 |
using eqs by (simp add: PT_def) |
|
1207 |
then show "\<not> v2 :\<sqsubset>val v1a" |
|
1208 |
using PosOrd_SeqI1 by blast |
|
1209 |
qed |
|
1210 |
then have "flat v1a \<in> r1 \<rightarrow> v1a" using IH1 eqs by simp |
|
1211 |
moreover |
|
1212 |
have "\<forall>v2 \<in> PT r2 (flat v1b). \<not> v2 :\<sqsubset>val v1b" |
|
1213 |
proof |
|
1214 |
fix v2 |
|
1215 |
assume "v2 \<in> PT r2 (flat v1b)" |
|
1216 |
with eqs(2,3,4) have "Seq v1a v2 \<in> PT (SEQ r1 r2) s" |
|
1217 |
by (simp add: CPT_def PT_def Prf.intros Prf_CPrf) |
|
1218 |
with as1 have "\<not> Seq v1a v2 :\<sqsubset>val Seq v1a v1b \<and> flat v2 = flat v1b" |
|
1219 |
using eqs by (simp add: PT_def) |
|
1220 |
then show "\<not> v2 :\<sqsubset>val v1b" |
|
1221 |
using PosOrd_SeqI2 by auto |
|
1222 |
qed |
|
1223 |
then have "flat v1b \<in> r2 \<rightarrow> v1b" using IH2 eqs by simp |
|
1224 |
moreover |
|
1225 |
have "\<not> (\<exists>s\<^sub>3 s\<^sub>4. s\<^sub>3 \<noteq> [] \<and> s\<^sub>3 @ s\<^sub>4 = flat v1b \<and> flat v1a @ s\<^sub>3 \<in> L r1 \<and> s\<^sub>4 \<in> L r2)" |
|
1226 |
proof |
|
1227 |
assume "\<exists>s3 s4. s3 \<noteq> [] \<and> s3 @ s4 = flat v1b \<and> flat v1a @ s3 \<in> L r1 \<and> s4 \<in> L r2" |
|
1228 |
then obtain s3 s4 where q1: "s3 \<noteq> [] \<and> s3 @ s4 = flat v1b \<and> flat v1a @ s3 \<in> L r1 \<and> s4 \<in> L r2" by blast |
|
1229 |
then obtain vA vB where q2: "flat vA = flat v1a @ s3" "\<turnstile> vA : r1" "flat vB = s4" "\<turnstile> vB : r2" |
|
1230 |
using L_flat_Prf2 by blast |
|
1231 |
then have "Seq vA vB \<in> PT (SEQ r1 r2) s" unfolding eqs using q1 |
|
1232 |
by (auto simp add: PT_def intro: Prf.intros) |
|
1233 |
with as1 have "\<not> Seq vA vB :\<sqsubset>val Seq v1a v1b" unfolding eqs by auto |
|
1234 |
then have "\<not> vA :\<sqsubset>val v1a \<and> length (flat vA) > length (flat v1a)" using q1 q2 PosOrd_SeqI1 by auto |
|
1235 |
then show "False" |
|
1236 |
using PosOrd_shorterI by blast |
|
1237 |
qed |
|
1238 |
ultimately |
|
1239 |
show "s \<in> SEQ r1 r2 \<rightarrow> v1" unfolding eqs |
|
1240 |
by (rule Posix.intros) |
|
1241 |
next |
|
1242 |
case (STAR r s v1) |
|
1243 |
have IH: "\<And>s v1. \<lbrakk>v1 \<in> CPT r s; \<forall>v2\<in>PT r s. \<not> v2 :\<sqsubset>val v1\<rbrakk> \<Longrightarrow> s \<in> r \<rightarrow> v1" by fact |
|
1244 |
have as1: "\<forall>v2\<in>PT (STAR r) s. \<not> v2 :\<sqsubset>val v1" by fact |
|
1245 |
have as2: "v1 \<in> CPT (STAR r) s" by fact |
|
1246 |
then obtain |
|
1247 |
vs where eqs: |
|
1248 |
"v1 = Stars vs" "s = flat (Stars vs)" |
|
1249 |
"\<forall>v \<in> set vs. v \<in> CPT r (flat v)" |
|
1250 |
unfolding CPT_def by (auto elim: CPrf.cases dest!: CPrf_stars) |
|
1251 |
have "Stars vs \<in> CPT (STAR r) (flat (Stars vs))" |
|
1252 |
using as2 unfolding eqs . |
|
1253 |
moreover |
|
1254 |
have "\<forall>v\<in>set vs. flat v \<in> r \<rightarrow> v" |
|
1255 |
proof |
|
1256 |
fix v |
|
1257 |
assume a: "v \<in> set vs" |
|
1258 |
then obtain pre post where e: "vs = pre @ [v] @ post" |
|
1259 |
by (metis append_Cons append_Nil in_set_conv_decomp_first) |
|
1260 |
then have q: "\<forall>v2\<in>PT (STAR r) s. \<not> v2 :\<sqsubset>val Stars (pre @ [v] @ post)" |
|
1261 |
using as1 unfolding eqs by simp |
|
1262 |
have "\<forall>v2\<in>PT r (flat v). \<not> v2 :\<sqsubset>val v" unfolding eqs |
|
1263 |
proof (rule ballI, rule notI) |
|
1264 |
fix v2 |
|
1265 |
assume w: "v2 :\<sqsubset>val v" |
|
1266 |
assume "v2 \<in> PT r (flat v)" |
|
1267 |
then have "Stars (pre @ [v2] @ post) \<in> PT (STAR r) s" |
|
1268 |
using as2 unfolding e eqs |
|
1269 |
apply(auto simp add: CPT_def PT_def intro!: Prf_Stars)[1] |
|
1270 |
using CPrf_Stars_appendE CPrf_stars Prf_CPrf apply blast |
|
1271 |
by (meson CPrf_Stars_appendE CPrf_stars Prf_CPrf list.set_intros(2)) |
|
1272 |
then have "\<not> Stars (pre @ [v2] @ post) :\<sqsubset>val Stars (pre @ [v] @ post)" |
|
1273 |
using q by simp |
|
1274 |
with w show "False" |
|
1275 |
using PT_def \<open>v2 \<in> PT r (flat v)\<close> append_Cons flat.simps(7) mem_Collect_eq |
|
1276 |
PosOrd_StarsI PosOrd_Stars_appendI by auto |
|
1277 |
qed |
|
1278 |
with IH |
|
1279 |
show "flat v \<in> r \<rightarrow> v" using a as2 unfolding eqs |
|
1280 |
using eqs(3) by blast |
|
1281 |
qed |
|
1282 |
moreover |
|
1283 |
have "\<not> (\<exists>vs2\<in>PT (STAR r) (flat (Stars vs)). vs2 :\<sqsubset>val Stars vs)" |
|
1284 |
proof |
|
1285 |
assume "\<exists>vs2 \<in> PT (STAR r) (flat (Stars vs)). vs2 :\<sqsubset>val Stars vs" |
|
1286 |
then obtain vs2 where "\<turnstile> Stars vs2 : STAR r" "flat (Stars vs2) = flat (Stars vs)" |
|
1287 |
"Stars vs2 :\<sqsubset>val Stars vs" |
|
1288 |
unfolding PT_def |
|
1289 |
apply(auto elim: Prf.cases) |
|
1290 |
apply(erule Prf.cases) |
|
1291 |
apply(auto intro: Prf.intros) |
|
1292 |
apply(drule_tac x="[]" in meta_spec) |
|
1293 |
apply(simp) |
|
1294 |
apply(drule meta_mp) |
|
1295 |
apply(auto intro: Prf.intros) |
|
1296 |
apply(drule_tac x="(v#vsa)" in meta_spec) |
|
1297 |
apply(auto intro: Prf.intros) |
|
1298 |
done |
|
1299 |
then show "False" using as1 unfolding eqs |
|
1300 |
apply - |
|
1301 |
apply(drule_tac x="Stars vs2" in bspec) |
|
1302 |
apply(auto simp add: PT_def) |
|
1303 |
done |
|
1304 |
qed |
|
1305 |
ultimately have "flat (Stars vs) \<in> STAR r \<rightarrow> Stars vs" |
|
1306 |
by (rule PosOrd_Posix_Stars) |
|
1307 |
then show "s \<in> STAR r \<rightarrow> v1" unfolding eqs . |
|
1308 |
qed |
|
|
248
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
1309 |
|
| 249 | 1310 |
unused_thms |
1311 |
||
|
248
b90ff5abb437
added a proof that Positional ordering is equivalent to direct posix definition
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
|
1312 |
end |