author | haftmann |
Fri, 26 Aug 2011 21:11:23 +0200 | |
changeset 44555 | da75ffe3d988 |
parent 43971 | 892030194015 |
child 44558 | cc878a312673 |
permissions | -rw-r--r-- |
31807 | 1 |
|
2 |
(* Author: Florian Haftmann, TU Muenchen *) |
|
3 |
||
40672
abd4e7358847
replaced misleading Fset/fset name -- these do not stand for finite sets
haftmann
parents:
40604
diff
changeset
|
4 |
header {* A dedicated set type which is executable on its finite part *} |
31807 | 5 |
|
40672
abd4e7358847
replaced misleading Fset/fset name -- these do not stand for finite sets
haftmann
parents:
40604
diff
changeset
|
6 |
theory Cset |
37024
e938a0b5286e
renamed List_Set to the now more appropriate More_Set
haftmann
parents:
37023
diff
changeset
|
7 |
imports More_Set More_List |
31807 | 8 |
begin |
9 |
||
10 |
subsection {* Lifting *} |
|
11 |
||
40672
abd4e7358847
replaced misleading Fset/fset name -- these do not stand for finite sets
haftmann
parents:
40604
diff
changeset
|
12 |
typedef (open) 'a set = "UNIV :: 'a set set" |
44555 | 13 |
morphisms set_of Set by rule+ |
40672
abd4e7358847
replaced misleading Fset/fset name -- these do not stand for finite sets
haftmann
parents:
40604
diff
changeset
|
14 |
hide_type (open) set |
31807 | 15 |
|
44555 | 16 |
lemma set_of_Set [simp]: |
17 |
"set_of (Set A) = A" |
|
18 |
by (rule Set_inverse) rule |
|
19 |
||
20 |
lemma Set_set_of [simp]: |
|
21 |
"Set (set_of A) = A" |
|
22 |
by (fact set_of_inverse) |
|
23 |
||
24 |
definition member :: "'a Cset.set \<Rightarrow> 'a \<Rightarrow> bool" where |
|
25 |
"member A x \<longleftrightarrow> x \<in> set_of A" |
|
26 |
||
27 |
lemma member_set_of: |
|
28 |
"set_of = member" |
|
29 |
by (rule ext)+ (simp add: member_def mem_def) |
|
30 |
||
40672
abd4e7358847
replaced misleading Fset/fset name -- these do not stand for finite sets
haftmann
parents:
40604
diff
changeset
|
31 |
lemma member_Set [simp]: |
44555 | 32 |
"member (Set A) x \<longleftrightarrow> x \<in> A" |
33 |
by (simp add: member_def) |
|
37468 | 34 |
|
40672
abd4e7358847
replaced misleading Fset/fset name -- these do not stand for finite sets
haftmann
parents:
40604
diff
changeset
|
35 |
lemma Set_inject [simp]: |
abd4e7358847
replaced misleading Fset/fset name -- these do not stand for finite sets
haftmann
parents:
40604
diff
changeset
|
36 |
"Set A = Set B \<longleftrightarrow> A = B" |
abd4e7358847
replaced misleading Fset/fset name -- these do not stand for finite sets
haftmann
parents:
40604
diff
changeset
|
37 |
by (simp add: Set_inject) |
37468 | 38 |
|
40672
abd4e7358847
replaced misleading Fset/fset name -- these do not stand for finite sets
haftmann
parents:
40604
diff
changeset
|
39 |
lemma set_eq_iff: |
39380
5a2662c1e44a
established emerging canonical names *_eqI and *_eq_iff
haftmann
parents:
39302
diff
changeset
|
40 |
"A = B \<longleftrightarrow> member A = member B" |
44555 | 41 |
by (auto simp add: fun_eq_iff set_of_inject [symmetric] member_def mem_def) |
40672
abd4e7358847
replaced misleading Fset/fset name -- these do not stand for finite sets
haftmann
parents:
40604
diff
changeset
|
42 |
hide_fact (open) set_eq_iff |
39380
5a2662c1e44a
established emerging canonical names *_eqI and *_eq_iff
haftmann
parents:
39302
diff
changeset
|
43 |
|
40672
abd4e7358847
replaced misleading Fset/fset name -- these do not stand for finite sets
haftmann
parents:
40604
diff
changeset
|
44 |
lemma set_eqI: |
37473 | 45 |
"member A = member B \<Longrightarrow> A = B" |
40672
abd4e7358847
replaced misleading Fset/fset name -- these do not stand for finite sets
haftmann
parents:
40604
diff
changeset
|
46 |
by (simp add: Cset.set_eq_iff) |
abd4e7358847
replaced misleading Fset/fset name -- these do not stand for finite sets
haftmann
parents:
40604
diff
changeset
|
47 |
hide_fact (open) set_eqI |
37473 | 48 |
|
34048 | 49 |
subsection {* Lattice instantiation *} |
50 |
||
40672
abd4e7358847
replaced misleading Fset/fset name -- these do not stand for finite sets
haftmann
parents:
40604
diff
changeset
|
51 |
instantiation Cset.set :: (type) boolean_algebra |
34048 | 52 |
begin |
53 |
||
40672
abd4e7358847
replaced misleading Fset/fset name -- these do not stand for finite sets
haftmann
parents:
40604
diff
changeset
|
54 |
definition less_eq_set :: "'a Cset.set \<Rightarrow> 'a Cset.set \<Rightarrow> bool" where |
44555 | 55 |
[simp]: "A \<le> B \<longleftrightarrow> set_of A \<subseteq> set_of B" |
34048 | 56 |
|
40672
abd4e7358847
replaced misleading Fset/fset name -- these do not stand for finite sets
haftmann
parents:
40604
diff
changeset
|
57 |
definition less_set :: "'a Cset.set \<Rightarrow> 'a Cset.set \<Rightarrow> bool" where |
44555 | 58 |
[simp]: "A < B \<longleftrightarrow> set_of A \<subset> set_of B" |
34048 | 59 |
|
40672
abd4e7358847
replaced misleading Fset/fset name -- these do not stand for finite sets
haftmann
parents:
40604
diff
changeset
|
60 |
definition inf_set :: "'a Cset.set \<Rightarrow> 'a Cset.set \<Rightarrow> 'a Cset.set" where |
44555 | 61 |
[simp]: "inf A B = Set (set_of A \<inter> set_of B)" |
34048 | 62 |
|
40672
abd4e7358847
replaced misleading Fset/fset name -- these do not stand for finite sets
haftmann
parents:
40604
diff
changeset
|
63 |
definition sup_set :: "'a Cset.set \<Rightarrow> 'a Cset.set \<Rightarrow> 'a Cset.set" where |
44555 | 64 |
[simp]: "sup A B = Set (set_of A \<union> set_of B)" |
34048 | 65 |
|
40672
abd4e7358847
replaced misleading Fset/fset name -- these do not stand for finite sets
haftmann
parents:
40604
diff
changeset
|
66 |
definition bot_set :: "'a Cset.set" where |
abd4e7358847
replaced misleading Fset/fset name -- these do not stand for finite sets
haftmann
parents:
40604
diff
changeset
|
67 |
[simp]: "bot = Set {}" |
34048 | 68 |
|
40672
abd4e7358847
replaced misleading Fset/fset name -- these do not stand for finite sets
haftmann
parents:
40604
diff
changeset
|
69 |
definition top_set :: "'a Cset.set" where |
abd4e7358847
replaced misleading Fset/fset name -- these do not stand for finite sets
haftmann
parents:
40604
diff
changeset
|
70 |
[simp]: "top = Set UNIV" |
34048 | 71 |
|
40672
abd4e7358847
replaced misleading Fset/fset name -- these do not stand for finite sets
haftmann
parents:
40604
diff
changeset
|
72 |
definition uminus_set :: "'a Cset.set \<Rightarrow> 'a Cset.set" where |
44555 | 73 |
[simp]: "- A = Set (- (set_of A))" |
34048 | 74 |
|
40672
abd4e7358847
replaced misleading Fset/fset name -- these do not stand for finite sets
haftmann
parents:
40604
diff
changeset
|
75 |
definition minus_set :: "'a Cset.set \<Rightarrow> 'a Cset.set \<Rightarrow> 'a Cset.set" where |
44555 | 76 |
[simp]: "A - B = Set (set_of A - set_of B)" |
34048 | 77 |
|
78 |
instance proof |
|
44555 | 79 |
qed (auto intro!: Cset.set_eqI simp add: member_def mem_def) |
34048 | 80 |
|
81 |
end |
|
82 |
||
40672
abd4e7358847
replaced misleading Fset/fset name -- these do not stand for finite sets
haftmann
parents:
40604
diff
changeset
|
83 |
instantiation Cset.set :: (type) complete_lattice |
34048 | 84 |
begin |
85 |
||
40672
abd4e7358847
replaced misleading Fset/fset name -- these do not stand for finite sets
haftmann
parents:
40604
diff
changeset
|
86 |
definition Inf_set :: "'a Cset.set set \<Rightarrow> 'a Cset.set" where |
44555 | 87 |
[simp]: "Inf_set As = Set (Inf (image set_of As))" |
34048 | 88 |
|
40672
abd4e7358847
replaced misleading Fset/fset name -- these do not stand for finite sets
haftmann
parents:
40604
diff
changeset
|
89 |
definition Sup_set :: "'a Cset.set set \<Rightarrow> 'a Cset.set" where |
44555 | 90 |
[simp]: "Sup_set As = Set (Sup (image set_of As))" |
34048 | 91 |
|
92 |
instance proof |
|
44555 | 93 |
qed (auto simp add: le_fun_def) |
34048 | 94 |
|
95 |
end |
|
96 |
||
44555 | 97 |
instance Cset.set :: (type) complete_boolean_algebra proof |
98 |
qed (unfold INF_def SUP_def, auto) |
|
99 |
||
37023 | 100 |
|
31807 | 101 |
subsection {* Basic operations *} |
102 |
||
43971
892030194015
added operations to Cset with code equations in backing implementations
Andreas Lochbihler
parents:
43241
diff
changeset
|
103 |
abbreviation empty :: "'a Cset.set" where "empty \<equiv> bot" |
892030194015
added operations to Cset with code equations in backing implementations
Andreas Lochbihler
parents:
43241
diff
changeset
|
104 |
hide_const (open) empty |
892030194015
added operations to Cset with code equations in backing implementations
Andreas Lochbihler
parents:
43241
diff
changeset
|
105 |
|
892030194015
added operations to Cset with code equations in backing implementations
Andreas Lochbihler
parents:
43241
diff
changeset
|
106 |
abbreviation UNIV :: "'a Cset.set" where "UNIV \<equiv> top" |
892030194015
added operations to Cset with code equations in backing implementations
Andreas Lochbihler
parents:
43241
diff
changeset
|
107 |
hide_const (open) UNIV |
892030194015
added operations to Cset with code equations in backing implementations
Andreas Lochbihler
parents:
43241
diff
changeset
|
108 |
|
40672
abd4e7358847
replaced misleading Fset/fset name -- these do not stand for finite sets
haftmann
parents:
40604
diff
changeset
|
109 |
definition is_empty :: "'a Cset.set \<Rightarrow> bool" where |
44555 | 110 |
[simp]: "is_empty A \<longleftrightarrow> More_Set.is_empty (set_of A)" |
31807 | 111 |
|
40672
abd4e7358847
replaced misleading Fset/fset name -- these do not stand for finite sets
haftmann
parents:
40604
diff
changeset
|
112 |
definition insert :: "'a \<Rightarrow> 'a Cset.set \<Rightarrow> 'a Cset.set" where |
44555 | 113 |
[simp]: "insert x A = Set (Set.insert x (set_of A))" |
31807 | 114 |
|
40672
abd4e7358847
replaced misleading Fset/fset name -- these do not stand for finite sets
haftmann
parents:
40604
diff
changeset
|
115 |
definition remove :: "'a \<Rightarrow> 'a Cset.set \<Rightarrow> 'a Cset.set" where |
44555 | 116 |
[simp]: "remove x A = Set (More_Set.remove x (set_of A))" |
31807 | 117 |
|
40672
abd4e7358847
replaced misleading Fset/fset name -- these do not stand for finite sets
haftmann
parents:
40604
diff
changeset
|
118 |
definition map :: "('a \<Rightarrow> 'b) \<Rightarrow> 'a Cset.set \<Rightarrow> 'b Cset.set" where |
44555 | 119 |
[simp]: "map f A = Set (image f (set_of A))" |
31807 | 120 |
|
41505
6d19301074cf
"enriched_type" replaces less specific "type_lifting"
haftmann
parents:
41372
diff
changeset
|
121 |
enriched_type map: map |
41372 | 122 |
by (simp_all add: fun_eq_iff image_compose) |
40604 | 123 |
|
40672
abd4e7358847
replaced misleading Fset/fset name -- these do not stand for finite sets
haftmann
parents:
40604
diff
changeset
|
124 |
definition filter :: "('a \<Rightarrow> bool) \<Rightarrow> 'a Cset.set \<Rightarrow> 'a Cset.set" where |
44555 | 125 |
[simp]: "filter P A = Set (More_Set.project P (set_of A))" |
31807 | 126 |
|
40672
abd4e7358847
replaced misleading Fset/fset name -- these do not stand for finite sets
haftmann
parents:
40604
diff
changeset
|
127 |
definition forall :: "('a \<Rightarrow> bool) \<Rightarrow> 'a Cset.set \<Rightarrow> bool" where |
44555 | 128 |
[simp]: "forall P A \<longleftrightarrow> Ball (set_of A) P" |
31807 | 129 |
|
40672
abd4e7358847
replaced misleading Fset/fset name -- these do not stand for finite sets
haftmann
parents:
40604
diff
changeset
|
130 |
definition exists :: "('a \<Rightarrow> bool) \<Rightarrow> 'a Cset.set \<Rightarrow> bool" where |
44555 | 131 |
[simp]: "exists P A \<longleftrightarrow> Bex (set_of A) P" |
31807 | 132 |
|
40672
abd4e7358847
replaced misleading Fset/fset name -- these do not stand for finite sets
haftmann
parents:
40604
diff
changeset
|
133 |
definition card :: "'a Cset.set \<Rightarrow> nat" where |
44555 | 134 |
[simp]: "card A = Finite_Set.card (set_of A)" |
43241 | 135 |
|
34048 | 136 |
context complete_lattice |
137 |
begin |
|
31807 | 138 |
|
40672
abd4e7358847
replaced misleading Fset/fset name -- these do not stand for finite sets
haftmann
parents:
40604
diff
changeset
|
139 |
definition Infimum :: "'a Cset.set \<Rightarrow> 'a" where |
44555 | 140 |
[simp]: "Infimum A = Inf (set_of A)" |
31807 | 141 |
|
40672
abd4e7358847
replaced misleading Fset/fset name -- these do not stand for finite sets
haftmann
parents:
40604
diff
changeset
|
142 |
definition Supremum :: "'a Cset.set \<Rightarrow> 'a" where |
44555 | 143 |
[simp]: "Supremum A = Sup (set_of A)" |
34048 | 144 |
|
145 |
end |
|
31807 | 146 |
|
43971
892030194015
added operations to Cset with code equations in backing implementations
Andreas Lochbihler
parents:
43241
diff
changeset
|
147 |
subsection {* More operations *} |
892030194015
added operations to Cset with code equations in backing implementations
Andreas Lochbihler
parents:
43241
diff
changeset
|
148 |
|
892030194015
added operations to Cset with code equations in backing implementations
Andreas Lochbihler
parents:
43241
diff
changeset
|
149 |
text {* conversion from @{typ "'a list"} *} |
892030194015
added operations to Cset with code equations in backing implementations
Andreas Lochbihler
parents:
43241
diff
changeset
|
150 |
|
892030194015
added operations to Cset with code equations in backing implementations
Andreas Lochbihler
parents:
43241
diff
changeset
|
151 |
definition set :: "'a list \<Rightarrow> 'a Cset.set" where |
892030194015
added operations to Cset with code equations in backing implementations
Andreas Lochbihler
parents:
43241
diff
changeset
|
152 |
"set xs = Set (List.set xs)" |
892030194015
added operations to Cset with code equations in backing implementations
Andreas Lochbihler
parents:
43241
diff
changeset
|
153 |
hide_const (open) set |
892030194015
added operations to Cset with code equations in backing implementations
Andreas Lochbihler
parents:
43241
diff
changeset
|
154 |
|
892030194015
added operations to Cset with code equations in backing implementations
Andreas Lochbihler
parents:
43241
diff
changeset
|
155 |
text {* conversion from @{typ "'a Predicate.pred"} *} |
892030194015
added operations to Cset with code equations in backing implementations
Andreas Lochbihler
parents:
43241
diff
changeset
|
156 |
|
44555 | 157 |
definition pred_of_cset :: "'a Cset.set \<Rightarrow> 'a Predicate.pred" where |
158 |
[code del]: "pred_of_cset = Predicate.Pred \<circ> Cset.member" |
|
43971
892030194015
added operations to Cset with code equations in backing implementations
Andreas Lochbihler
parents:
43241
diff
changeset
|
159 |
|
44555 | 160 |
definition of_pred :: "'a Predicate.pred \<Rightarrow> 'a Cset.set" where |
161 |
"of_pred = Cset.Set \<circ> Collect \<circ> Predicate.eval" |
|
43971
892030194015
added operations to Cset with code equations in backing implementations
Andreas Lochbihler
parents:
43241
diff
changeset
|
162 |
|
44555 | 163 |
definition of_seq :: "'a Predicate.seq \<Rightarrow> 'a Cset.set" where |
164 |
"of_seq = of_pred \<circ> Predicate.pred_of_seq" |
|
43971
892030194015
added operations to Cset with code equations in backing implementations
Andreas Lochbihler
parents:
43241
diff
changeset
|
165 |
|
892030194015
added operations to Cset with code equations in backing implementations
Andreas Lochbihler
parents:
43241
diff
changeset
|
166 |
text {* monad operations *} |
892030194015
added operations to Cset with code equations in backing implementations
Andreas Lochbihler
parents:
43241
diff
changeset
|
167 |
|
892030194015
added operations to Cset with code equations in backing implementations
Andreas Lochbihler
parents:
43241
diff
changeset
|
168 |
definition single :: "'a \<Rightarrow> 'a Cset.set" where |
892030194015
added operations to Cset with code equations in backing implementations
Andreas Lochbihler
parents:
43241
diff
changeset
|
169 |
"single a = Set {a}" |
892030194015
added operations to Cset with code equations in backing implementations
Andreas Lochbihler
parents:
43241
diff
changeset
|
170 |
|
44555 | 171 |
definition bind :: "'a Cset.set \<Rightarrow> ('a \<Rightarrow> 'b Cset.set) \<Rightarrow> 'b Cset.set" (infixl "\<guillemotright>=" 70) where |
172 |
"A \<guillemotright>= f = (SUP x : set_of A. f x)" |
|
173 |
||
31807 | 174 |
|
31846 | 175 |
subsection {* Simplified simprules *} |
176 |
||
44555 | 177 |
lemma empty_simp [simp]: "member Cset.empty = bot" |
178 |
by (simp add: fun_eq_iff bot_apply) |
|
43971
892030194015
added operations to Cset with code equations in backing implementations
Andreas Lochbihler
parents:
43241
diff
changeset
|
179 |
|
44555 | 180 |
lemma UNIV_simp [simp]: "member Cset.UNIV = top" |
181 |
by (simp add: fun_eq_iff top_apply) |
|
43971
892030194015
added operations to Cset with code equations in backing implementations
Andreas Lochbihler
parents:
43241
diff
changeset
|
182 |
|
31846 | 183 |
lemma is_empty_simp [simp]: |
44555 | 184 |
"is_empty A \<longleftrightarrow> set_of A = {}" |
37024
e938a0b5286e
renamed List_Set to the now more appropriate More_Set
haftmann
parents:
37023
diff
changeset
|
185 |
by (simp add: More_Set.is_empty_def) |
31846 | 186 |
declare is_empty_def [simp del] |
187 |
||
188 |
lemma remove_simp [simp]: |
|
44555 | 189 |
"remove x A = Set (set_of A - {x})" |
37024
e938a0b5286e
renamed List_Set to the now more appropriate More_Set
haftmann
parents:
37023
diff
changeset
|
190 |
by (simp add: More_Set.remove_def) |
31846 | 191 |
declare remove_def [simp del] |
192 |
||
31847 | 193 |
lemma filter_simp [simp]: |
44555 | 194 |
"filter P A = Set {x \<in> set_of A. P x}" |
37024
e938a0b5286e
renamed List_Set to the now more appropriate More_Set
haftmann
parents:
37023
diff
changeset
|
195 |
by (simp add: More_Set.project_def) |
31847 | 196 |
declare filter_def [simp del] |
31846 | 197 |
|
44555 | 198 |
lemma set_of_set [simp]: |
199 |
"set_of (Cset.set xs) = set xs" |
|
43971
892030194015
added operations to Cset with code equations in backing implementations
Andreas Lochbihler
parents:
43241
diff
changeset
|
200 |
by (simp add: set_def) |
44555 | 201 |
hide_fact (open) set_def |
43971
892030194015
added operations to Cset with code equations in backing implementations
Andreas Lochbihler
parents:
43241
diff
changeset
|
202 |
|
892030194015
added operations to Cset with code equations in backing implementations
Andreas Lochbihler
parents:
43241
diff
changeset
|
203 |
lemma set_simps [simp]: |
892030194015
added operations to Cset with code equations in backing implementations
Andreas Lochbihler
parents:
43241
diff
changeset
|
204 |
"Cset.set [] = Cset.empty" |
892030194015
added operations to Cset with code equations in backing implementations
Andreas Lochbihler
parents:
43241
diff
changeset
|
205 |
"Cset.set (x # xs) = insert x (Cset.set xs)" |
892030194015
added operations to Cset with code equations in backing implementations
Andreas Lochbihler
parents:
43241
diff
changeset
|
206 |
by(simp_all add: Cset.set_def) |
892030194015
added operations to Cset with code equations in backing implementations
Andreas Lochbihler
parents:
43241
diff
changeset
|
207 |
|
44555 | 208 |
lemma member_SUP [simp]: |
43971
892030194015
added operations to Cset with code equations in backing implementations
Andreas Lochbihler
parents:
43241
diff
changeset
|
209 |
"member (SUPR A f) = SUPR A (member \<circ> f)" |
44555 | 210 |
by (auto simp add: fun_eq_iff SUP_apply member_def, unfold SUP_def, auto) |
43971
892030194015
added operations to Cset with code equations in backing implementations
Andreas Lochbihler
parents:
43241
diff
changeset
|
211 |
|
892030194015
added operations to Cset with code equations in backing implementations
Andreas Lochbihler
parents:
43241
diff
changeset
|
212 |
lemma member_bind [simp]: |
44555 | 213 |
"member (P \<guillemotright>= f) = SUPR (set_of P) (member \<circ> f)" |
214 |
by (simp add: bind_def Cset.set_eq_iff) |
|
43971
892030194015
added operations to Cset with code equations in backing implementations
Andreas Lochbihler
parents:
43241
diff
changeset
|
215 |
|
892030194015
added operations to Cset with code equations in backing implementations
Andreas Lochbihler
parents:
43241
diff
changeset
|
216 |
lemma member_single [simp]: |
44555 | 217 |
"member (single a) = (\<lambda>x. x \<in> {a})" |
218 |
by (simp add: single_def fun_eq_iff) |
|
43971
892030194015
added operations to Cset with code equations in backing implementations
Andreas Lochbihler
parents:
43241
diff
changeset
|
219 |
|
892030194015
added operations to Cset with code equations in backing implementations
Andreas Lochbihler
parents:
43241
diff
changeset
|
220 |
lemma single_sup_simps [simp]: |
892030194015
added operations to Cset with code equations in backing implementations
Andreas Lochbihler
parents:
43241
diff
changeset
|
221 |
shows single_sup: "sup (single a) A = insert a A" |
892030194015
added operations to Cset with code equations in backing implementations
Andreas Lochbihler
parents:
43241
diff
changeset
|
222 |
and sup_single: "sup A (single a) = insert a A" |
44555 | 223 |
by (auto simp add: Cset.set_eq_iff single_def) |
43971
892030194015
added operations to Cset with code equations in backing implementations
Andreas Lochbihler
parents:
43241
diff
changeset
|
224 |
|
892030194015
added operations to Cset with code equations in backing implementations
Andreas Lochbihler
parents:
43241
diff
changeset
|
225 |
lemma single_bind [simp]: |
892030194015
added operations to Cset with code equations in backing implementations
Andreas Lochbihler
parents:
43241
diff
changeset
|
226 |
"single a \<guillemotright>= B = B a" |
44555 | 227 |
by (simp add: Cset.set_eq_iff SUP_insert single_def) |
43971
892030194015
added operations to Cset with code equations in backing implementations
Andreas Lochbihler
parents:
43241
diff
changeset
|
228 |
|
892030194015
added operations to Cset with code equations in backing implementations
Andreas Lochbihler
parents:
43241
diff
changeset
|
229 |
lemma bind_bind: |
892030194015
added operations to Cset with code equations in backing implementations
Andreas Lochbihler
parents:
43241
diff
changeset
|
230 |
"(A \<guillemotright>= B) \<guillemotright>= C = A \<guillemotright>= (\<lambda>x. B x \<guillemotright>= C)" |
44555 | 231 |
by (simp add: bind_def, simp only: SUP_def image_image, simp) |
232 |
||
43971
892030194015
added operations to Cset with code equations in backing implementations
Andreas Lochbihler
parents:
43241
diff
changeset
|
233 |
lemma bind_single [simp]: |
892030194015
added operations to Cset with code equations in backing implementations
Andreas Lochbihler
parents:
43241
diff
changeset
|
234 |
"A \<guillemotright>= single = A" |
44555 | 235 |
by (simp add: Cset.set_eq_iff SUP_apply fun_eq_iff single_def member_def) |
43971
892030194015
added operations to Cset with code equations in backing implementations
Andreas Lochbihler
parents:
43241
diff
changeset
|
236 |
|
892030194015
added operations to Cset with code equations in backing implementations
Andreas Lochbihler
parents:
43241
diff
changeset
|
237 |
lemma bind_const: "A \<guillemotright>= (\<lambda>_. B) = (if Cset.is_empty A then Cset.empty else B)" |
44555 | 238 |
by (auto simp add: Cset.set_eq_iff fun_eq_iff) |
43971
892030194015
added operations to Cset with code equations in backing implementations
Andreas Lochbihler
parents:
43241
diff
changeset
|
239 |
|
892030194015
added operations to Cset with code equations in backing implementations
Andreas Lochbihler
parents:
43241
diff
changeset
|
240 |
lemma empty_bind [simp]: |
892030194015
added operations to Cset with code equations in backing implementations
Andreas Lochbihler
parents:
43241
diff
changeset
|
241 |
"Cset.empty \<guillemotright>= f = Cset.empty" |
44555 | 242 |
by (simp add: Cset.set_eq_iff fun_eq_iff bot_apply) |
43971
892030194015
added operations to Cset with code equations in backing implementations
Andreas Lochbihler
parents:
43241
diff
changeset
|
243 |
|
892030194015
added operations to Cset with code equations in backing implementations
Andreas Lochbihler
parents:
43241
diff
changeset
|
244 |
lemma member_of_pred [simp]: |
44555 | 245 |
"member (of_pred P) = (\<lambda>x. x \<in> {x. Predicate.eval P x})" |
246 |
by (simp add: of_pred_def fun_eq_iff) |
|
43971
892030194015
added operations to Cset with code equations in backing implementations
Andreas Lochbihler
parents:
43241
diff
changeset
|
247 |
|
892030194015
added operations to Cset with code equations in backing implementations
Andreas Lochbihler
parents:
43241
diff
changeset
|
248 |
lemma member_of_seq [simp]: |
44555 | 249 |
"member (of_seq xq) = (\<lambda>x. x \<in> {x. Predicate.member xq x})" |
250 |
by (simp add: of_seq_def eval_member) |
|
43971
892030194015
added operations to Cset with code equations in backing implementations
Andreas Lochbihler
parents:
43241
diff
changeset
|
251 |
|
892030194015
added operations to Cset with code equations in backing implementations
Andreas Lochbihler
parents:
43241
diff
changeset
|
252 |
lemma eval_pred_of_cset [simp]: |
892030194015
added operations to Cset with code equations in backing implementations
Andreas Lochbihler
parents:
43241
diff
changeset
|
253 |
"Predicate.eval (pred_of_cset A) = Cset.member A" |
44555 | 254 |
by (simp add: pred_of_cset_def) |
43971
892030194015
added operations to Cset with code equations in backing implementations
Andreas Lochbihler
parents:
43241
diff
changeset
|
255 |
|
892030194015
added operations to Cset with code equations in backing implementations
Andreas Lochbihler
parents:
43241
diff
changeset
|
256 |
subsection {* Default implementations *} |
892030194015
added operations to Cset with code equations in backing implementations
Andreas Lochbihler
parents:
43241
diff
changeset
|
257 |
|
892030194015
added operations to Cset with code equations in backing implementations
Andreas Lochbihler
parents:
43241
diff
changeset
|
258 |
lemma set_code [code]: |
44555 | 259 |
"Cset.set = (\<lambda>xs. fold insert xs Cset.empty)" |
260 |
proof (rule ext, rule Cset.set_eqI) |
|
261 |
fix xs :: "'a list" |
|
262 |
show "member (Cset.set xs) = member (fold insert xs Cset.empty)" |
|
263 |
by (simp add: fold_commute_apply [symmetric, where ?h = Set and ?g = Set.insert] |
|
264 |
fun_eq_iff Cset.set_def union_set [symmetric]) |
|
43971
892030194015
added operations to Cset with code equations in backing implementations
Andreas Lochbihler
parents:
43241
diff
changeset
|
265 |
qed |
892030194015
added operations to Cset with code equations in backing implementations
Andreas Lochbihler
parents:
43241
diff
changeset
|
266 |
|
892030194015
added operations to Cset with code equations in backing implementations
Andreas Lochbihler
parents:
43241
diff
changeset
|
267 |
lemma single_code [code]: |
892030194015
added operations to Cset with code equations in backing implementations
Andreas Lochbihler
parents:
43241
diff
changeset
|
268 |
"single a = insert a Cset.empty" |
44555 | 269 |
by (simp add: Cset.single_def) |
43971
892030194015
added operations to Cset with code equations in backing implementations
Andreas Lochbihler
parents:
43241
diff
changeset
|
270 |
|
892030194015
added operations to Cset with code equations in backing implementations
Andreas Lochbihler
parents:
43241
diff
changeset
|
271 |
lemma of_pred_code [code]: |
892030194015
added operations to Cset with code equations in backing implementations
Andreas Lochbihler
parents:
43241
diff
changeset
|
272 |
"of_pred (Predicate.Seq f) = (case f () of |
892030194015
added operations to Cset with code equations in backing implementations
Andreas Lochbihler
parents:
43241
diff
changeset
|
273 |
Predicate.Empty \<Rightarrow> Cset.empty |
892030194015
added operations to Cset with code equations in backing implementations
Andreas Lochbihler
parents:
43241
diff
changeset
|
274 |
| Predicate.Insert x P \<Rightarrow> Cset.insert x (of_pred P) |
892030194015
added operations to Cset with code equations in backing implementations
Andreas Lochbihler
parents:
43241
diff
changeset
|
275 |
| Predicate.Join P xq \<Rightarrow> sup (of_pred P) (of_seq xq))" |
44555 | 276 |
apply (auto split: seq.split simp add: Predicate.Seq_def of_pred_def Cset.set_eq_iff sup_apply eval_member [symmetric] member_def [symmetric] Collect_def mem_def member_set_of) |
277 |
apply (unfold Set.insert_def Collect_def sup_apply member_set_of) |
|
278 |
apply simp_all |
|
279 |
done |
|
43971
892030194015
added operations to Cset with code equations in backing implementations
Andreas Lochbihler
parents:
43241
diff
changeset
|
280 |
|
892030194015
added operations to Cset with code equations in backing implementations
Andreas Lochbihler
parents:
43241
diff
changeset
|
281 |
lemma of_seq_code [code]: |
892030194015
added operations to Cset with code equations in backing implementations
Andreas Lochbihler
parents:
43241
diff
changeset
|
282 |
"of_seq Predicate.Empty = Cset.empty" |
892030194015
added operations to Cset with code equations in backing implementations
Andreas Lochbihler
parents:
43241
diff
changeset
|
283 |
"of_seq (Predicate.Insert x P) = Cset.insert x (of_pred P)" |
892030194015
added operations to Cset with code equations in backing implementations
Andreas Lochbihler
parents:
43241
diff
changeset
|
284 |
"of_seq (Predicate.Join P xq) = sup (of_pred P) (of_seq xq)" |
44555 | 285 |
apply (auto simp add: of_seq_def of_pred_def Cset.set_eq_iff mem_def Collect_def) |
286 |
apply (unfold Set.insert_def Collect_def sup_apply member_set_of) |
|
287 |
apply simp_all |
|
288 |
done |
|
31846 | 289 |
|
43971
892030194015
added operations to Cset with code equations in backing implementations
Andreas Lochbihler
parents:
43241
diff
changeset
|
290 |
no_notation bind (infixl "\<guillemotright>=" 70) |
31849 | 291 |
|
43241 | 292 |
hide_const (open) is_empty insert remove map filter forall exists card |
43971
892030194015
added operations to Cset with code equations in backing implementations
Andreas Lochbihler
parents:
43241
diff
changeset
|
293 |
Inter Union bind single of_pred of_seq |
892030194015
added operations to Cset with code equations in backing implementations
Andreas Lochbihler
parents:
43241
diff
changeset
|
294 |
|
892030194015
added operations to Cset with code equations in backing implementations
Andreas Lochbihler
parents:
43241
diff
changeset
|
295 |
hide_fact (open) set_def pred_of_cset_def of_pred_def of_seq_def single_def |
44555 | 296 |
bind_def empty_simp UNIV_simp set_simps member_bind |
43971
892030194015
added operations to Cset with code equations in backing implementations
Andreas Lochbihler
parents:
43241
diff
changeset
|
297 |
member_single single_sup_simps single_sup sup_single single_bind |
892030194015
added operations to Cset with code equations in backing implementations
Andreas Lochbihler
parents:
43241
diff
changeset
|
298 |
bind_bind bind_single bind_const empty_bind member_of_pred member_of_seq |
892030194015
added operations to Cset with code equations in backing implementations
Andreas Lochbihler
parents:
43241
diff
changeset
|
299 |
eval_pred_of_cset set_code single_code of_pred_code of_seq_code |
31849 | 300 |
|
31807 | 301 |
end |