author | wenzelm |
Sat, 12 Jan 2013 14:53:56 +0100 | |
changeset 50843 | 1465521b92a1 |
parent 49834 | b27bbb021df1 |
child 51126 | df86080de4cb |
permissions | -rw-r--r-- |
10249 | 1 |
(* Title: HOL/Library/Multiset.thy |
15072 | 2 |
Author: Tobias Nipkow, Markus Wenzel, Lawrence C Paulson, Norbert Voelker |
10249 | 3 |
*) |
4 |
||
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
5 |
header {* (Finite) multisets *} |
10249 | 6 |
|
15131 | 7 |
theory Multiset |
46237 | 8 |
imports Main DAList |
15131 | 9 |
begin |
10249 | 10 |
|
11 |
subsection {* The type of multisets *} |
|
12 |
||
45694
4a8743618257
prefer typedef without extra definition and alternative name;
wenzelm
parents:
45608
diff
changeset
|
13 |
definition "multiset = {f :: 'a => nat. finite {x. f x > 0}}" |
4a8743618257
prefer typedef without extra definition and alternative name;
wenzelm
parents:
45608
diff
changeset
|
14 |
|
49834 | 15 |
typedef 'a multiset = "multiset :: ('a => nat) set" |
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
16 |
morphisms count Abs_multiset |
45694
4a8743618257
prefer typedef without extra definition and alternative name;
wenzelm
parents:
45608
diff
changeset
|
17 |
unfolding multiset_def |
10249 | 18 |
proof |
45694
4a8743618257
prefer typedef without extra definition and alternative name;
wenzelm
parents:
45608
diff
changeset
|
19 |
show "(\<lambda>x. 0::nat) \<in> {f. finite {x. f x > 0}}" by simp |
10249 | 20 |
qed |
21 |
||
47429
ec64d94cbf9c
multiset operations are defined with lift_definitions;
bulwahn
parents:
47308
diff
changeset
|
22 |
setup_lifting type_definition_multiset |
19086 | 23 |
|
28708
a1a436f09ec6
explicit check for pattern discipline before code translation
haftmann
parents:
28562
diff
changeset
|
24 |
abbreviation Melem :: "'a => 'a multiset => bool" ("(_/ :# _)" [50, 51] 50) where |
25610 | 25 |
"a :# M == 0 < count M a" |
26 |
||
26145 | 27 |
notation (xsymbols) |
28 |
Melem (infix "\<in>#" 50) |
|
10249 | 29 |
|
39302
d7728f65b353
renamed lemmas: ext_iff -> fun_eq_iff, set_ext_iff -> set_eq_iff, set_ext -> set_eqI
nipkow
parents:
39301
diff
changeset
|
30 |
lemma multiset_eq_iff: |
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
31 |
"M = N \<longleftrightarrow> (\<forall>a. count M a = count N a)" |
39302
d7728f65b353
renamed lemmas: ext_iff -> fun_eq_iff, set_ext_iff -> set_eq_iff, set_ext -> set_eqI
nipkow
parents:
39301
diff
changeset
|
32 |
by (simp only: count_inject [symmetric] fun_eq_iff) |
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
33 |
|
39302
d7728f65b353
renamed lemmas: ext_iff -> fun_eq_iff, set_ext_iff -> set_eq_iff, set_ext -> set_eqI
nipkow
parents:
39301
diff
changeset
|
34 |
lemma multiset_eqI: |
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
35 |
"(\<And>x. count A x = count B x) \<Longrightarrow> A = B" |
39302
d7728f65b353
renamed lemmas: ext_iff -> fun_eq_iff, set_ext_iff -> set_eq_iff, set_ext -> set_eqI
nipkow
parents:
39301
diff
changeset
|
36 |
using multiset_eq_iff by auto |
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
37 |
|
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
38 |
text {* |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
39 |
\medskip Preservation of the representing set @{term multiset}. |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
40 |
*} |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
41 |
|
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
42 |
lemma const0_in_multiset: |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
43 |
"(\<lambda>a. 0) \<in> multiset" |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
44 |
by (simp add: multiset_def) |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
45 |
|
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
46 |
lemma only1_in_multiset: |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
47 |
"(\<lambda>b. if b = a then n else 0) \<in> multiset" |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
48 |
by (simp add: multiset_def) |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
49 |
|
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
50 |
lemma union_preserves_multiset: |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
51 |
"M \<in> multiset \<Longrightarrow> N \<in> multiset \<Longrightarrow> (\<lambda>a. M a + N a) \<in> multiset" |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
52 |
by (simp add: multiset_def) |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
53 |
|
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
54 |
lemma diff_preserves_multiset: |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
55 |
assumes "M \<in> multiset" |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
56 |
shows "(\<lambda>a. M a - N a) \<in> multiset" |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
57 |
proof - |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
58 |
have "{x. N x < M x} \<subseteq> {x. 0 < M x}" |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
59 |
by auto |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
60 |
with assms show ?thesis |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
61 |
by (auto simp add: multiset_def intro: finite_subset) |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
62 |
qed |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
63 |
|
41069
6fabc0414055
name filter operation just filter (c.f. List.filter and list comprehension syntax)
haftmann
parents:
40968
diff
changeset
|
64 |
lemma filter_preserves_multiset: |
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
65 |
assumes "M \<in> multiset" |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
66 |
shows "(\<lambda>x. if P x then M x else 0) \<in> multiset" |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
67 |
proof - |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
68 |
have "{x. (P x \<longrightarrow> 0 < M x) \<and> P x} \<subseteq> {x. 0 < M x}" |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
69 |
by auto |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
70 |
with assms show ?thesis |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
71 |
by (auto simp add: multiset_def intro: finite_subset) |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
72 |
qed |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
73 |
|
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
74 |
lemmas in_multiset = const0_in_multiset only1_in_multiset |
41069
6fabc0414055
name filter operation just filter (c.f. List.filter and list comprehension syntax)
haftmann
parents:
40968
diff
changeset
|
75 |
union_preserves_multiset diff_preserves_multiset filter_preserves_multiset |
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
76 |
|
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
77 |
|
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
78 |
subsection {* Representing multisets *} |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
79 |
|
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
80 |
text {* Multiset enumeration *} |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
81 |
|
48008 | 82 |
instantiation multiset :: (type) cancel_comm_monoid_add |
25571
c9e39eafc7a0
instantiation target rather than legacy instance
haftmann
parents:
25507
diff
changeset
|
83 |
begin |
c9e39eafc7a0
instantiation target rather than legacy instance
haftmann
parents:
25507
diff
changeset
|
84 |
|
47429
ec64d94cbf9c
multiset operations are defined with lift_definitions;
bulwahn
parents:
47308
diff
changeset
|
85 |
lift_definition zero_multiset :: "'a multiset" is "\<lambda>a. 0" |
ec64d94cbf9c
multiset operations are defined with lift_definitions;
bulwahn
parents:
47308
diff
changeset
|
86 |
by (rule const0_in_multiset) |
25571
c9e39eafc7a0
instantiation target rather than legacy instance
haftmann
parents:
25507
diff
changeset
|
87 |
|
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
88 |
abbreviation Mempty :: "'a multiset" ("{#}") where |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
89 |
"Mempty \<equiv> 0" |
25571
c9e39eafc7a0
instantiation target rather than legacy instance
haftmann
parents:
25507
diff
changeset
|
90 |
|
47429
ec64d94cbf9c
multiset operations are defined with lift_definitions;
bulwahn
parents:
47308
diff
changeset
|
91 |
lift_definition plus_multiset :: "'a multiset => 'a multiset => 'a multiset" is "\<lambda>M N. (\<lambda>a. M a + N a)" |
ec64d94cbf9c
multiset operations are defined with lift_definitions;
bulwahn
parents:
47308
diff
changeset
|
92 |
by (rule union_preserves_multiset) |
25571
c9e39eafc7a0
instantiation target rather than legacy instance
haftmann
parents:
25507
diff
changeset
|
93 |
|
48008 | 94 |
instance |
95 |
by default (transfer, simp add: fun_eq_iff)+ |
|
25571
c9e39eafc7a0
instantiation target rather than legacy instance
haftmann
parents:
25507
diff
changeset
|
96 |
|
c9e39eafc7a0
instantiation target rather than legacy instance
haftmann
parents:
25507
diff
changeset
|
97 |
end |
10249 | 98 |
|
47429
ec64d94cbf9c
multiset operations are defined with lift_definitions;
bulwahn
parents:
47308
diff
changeset
|
99 |
lift_definition single :: "'a => 'a multiset" is "\<lambda>a b. if b = a then 1 else 0" |
ec64d94cbf9c
multiset operations are defined with lift_definitions;
bulwahn
parents:
47308
diff
changeset
|
100 |
by (rule only1_in_multiset) |
15869 | 101 |
|
26145 | 102 |
syntax |
26176 | 103 |
"_multiset" :: "args => 'a multiset" ("{#(_)#}") |
25507 | 104 |
translations |
105 |
"{#x, xs#}" == "{#x#} + {#xs#}" |
|
106 |
"{#x#}" == "CONST single x" |
|
107 |
||
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
108 |
lemma count_empty [simp]: "count {#} a = 0" |
47429
ec64d94cbf9c
multiset operations are defined with lift_definitions;
bulwahn
parents:
47308
diff
changeset
|
109 |
by (simp add: zero_multiset.rep_eq) |
10249 | 110 |
|
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
111 |
lemma count_single [simp]: "count {#b#} a = (if b = a then 1 else 0)" |
47429
ec64d94cbf9c
multiset operations are defined with lift_definitions;
bulwahn
parents:
47308
diff
changeset
|
112 |
by (simp add: single.rep_eq) |
29901 | 113 |
|
10249 | 114 |
|
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
115 |
subsection {* Basic operations *} |
10249 | 116 |
|
117 |
subsubsection {* Union *} |
|
118 |
||
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
119 |
lemma count_union [simp]: "count (M + N) a = count M a + count N a" |
47429
ec64d94cbf9c
multiset operations are defined with lift_definitions;
bulwahn
parents:
47308
diff
changeset
|
120 |
by (simp add: plus_multiset.rep_eq) |
10249 | 121 |
|
122 |
||
123 |
subsubsection {* Difference *} |
|
124 |
||
49388 | 125 |
instantiation multiset :: (type) comm_monoid_diff |
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
126 |
begin |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
127 |
|
47429
ec64d94cbf9c
multiset operations are defined with lift_definitions;
bulwahn
parents:
47308
diff
changeset
|
128 |
lift_definition minus_multiset :: "'a multiset => 'a multiset => 'a multiset" is "\<lambda> M N. \<lambda>a. M a - N a" |
ec64d94cbf9c
multiset operations are defined with lift_definitions;
bulwahn
parents:
47308
diff
changeset
|
129 |
by (rule diff_preserves_multiset) |
ec64d94cbf9c
multiset operations are defined with lift_definitions;
bulwahn
parents:
47308
diff
changeset
|
130 |
|
49388 | 131 |
instance |
132 |
by default (transfer, simp add: fun_eq_iff)+ |
|
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
133 |
|
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
134 |
end |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
135 |
|
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
136 |
lemma count_diff [simp]: "count (M - N) a = count M a - count N a" |
47429
ec64d94cbf9c
multiset operations are defined with lift_definitions;
bulwahn
parents:
47308
diff
changeset
|
137 |
by (simp add: minus_multiset.rep_eq) |
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
138 |
|
17161 | 139 |
lemma diff_empty [simp]: "M - {#} = M \<and> {#} - M = {#}" |
39302
d7728f65b353
renamed lemmas: ext_iff -> fun_eq_iff, set_ext_iff -> set_eq_iff, set_ext -> set_eqI
nipkow
parents:
39301
diff
changeset
|
140 |
by(simp add: multiset_eq_iff) |
36903 | 141 |
|
142 |
lemma diff_cancel[simp]: "A - A = {#}" |
|
39302
d7728f65b353
renamed lemmas: ext_iff -> fun_eq_iff, set_ext_iff -> set_eq_iff, set_ext -> set_eqI
nipkow
parents:
39301
diff
changeset
|
143 |
by (rule multiset_eqI) simp |
10249 | 144 |
|
36903 | 145 |
lemma diff_union_cancelR [simp]: "M + N - N = (M::'a multiset)" |
39302
d7728f65b353
renamed lemmas: ext_iff -> fun_eq_iff, set_ext_iff -> set_eq_iff, set_ext -> set_eqI
nipkow
parents:
39301
diff
changeset
|
146 |
by(simp add: multiset_eq_iff) |
10249 | 147 |
|
36903 | 148 |
lemma diff_union_cancelL [simp]: "N + M - N = (M::'a multiset)" |
39302
d7728f65b353
renamed lemmas: ext_iff -> fun_eq_iff, set_ext_iff -> set_eq_iff, set_ext -> set_eqI
nipkow
parents:
39301
diff
changeset
|
149 |
by(simp add: multiset_eq_iff) |
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
150 |
|
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
151 |
lemma insert_DiffM: |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
152 |
"x \<in># M \<Longrightarrow> {#x#} + (M - {#x#}) = M" |
39302
d7728f65b353
renamed lemmas: ext_iff -> fun_eq_iff, set_ext_iff -> set_eq_iff, set_ext -> set_eqI
nipkow
parents:
39301
diff
changeset
|
153 |
by (clarsimp simp: multiset_eq_iff) |
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
154 |
|
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
155 |
lemma insert_DiffM2 [simp]: |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
156 |
"x \<in># M \<Longrightarrow> M - {#x#} + {#x#} = M" |
39302
d7728f65b353
renamed lemmas: ext_iff -> fun_eq_iff, set_ext_iff -> set_eq_iff, set_ext -> set_eqI
nipkow
parents:
39301
diff
changeset
|
157 |
by (clarsimp simp: multiset_eq_iff) |
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
158 |
|
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
159 |
lemma diff_right_commute: |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
160 |
"(M::'a multiset) - N - Q = M - Q - N" |
39302
d7728f65b353
renamed lemmas: ext_iff -> fun_eq_iff, set_ext_iff -> set_eq_iff, set_ext -> set_eqI
nipkow
parents:
39301
diff
changeset
|
161 |
by (auto simp add: multiset_eq_iff) |
36903 | 162 |
|
163 |
lemma diff_add: |
|
164 |
"(M::'a multiset) - (N + Q) = M - N - Q" |
|
39302
d7728f65b353
renamed lemmas: ext_iff -> fun_eq_iff, set_ext_iff -> set_eq_iff, set_ext -> set_eqI
nipkow
parents:
39301
diff
changeset
|
165 |
by (simp add: multiset_eq_iff) |
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
166 |
|
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
167 |
lemma diff_union_swap: |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
168 |
"a \<noteq> b \<Longrightarrow> M - {#a#} + {#b#} = M + {#b#} - {#a#}" |
39302
d7728f65b353
renamed lemmas: ext_iff -> fun_eq_iff, set_ext_iff -> set_eq_iff, set_ext -> set_eqI
nipkow
parents:
39301
diff
changeset
|
169 |
by (auto simp add: multiset_eq_iff) |
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
170 |
|
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
171 |
lemma diff_union_single_conv: |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
172 |
"a \<in># J \<Longrightarrow> I + J - {#a#} = I + (J - {#a#})" |
39302
d7728f65b353
renamed lemmas: ext_iff -> fun_eq_iff, set_ext_iff -> set_eq_iff, set_ext -> set_eqI
nipkow
parents:
39301
diff
changeset
|
173 |
by (simp add: multiset_eq_iff) |
26143
314c0bcb7df7
Added useful general lemmas from the work with the HeapMonad
bulwahn
parents:
26033
diff
changeset
|
174 |
|
10249 | 175 |
|
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
176 |
subsubsection {* Equality of multisets *} |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
177 |
|
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
178 |
lemma single_not_empty [simp]: "{#a#} \<noteq> {#} \<and> {#} \<noteq> {#a#}" |
39302
d7728f65b353
renamed lemmas: ext_iff -> fun_eq_iff, set_ext_iff -> set_eq_iff, set_ext -> set_eqI
nipkow
parents:
39301
diff
changeset
|
179 |
by (simp add: multiset_eq_iff) |
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
180 |
|
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
181 |
lemma single_eq_single [simp]: "{#a#} = {#b#} \<longleftrightarrow> a = b" |
39302
d7728f65b353
renamed lemmas: ext_iff -> fun_eq_iff, set_ext_iff -> set_eq_iff, set_ext -> set_eqI
nipkow
parents:
39301
diff
changeset
|
182 |
by (auto simp add: multiset_eq_iff) |
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
183 |
|
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
184 |
lemma union_eq_empty [iff]: "M + N = {#} \<longleftrightarrow> M = {#} \<and> N = {#}" |
39302
d7728f65b353
renamed lemmas: ext_iff -> fun_eq_iff, set_ext_iff -> set_eq_iff, set_ext -> set_eqI
nipkow
parents:
39301
diff
changeset
|
185 |
by (auto simp add: multiset_eq_iff) |
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
186 |
|
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
187 |
lemma empty_eq_union [iff]: "{#} = M + N \<longleftrightarrow> M = {#} \<and> N = {#}" |
39302
d7728f65b353
renamed lemmas: ext_iff -> fun_eq_iff, set_ext_iff -> set_eq_iff, set_ext -> set_eqI
nipkow
parents:
39301
diff
changeset
|
188 |
by (auto simp add: multiset_eq_iff) |
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
189 |
|
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
190 |
lemma multi_self_add_other_not_self [simp]: "M = M + {#x#} \<longleftrightarrow> False" |
39302
d7728f65b353
renamed lemmas: ext_iff -> fun_eq_iff, set_ext_iff -> set_eq_iff, set_ext -> set_eqI
nipkow
parents:
39301
diff
changeset
|
191 |
by (auto simp add: multiset_eq_iff) |
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
192 |
|
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
193 |
lemma diff_single_trivial: |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
194 |
"\<not> x \<in># M \<Longrightarrow> M - {#x#} = M" |
39302
d7728f65b353
renamed lemmas: ext_iff -> fun_eq_iff, set_ext_iff -> set_eq_iff, set_ext -> set_eqI
nipkow
parents:
39301
diff
changeset
|
195 |
by (auto simp add: multiset_eq_iff) |
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
196 |
|
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
197 |
lemma diff_single_eq_union: |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
198 |
"x \<in># M \<Longrightarrow> M - {#x#} = N \<longleftrightarrow> M = N + {#x#}" |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
199 |
by auto |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
200 |
|
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
201 |
lemma union_single_eq_diff: |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
202 |
"M + {#x#} = N \<Longrightarrow> M = N - {#x#}" |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
203 |
by (auto dest: sym) |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
204 |
|
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
205 |
lemma union_single_eq_member: |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
206 |
"M + {#x#} = N \<Longrightarrow> x \<in># N" |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
207 |
by auto |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
208 |
|
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
209 |
lemma union_is_single: |
46730 | 210 |
"M + N = {#a#} \<longleftrightarrow> M = {#a#} \<and> N={#} \<or> M = {#} \<and> N = {#a#}" (is "?lhs = ?rhs") |
211 |
proof |
|
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
212 |
assume ?rhs then show ?lhs by auto |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
213 |
next |
46730 | 214 |
assume ?lhs then show ?rhs |
215 |
by (simp add: multiset_eq_iff split:if_splits) (metis add_is_1) |
|
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
216 |
qed |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
217 |
|
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
218 |
lemma single_is_union: |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
219 |
"{#a#} = M + N \<longleftrightarrow> {#a#} = M \<and> N = {#} \<or> M = {#} \<and> {#a#} = N" |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
220 |
by (auto simp add: eq_commute [of "{#a#}" "M + N"] union_is_single) |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
221 |
|
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
222 |
lemma add_eq_conv_diff: |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
223 |
"M + {#a#} = N + {#b#} \<longleftrightarrow> M = N \<and> a = b \<or> M = N - {#a#} + {#b#} \<and> N = M - {#b#} + {#a#}" (is "?lhs = ?rhs") |
44890
22f665a2e91c
new fastforce replacing fastsimp - less confusing name
nipkow
parents:
44339
diff
changeset
|
224 |
(* shorter: by (simp add: multiset_eq_iff) fastforce *) |
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
225 |
proof |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
226 |
assume ?rhs then show ?lhs |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
227 |
by (auto simp add: add_assoc add_commute [of "{#b#}"]) |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
228 |
(drule sym, simp add: add_assoc [symmetric]) |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
229 |
next |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
230 |
assume ?lhs |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
231 |
show ?rhs |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
232 |
proof (cases "a = b") |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
233 |
case True with `?lhs` show ?thesis by simp |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
234 |
next |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
235 |
case False |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
236 |
from `?lhs` have "a \<in># N + {#b#}" by (rule union_single_eq_member) |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
237 |
with False have "a \<in># N" by auto |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
238 |
moreover from `?lhs` have "M = N + {#b#} - {#a#}" by (rule union_single_eq_diff) |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
239 |
moreover note False |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
240 |
ultimately show ?thesis by (auto simp add: diff_right_commute [of _ "{#a#}"] diff_union_swap) |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
241 |
qed |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
242 |
qed |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
243 |
|
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
244 |
lemma insert_noteq_member: |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
245 |
assumes BC: "B + {#b#} = C + {#c#}" |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
246 |
and bnotc: "b \<noteq> c" |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
247 |
shows "c \<in># B" |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
248 |
proof - |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
249 |
have "c \<in># C + {#c#}" by simp |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
250 |
have nc: "\<not> c \<in># {#b#}" using bnotc by simp |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
251 |
then have "c \<in># B + {#b#}" using BC by simp |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
252 |
then show "c \<in># B" using nc by simp |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
253 |
qed |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
254 |
|
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
255 |
lemma add_eq_conv_ex: |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
256 |
"(M + {#a#} = N + {#b#}) = |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
257 |
(M = N \<and> a = b \<or> (\<exists>K. M = K + {#b#} \<and> N = K + {#a#}))" |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
258 |
by (auto simp add: add_eq_conv_diff) |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
259 |
|
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
260 |
|
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
261 |
subsubsection {* Pointwise ordering induced by count *} |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
262 |
|
35268
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
263 |
instantiation multiset :: (type) ordered_ab_semigroup_add_imp_le |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
264 |
begin |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
265 |
|
47429
ec64d94cbf9c
multiset operations are defined with lift_definitions;
bulwahn
parents:
47308
diff
changeset
|
266 |
lift_definition less_eq_multiset :: "'a multiset \<Rightarrow> 'a multiset \<Rightarrow> bool" is "\<lambda> A B. (\<forall>a. A a \<le> B a)" |
ec64d94cbf9c
multiset operations are defined with lift_definitions;
bulwahn
parents:
47308
diff
changeset
|
267 |
by simp |
ec64d94cbf9c
multiset operations are defined with lift_definitions;
bulwahn
parents:
47308
diff
changeset
|
268 |
lemmas mset_le_def = less_eq_multiset_def |
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
269 |
|
35268
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
270 |
definition less_multiset :: "'a multiset \<Rightarrow> 'a multiset \<Rightarrow> bool" where |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
271 |
mset_less_def: "(A::'a multiset) < B \<longleftrightarrow> A \<le> B \<and> A \<noteq> B" |
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
272 |
|
46921 | 273 |
instance |
274 |
by default (auto simp add: mset_le_def mset_less_def multiset_eq_iff intro: order_trans antisym) |
|
35268
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
275 |
|
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
276 |
end |
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
277 |
|
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
278 |
lemma mset_less_eqI: |
35268
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
279 |
"(\<And>x. count A x \<le> count B x) \<Longrightarrow> A \<le> B" |
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
280 |
by (simp add: mset_le_def) |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
281 |
|
35268
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
282 |
lemma mset_le_exists_conv: |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
283 |
"(A::'a multiset) \<le> B \<longleftrightarrow> (\<exists>C. B = A + C)" |
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
284 |
apply (unfold mset_le_def, rule iffI, rule_tac x = "B - A" in exI) |
39302
d7728f65b353
renamed lemmas: ext_iff -> fun_eq_iff, set_ext_iff -> set_eq_iff, set_ext -> set_eqI
nipkow
parents:
39301
diff
changeset
|
285 |
apply (auto intro: multiset_eq_iff [THEN iffD2]) |
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
286 |
done |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
287 |
|
35268
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
288 |
lemma mset_le_mono_add_right_cancel [simp]: |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
289 |
"(A::'a multiset) + C \<le> B + C \<longleftrightarrow> A \<le> B" |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
290 |
by (fact add_le_cancel_right) |
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
291 |
|
35268
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
292 |
lemma mset_le_mono_add_left_cancel [simp]: |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
293 |
"C + (A::'a multiset) \<le> C + B \<longleftrightarrow> A \<le> B" |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
294 |
by (fact add_le_cancel_left) |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
295 |
|
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
296 |
lemma mset_le_mono_add: |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
297 |
"(A::'a multiset) \<le> B \<Longrightarrow> C \<le> D \<Longrightarrow> A + C \<le> B + D" |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
298 |
by (fact add_mono) |
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
299 |
|
35268
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
300 |
lemma mset_le_add_left [simp]: |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
301 |
"(A::'a multiset) \<le> A + B" |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
302 |
unfolding mset_le_def by auto |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
303 |
|
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
304 |
lemma mset_le_add_right [simp]: |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
305 |
"B \<le> (A::'a multiset) + B" |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
306 |
unfolding mset_le_def by auto |
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
307 |
|
35268
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
308 |
lemma mset_le_single: |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
309 |
"a :# B \<Longrightarrow> {#a#} \<le> B" |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
310 |
by (simp add: mset_le_def) |
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
311 |
|
35268
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
312 |
lemma multiset_diff_union_assoc: |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
313 |
"C \<le> B \<Longrightarrow> (A::'a multiset) + B - C = A + (B - C)" |
39302
d7728f65b353
renamed lemmas: ext_iff -> fun_eq_iff, set_ext_iff -> set_eq_iff, set_ext -> set_eqI
nipkow
parents:
39301
diff
changeset
|
314 |
by (simp add: multiset_eq_iff mset_le_def) |
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
315 |
|
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
316 |
lemma mset_le_multiset_union_diff_commute: |
36867 | 317 |
"B \<le> A \<Longrightarrow> (A::'a multiset) - B + C = A + C - B" |
39302
d7728f65b353
renamed lemmas: ext_iff -> fun_eq_iff, set_ext_iff -> set_eq_iff, set_ext -> set_eqI
nipkow
parents:
39301
diff
changeset
|
318 |
by (simp add: multiset_eq_iff mset_le_def) |
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
319 |
|
39301 | 320 |
lemma diff_le_self[simp]: "(M::'a multiset) - N \<le> M" |
321 |
by(simp add: mset_le_def) |
|
322 |
||
35268
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
323 |
lemma mset_lessD: "A < B \<Longrightarrow> x \<in># A \<Longrightarrow> x \<in># B" |
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
324 |
apply (clarsimp simp: mset_le_def mset_less_def) |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
325 |
apply (erule_tac x=x in allE) |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
326 |
apply auto |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
327 |
done |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
328 |
|
35268
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
329 |
lemma mset_leD: "A \<le> B \<Longrightarrow> x \<in># A \<Longrightarrow> x \<in># B" |
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
330 |
apply (clarsimp simp: mset_le_def mset_less_def) |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
331 |
apply (erule_tac x = x in allE) |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
332 |
apply auto |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
333 |
done |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
334 |
|
35268
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
335 |
lemma mset_less_insertD: "(A + {#x#} < B) \<Longrightarrow> (x \<in># B \<and> A < B)" |
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
336 |
apply (rule conjI) |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
337 |
apply (simp add: mset_lessD) |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
338 |
apply (clarsimp simp: mset_le_def mset_less_def) |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
339 |
apply safe |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
340 |
apply (erule_tac x = a in allE) |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
341 |
apply (auto split: split_if_asm) |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
342 |
done |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
343 |
|
35268
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
344 |
lemma mset_le_insertD: "(A + {#x#} \<le> B) \<Longrightarrow> (x \<in># B \<and> A \<le> B)" |
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
345 |
apply (rule conjI) |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
346 |
apply (simp add: mset_leD) |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
347 |
apply (force simp: mset_le_def mset_less_def split: split_if_asm) |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
348 |
done |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
349 |
|
35268
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
350 |
lemma mset_less_of_empty[simp]: "A < {#} \<longleftrightarrow> False" |
39302
d7728f65b353
renamed lemmas: ext_iff -> fun_eq_iff, set_ext_iff -> set_eq_iff, set_ext -> set_eqI
nipkow
parents:
39301
diff
changeset
|
351 |
by (auto simp add: mset_less_def mset_le_def multiset_eq_iff) |
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
352 |
|
35268
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
353 |
lemma multi_psub_of_add_self[simp]: "A < A + {#x#}" |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
354 |
by (auto simp: mset_le_def mset_less_def) |
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
355 |
|
35268
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
356 |
lemma multi_psub_self[simp]: "(A::'a multiset) < A = False" |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
357 |
by simp |
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
358 |
|
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
359 |
lemma mset_less_add_bothsides: |
35268
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
360 |
"T + {#x#} < S + {#x#} \<Longrightarrow> T < S" |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
361 |
by (fact add_less_imp_less_right) |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
362 |
|
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
363 |
lemma mset_less_empty_nonempty: |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
364 |
"{#} < S \<longleftrightarrow> S \<noteq> {#}" |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
365 |
by (auto simp: mset_le_def mset_less_def) |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
366 |
|
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
367 |
lemma mset_less_diff_self: |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
368 |
"c \<in># B \<Longrightarrow> B - {#c#} < B" |
39302
d7728f65b353
renamed lemmas: ext_iff -> fun_eq_iff, set_ext_iff -> set_eq_iff, set_ext -> set_eqI
nipkow
parents:
39301
diff
changeset
|
369 |
by (auto simp: mset_le_def mset_less_def multiset_eq_iff) |
35268
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
370 |
|
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
371 |
|
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
372 |
subsubsection {* Intersection *} |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
373 |
|
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
374 |
instantiation multiset :: (type) semilattice_inf |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
375 |
begin |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
376 |
|
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
377 |
definition inf_multiset :: "'a multiset \<Rightarrow> 'a multiset \<Rightarrow> 'a multiset" where |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
378 |
multiset_inter_def: "inf_multiset A B = A - (A - B)" |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
379 |
|
46921 | 380 |
instance |
381 |
proof - |
|
35268
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
382 |
have aux: "\<And>m n q :: nat. m \<le> n \<Longrightarrow> m \<le> q \<Longrightarrow> m \<le> n - (n - q)" by arith |
46921 | 383 |
show "OFCLASS('a multiset, semilattice_inf_class)" |
384 |
by default (auto simp add: multiset_inter_def mset_le_def aux) |
|
35268
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
385 |
qed |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
386 |
|
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
387 |
end |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
388 |
|
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
389 |
abbreviation multiset_inter :: "'a multiset \<Rightarrow> 'a multiset \<Rightarrow> 'a multiset" (infixl "#\<inter>" 70) where |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
390 |
"multiset_inter \<equiv> inf" |
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
391 |
|
41069
6fabc0414055
name filter operation just filter (c.f. List.filter and list comprehension syntax)
haftmann
parents:
40968
diff
changeset
|
392 |
lemma multiset_inter_count [simp]: |
35268
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
393 |
"count (A #\<inter> B) x = min (count A x) (count B x)" |
47429
ec64d94cbf9c
multiset operations are defined with lift_definitions;
bulwahn
parents:
47308
diff
changeset
|
394 |
by (simp add: multiset_inter_def) |
35268
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
395 |
|
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
396 |
lemma multiset_inter_single: "a \<noteq> b \<Longrightarrow> {#a#} #\<inter> {#b#} = {#}" |
46730 | 397 |
by (rule multiset_eqI) auto |
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
398 |
|
35268
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
399 |
lemma multiset_union_diff_commute: |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
400 |
assumes "B #\<inter> C = {#}" |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
401 |
shows "A + B - C = A - C + B" |
39302
d7728f65b353
renamed lemmas: ext_iff -> fun_eq_iff, set_ext_iff -> set_eq_iff, set_ext -> set_eqI
nipkow
parents:
39301
diff
changeset
|
402 |
proof (rule multiset_eqI) |
35268
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
403 |
fix x |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
404 |
from assms have "min (count B x) (count C x) = 0" |
46730 | 405 |
by (auto simp add: multiset_eq_iff) |
35268
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
406 |
then have "count B x = 0 \<or> count C x = 0" |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
407 |
by auto |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
408 |
then show "count (A + B - C) x = count (A - C + B) x" |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
409 |
by auto |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
410 |
qed |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
411 |
|
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
412 |
|
41069
6fabc0414055
name filter operation just filter (c.f. List.filter and list comprehension syntax)
haftmann
parents:
40968
diff
changeset
|
413 |
subsubsection {* Filter (with comprehension syntax) *} |
6fabc0414055
name filter operation just filter (c.f. List.filter and list comprehension syntax)
haftmann
parents:
40968
diff
changeset
|
414 |
|
6fabc0414055
name filter operation just filter (c.f. List.filter and list comprehension syntax)
haftmann
parents:
40968
diff
changeset
|
415 |
text {* Multiset comprehension *} |
6fabc0414055
name filter operation just filter (c.f. List.filter and list comprehension syntax)
haftmann
parents:
40968
diff
changeset
|
416 |
|
47429
ec64d94cbf9c
multiset operations are defined with lift_definitions;
bulwahn
parents:
47308
diff
changeset
|
417 |
lift_definition filter :: "('a \<Rightarrow> bool) \<Rightarrow> 'a multiset \<Rightarrow> 'a multiset" is "\<lambda>P M. \<lambda>x. if P x then M x else 0" |
ec64d94cbf9c
multiset operations are defined with lift_definitions;
bulwahn
parents:
47308
diff
changeset
|
418 |
by (rule filter_preserves_multiset) |
35268
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
419 |
|
41069
6fabc0414055
name filter operation just filter (c.f. List.filter and list comprehension syntax)
haftmann
parents:
40968
diff
changeset
|
420 |
hide_const (open) filter |
35268
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
421 |
|
41069
6fabc0414055
name filter operation just filter (c.f. List.filter and list comprehension syntax)
haftmann
parents:
40968
diff
changeset
|
422 |
lemma count_filter [simp]: |
6fabc0414055
name filter operation just filter (c.f. List.filter and list comprehension syntax)
haftmann
parents:
40968
diff
changeset
|
423 |
"count (Multiset.filter P M) a = (if P a then count M a else 0)" |
47429
ec64d94cbf9c
multiset operations are defined with lift_definitions;
bulwahn
parents:
47308
diff
changeset
|
424 |
by (simp add: filter.rep_eq) |
41069
6fabc0414055
name filter operation just filter (c.f. List.filter and list comprehension syntax)
haftmann
parents:
40968
diff
changeset
|
425 |
|
6fabc0414055
name filter operation just filter (c.f. List.filter and list comprehension syntax)
haftmann
parents:
40968
diff
changeset
|
426 |
lemma filter_empty [simp]: |
6fabc0414055
name filter operation just filter (c.f. List.filter and list comprehension syntax)
haftmann
parents:
40968
diff
changeset
|
427 |
"Multiset.filter P {#} = {#}" |
39302
d7728f65b353
renamed lemmas: ext_iff -> fun_eq_iff, set_ext_iff -> set_eq_iff, set_ext -> set_eqI
nipkow
parents:
39301
diff
changeset
|
428 |
by (rule multiset_eqI) simp |
35268
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
429 |
|
41069
6fabc0414055
name filter operation just filter (c.f. List.filter and list comprehension syntax)
haftmann
parents:
40968
diff
changeset
|
430 |
lemma filter_single [simp]: |
6fabc0414055
name filter operation just filter (c.f. List.filter and list comprehension syntax)
haftmann
parents:
40968
diff
changeset
|
431 |
"Multiset.filter P {#x#} = (if P x then {#x#} else {#})" |
6fabc0414055
name filter operation just filter (c.f. List.filter and list comprehension syntax)
haftmann
parents:
40968
diff
changeset
|
432 |
by (rule multiset_eqI) simp |
6fabc0414055
name filter operation just filter (c.f. List.filter and list comprehension syntax)
haftmann
parents:
40968
diff
changeset
|
433 |
|
6fabc0414055
name filter operation just filter (c.f. List.filter and list comprehension syntax)
haftmann
parents:
40968
diff
changeset
|
434 |
lemma filter_union [simp]: |
6fabc0414055
name filter operation just filter (c.f. List.filter and list comprehension syntax)
haftmann
parents:
40968
diff
changeset
|
435 |
"Multiset.filter P (M + N) = Multiset.filter P M + Multiset.filter P N" |
39302
d7728f65b353
renamed lemmas: ext_iff -> fun_eq_iff, set_ext_iff -> set_eq_iff, set_ext -> set_eqI
nipkow
parents:
39301
diff
changeset
|
436 |
by (rule multiset_eqI) simp |
35268
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
437 |
|
41069
6fabc0414055
name filter operation just filter (c.f. List.filter and list comprehension syntax)
haftmann
parents:
40968
diff
changeset
|
438 |
lemma filter_diff [simp]: |
6fabc0414055
name filter operation just filter (c.f. List.filter and list comprehension syntax)
haftmann
parents:
40968
diff
changeset
|
439 |
"Multiset.filter P (M - N) = Multiset.filter P M - Multiset.filter P N" |
6fabc0414055
name filter operation just filter (c.f. List.filter and list comprehension syntax)
haftmann
parents:
40968
diff
changeset
|
440 |
by (rule multiset_eqI) simp |
6fabc0414055
name filter operation just filter (c.f. List.filter and list comprehension syntax)
haftmann
parents:
40968
diff
changeset
|
441 |
|
6fabc0414055
name filter operation just filter (c.f. List.filter and list comprehension syntax)
haftmann
parents:
40968
diff
changeset
|
442 |
lemma filter_inter [simp]: |
6fabc0414055
name filter operation just filter (c.f. List.filter and list comprehension syntax)
haftmann
parents:
40968
diff
changeset
|
443 |
"Multiset.filter P (M #\<inter> N) = Multiset.filter P M #\<inter> Multiset.filter P N" |
39302
d7728f65b353
renamed lemmas: ext_iff -> fun_eq_iff, set_ext_iff -> set_eq_iff, set_ext -> set_eqI
nipkow
parents:
39301
diff
changeset
|
444 |
by (rule multiset_eqI) simp |
10249 | 445 |
|
41069
6fabc0414055
name filter operation just filter (c.f. List.filter and list comprehension syntax)
haftmann
parents:
40968
diff
changeset
|
446 |
syntax |
6fabc0414055
name filter operation just filter (c.f. List.filter and list comprehension syntax)
haftmann
parents:
40968
diff
changeset
|
447 |
"_MCollect" :: "pttrn \<Rightarrow> 'a multiset \<Rightarrow> bool \<Rightarrow> 'a multiset" ("(1{# _ :# _./ _#})") |
6fabc0414055
name filter operation just filter (c.f. List.filter and list comprehension syntax)
haftmann
parents:
40968
diff
changeset
|
448 |
syntax (xsymbol) |
6fabc0414055
name filter operation just filter (c.f. List.filter and list comprehension syntax)
haftmann
parents:
40968
diff
changeset
|
449 |
"_MCollect" :: "pttrn \<Rightarrow> 'a multiset \<Rightarrow> bool \<Rightarrow> 'a multiset" ("(1{# _ \<in># _./ _#})") |
6fabc0414055
name filter operation just filter (c.f. List.filter and list comprehension syntax)
haftmann
parents:
40968
diff
changeset
|
450 |
translations |
6fabc0414055
name filter operation just filter (c.f. List.filter and list comprehension syntax)
haftmann
parents:
40968
diff
changeset
|
451 |
"{#x \<in># M. P#}" == "CONST Multiset.filter (\<lambda>x. P) M" |
6fabc0414055
name filter operation just filter (c.f. List.filter and list comprehension syntax)
haftmann
parents:
40968
diff
changeset
|
452 |
|
10249 | 453 |
|
454 |
subsubsection {* Set of elements *} |
|
455 |
||
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
456 |
definition set_of :: "'a multiset => 'a set" where |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
457 |
"set_of M = {x. x :# M}" |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
458 |
|
17161 | 459 |
lemma set_of_empty [simp]: "set_of {#} = {}" |
26178 | 460 |
by (simp add: set_of_def) |
10249 | 461 |
|
17161 | 462 |
lemma set_of_single [simp]: "set_of {#b#} = {b}" |
26178 | 463 |
by (simp add: set_of_def) |
10249 | 464 |
|
17161 | 465 |
lemma set_of_union [simp]: "set_of (M + N) = set_of M \<union> set_of N" |
26178 | 466 |
by (auto simp add: set_of_def) |
10249 | 467 |
|
17161 | 468 |
lemma set_of_eq_empty_iff [simp]: "(set_of M = {}) = (M = {#})" |
39302
d7728f65b353
renamed lemmas: ext_iff -> fun_eq_iff, set_ext_iff -> set_eq_iff, set_ext -> set_eqI
nipkow
parents:
39301
diff
changeset
|
469 |
by (auto simp add: set_of_def multiset_eq_iff) |
10249 | 470 |
|
17161 | 471 |
lemma mem_set_of_iff [simp]: "(x \<in> set_of M) = (x :# M)" |
26178 | 472 |
by (auto simp add: set_of_def) |
26016 | 473 |
|
41069
6fabc0414055
name filter operation just filter (c.f. List.filter and list comprehension syntax)
haftmann
parents:
40968
diff
changeset
|
474 |
lemma set_of_filter [simp]: "set_of {# x:#M. P x #} = set_of M \<inter> {x. P x}" |
26178 | 475 |
by (auto simp add: set_of_def) |
10249 | 476 |
|
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
477 |
lemma finite_set_of [iff]: "finite (set_of M)" |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
478 |
using count [of M] by (simp add: multiset_def set_of_def) |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
479 |
|
46756
faf62905cd53
adding finiteness of intervals on integer sets; adding another finiteness theorem for multisets
bulwahn
parents:
46730
diff
changeset
|
480 |
lemma finite_Collect_mem [iff]: "finite {x. x :# M}" |
faf62905cd53
adding finiteness of intervals on integer sets; adding another finiteness theorem for multisets
bulwahn
parents:
46730
diff
changeset
|
481 |
unfolding set_of_def[symmetric] by simp |
10249 | 482 |
|
483 |
subsubsection {* Size *} |
|
484 |
||
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
485 |
instantiation multiset :: (type) size |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
486 |
begin |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
487 |
|
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
488 |
definition size_def: |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
489 |
"size M = setsum (count M) (set_of M)" |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
490 |
|
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
491 |
instance .. |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
492 |
|
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
493 |
end |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
494 |
|
28708
a1a436f09ec6
explicit check for pattern discipline before code translation
haftmann
parents:
28562
diff
changeset
|
495 |
lemma size_empty [simp]: "size {#} = 0" |
26178 | 496 |
by (simp add: size_def) |
10249 | 497 |
|
28708
a1a436f09ec6
explicit check for pattern discipline before code translation
haftmann
parents:
28562
diff
changeset
|
498 |
lemma size_single [simp]: "size {#b#} = 1" |
26178 | 499 |
by (simp add: size_def) |
10249 | 500 |
|
17161 | 501 |
lemma setsum_count_Int: |
26178 | 502 |
"finite A ==> setsum (count N) (A \<inter> set_of N) = setsum (count N) A" |
503 |
apply (induct rule: finite_induct) |
|
504 |
apply simp |
|
505 |
apply (simp add: Int_insert_left set_of_def) |
|
506 |
done |
|
10249 | 507 |
|
28708
a1a436f09ec6
explicit check for pattern discipline before code translation
haftmann
parents:
28562
diff
changeset
|
508 |
lemma size_union [simp]: "size (M + N::'a multiset) = size M + size N" |
26178 | 509 |
apply (unfold size_def) |
510 |
apply (subgoal_tac "count (M + N) = (\<lambda>a. count M a + count N a)") |
|
511 |
prefer 2 |
|
512 |
apply (rule ext, simp) |
|
513 |
apply (simp (no_asm_simp) add: setsum_Un_nat setsum_addf setsum_count_Int) |
|
514 |
apply (subst Int_commute) |
|
515 |
apply (simp (no_asm_simp) add: setsum_count_Int) |
|
516 |
done |
|
10249 | 517 |
|
17161 | 518 |
lemma size_eq_0_iff_empty [iff]: "(size M = 0) = (M = {#})" |
39302
d7728f65b353
renamed lemmas: ext_iff -> fun_eq_iff, set_ext_iff -> set_eq_iff, set_ext -> set_eqI
nipkow
parents:
39301
diff
changeset
|
519 |
by (auto simp add: size_def multiset_eq_iff) |
26016 | 520 |
|
521 |
lemma nonempty_has_size: "(S \<noteq> {#}) = (0 < size S)" |
|
26178 | 522 |
by (metis gr0I gr_implies_not0 size_empty size_eq_0_iff_empty) |
10249 | 523 |
|
17161 | 524 |
lemma size_eq_Suc_imp_elem: "size M = Suc n ==> \<exists>a. a :# M" |
26178 | 525 |
apply (unfold size_def) |
526 |
apply (drule setsum_SucD) |
|
527 |
apply auto |
|
528 |
done |
|
10249 | 529 |
|
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
530 |
lemma size_eq_Suc_imp_eq_union: |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
531 |
assumes "size M = Suc n" |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
532 |
shows "\<exists>a N. M = N + {#a#}" |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
533 |
proof - |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
534 |
from assms obtain a where "a \<in># M" |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
535 |
by (erule size_eq_Suc_imp_elem [THEN exE]) |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
536 |
then have "M = M - {#a#} + {#a#}" by simp |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
537 |
then show ?thesis by blast |
23611 | 538 |
qed |
15869 | 539 |
|
26016 | 540 |
|
541 |
subsection {* Induction and case splits *} |
|
10249 | 542 |
|
18258 | 543 |
theorem multiset_induct [case_names empty add, induct type: multiset]: |
48009 | 544 |
assumes empty: "P {#}" |
545 |
assumes add: "\<And>M x. P M \<Longrightarrow> P (M + {#x#})" |
|
546 |
shows "P M" |
|
547 |
proof (induct n \<equiv> "size M" arbitrary: M) |
|
548 |
case 0 thus "P M" by (simp add: empty) |
|
549 |
next |
|
550 |
case (Suc k) |
|
551 |
obtain N x where "M = N + {#x#}" |
|
552 |
using `Suc k = size M` [symmetric] |
|
553 |
using size_eq_Suc_imp_eq_union by fast |
|
554 |
with Suc add show "P M" by simp |
|
10249 | 555 |
qed |
556 |
||
25610 | 557 |
lemma multi_nonempty_split: "M \<noteq> {#} \<Longrightarrow> \<exists>A a. M = A + {#a#}" |
26178 | 558 |
by (induct M) auto |
25610 | 559 |
|
560 |
lemma multiset_cases [cases type, case_names empty add]: |
|
26178 | 561 |
assumes em: "M = {#} \<Longrightarrow> P" |
562 |
assumes add: "\<And>N x. M = N + {#x#} \<Longrightarrow> P" |
|
563 |
shows "P" |
|
48009 | 564 |
using assms by (induct M) simp_all |
25610 | 565 |
|
566 |
lemma multi_member_split: "x \<in># M \<Longrightarrow> \<exists>A. M = A + {#x#}" |
|
48009 | 567 |
by (rule_tac x="M - {#x#}" in exI, simp) |
25610 | 568 |
|
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
569 |
lemma multi_drop_mem_not_eq: "c \<in># B \<Longrightarrow> B - {#c#} \<noteq> B" |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
570 |
by (cases "B = {#}") (auto dest: multi_member_split) |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
571 |
|
26033 | 572 |
lemma multiset_partition: "M = {# x:#M. P x #} + {# x:#M. \<not> P x #}" |
39302
d7728f65b353
renamed lemmas: ext_iff -> fun_eq_iff, set_ext_iff -> set_eq_iff, set_ext -> set_eqI
nipkow
parents:
39301
diff
changeset
|
573 |
apply (subst multiset_eq_iff) |
26178 | 574 |
apply auto |
575 |
done |
|
10249 | 576 |
|
35268
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
577 |
lemma mset_less_size: "(A::'a multiset) < B \<Longrightarrow> size A < size B" |
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
578 |
proof (induct A arbitrary: B) |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
579 |
case (empty M) |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
580 |
then have "M \<noteq> {#}" by (simp add: mset_less_empty_nonempty) |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
581 |
then obtain M' x where "M = M' + {#x#}" |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
582 |
by (blast dest: multi_nonempty_split) |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
583 |
then show ?case by simp |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
584 |
next |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
585 |
case (add S x T) |
35268
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
586 |
have IH: "\<And>B. S < B \<Longrightarrow> size S < size B" by fact |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
587 |
have SxsubT: "S + {#x#} < T" by fact |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
588 |
then have "x \<in># T" and "S < T" by (auto dest: mset_less_insertD) |
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
589 |
then obtain T' where T: "T = T' + {#x#}" |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
590 |
by (blast dest: multi_member_split) |
35268
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
591 |
then have "S < T'" using SxsubT |
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
592 |
by (blast intro: mset_less_add_bothsides) |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
593 |
then have "size S < size T'" using IH by simp |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
594 |
then show ?case using T by simp |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
595 |
qed |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
596 |
|
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
597 |
|
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
598 |
subsubsection {* Strong induction and subset induction for multisets *} |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
599 |
|
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
600 |
text {* Well-foundedness of proper subset operator: *} |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
601 |
|
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
602 |
text {* proper multiset subset *} |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
603 |
|
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
604 |
definition |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
605 |
mset_less_rel :: "('a multiset * 'a multiset) set" where |
35268
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
606 |
"mset_less_rel = {(A,B). A < B}" |
10249 | 607 |
|
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
608 |
lemma multiset_add_sub_el_shuffle: |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
609 |
assumes "c \<in># B" and "b \<noteq> c" |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
610 |
shows "B - {#c#} + {#b#} = B + {#b#} - {#c#}" |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
611 |
proof - |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
612 |
from `c \<in># B` obtain A where B: "B = A + {#c#}" |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
613 |
by (blast dest: multi_member_split) |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
614 |
have "A + {#b#} = A + {#b#} + {#c#} - {#c#}" by simp |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
615 |
then have "A + {#b#} = A + {#c#} + {#b#} - {#c#}" |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
616 |
by (simp add: add_ac) |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
617 |
then show ?thesis using B by simp |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
618 |
qed |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
619 |
|
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
620 |
lemma wf_mset_less_rel: "wf mset_less_rel" |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
621 |
apply (unfold mset_less_rel_def) |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
622 |
apply (rule wf_measure [THEN wf_subset, where f1=size]) |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
623 |
apply (clarsimp simp: measure_def inv_image_def mset_less_size) |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
624 |
done |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
625 |
|
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
626 |
text {* The induction rules: *} |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
627 |
|
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
628 |
lemma full_multiset_induct [case_names less]: |
35268
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
629 |
assumes ih: "\<And>B. \<forall>(A::'a multiset). A < B \<longrightarrow> P A \<Longrightarrow> P B" |
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
630 |
shows "P B" |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
631 |
apply (rule wf_mset_less_rel [THEN wf_induct]) |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
632 |
apply (rule ih, auto simp: mset_less_rel_def) |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
633 |
done |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
634 |
|
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
635 |
lemma multi_subset_induct [consumes 2, case_names empty add]: |
35268
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
636 |
assumes "F \<le> A" |
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
637 |
and empty: "P {#}" |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
638 |
and insert: "\<And>a F. a \<in># A \<Longrightarrow> P F \<Longrightarrow> P (F + {#a#})" |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
639 |
shows "P F" |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
640 |
proof - |
35268
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
641 |
from `F \<le> A` |
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
642 |
show ?thesis |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
643 |
proof (induct F) |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
644 |
show "P {#}" by fact |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
645 |
next |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
646 |
fix x F |
35268
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
647 |
assume P: "F \<le> A \<Longrightarrow> P F" and i: "F + {#x#} \<le> A" |
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
648 |
show "P (F + {#x#})" |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
649 |
proof (rule insert) |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
650 |
from i show "x \<in># A" by (auto dest: mset_le_insertD) |
35268
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
651 |
from i have "F \<le> A" by (auto dest: mset_le_insertD) |
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
652 |
with P show "P F" . |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
653 |
qed |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
654 |
qed |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
655 |
qed |
26145 | 656 |
|
17161 | 657 |
|
48023 | 658 |
subsection {* The fold combinator *} |
659 |
||
49822
0cfc1651be25
simplified construction of fold combinator on multisets;
haftmann
parents:
49717
diff
changeset
|
660 |
definition fold :: "('a \<Rightarrow> 'b \<Rightarrow> 'b) \<Rightarrow> 'b \<Rightarrow> 'a multiset \<Rightarrow> 'b" |
48023 | 661 |
where |
49822
0cfc1651be25
simplified construction of fold combinator on multisets;
haftmann
parents:
49717
diff
changeset
|
662 |
"fold f s M = Finite_Set.fold (\<lambda>x. f x ^^ count M x) s (set_of M)" |
48023 | 663 |
|
49822
0cfc1651be25
simplified construction of fold combinator on multisets;
haftmann
parents:
49717
diff
changeset
|
664 |
lemma fold_mset_empty [simp]: |
0cfc1651be25
simplified construction of fold combinator on multisets;
haftmann
parents:
49717
diff
changeset
|
665 |
"fold f s {#} = s" |
0cfc1651be25
simplified construction of fold combinator on multisets;
haftmann
parents:
49717
diff
changeset
|
666 |
by (simp add: fold_def) |
48023 | 667 |
|
668 |
context comp_fun_commute |
|
669 |
begin |
|
670 |
||
49822
0cfc1651be25
simplified construction of fold combinator on multisets;
haftmann
parents:
49717
diff
changeset
|
671 |
lemma fold_mset_insert: |
0cfc1651be25
simplified construction of fold combinator on multisets;
haftmann
parents:
49717
diff
changeset
|
672 |
"fold f s (M + {#x#}) = f x (fold f s M)" |
0cfc1651be25
simplified construction of fold combinator on multisets;
haftmann
parents:
49717
diff
changeset
|
673 |
proof - |
0cfc1651be25
simplified construction of fold combinator on multisets;
haftmann
parents:
49717
diff
changeset
|
674 |
interpret mset: comp_fun_commute "\<lambda>y. f y ^^ count M y" |
0cfc1651be25
simplified construction of fold combinator on multisets;
haftmann
parents:
49717
diff
changeset
|
675 |
by (fact comp_fun_commute_funpow) |
0cfc1651be25
simplified construction of fold combinator on multisets;
haftmann
parents:
49717
diff
changeset
|
676 |
interpret mset_union: comp_fun_commute "\<lambda>y. f y ^^ count (M + {#x#}) y" |
0cfc1651be25
simplified construction of fold combinator on multisets;
haftmann
parents:
49717
diff
changeset
|
677 |
by (fact comp_fun_commute_funpow) |
0cfc1651be25
simplified construction of fold combinator on multisets;
haftmann
parents:
49717
diff
changeset
|
678 |
show ?thesis |
0cfc1651be25
simplified construction of fold combinator on multisets;
haftmann
parents:
49717
diff
changeset
|
679 |
proof (cases "x \<in> set_of M") |
0cfc1651be25
simplified construction of fold combinator on multisets;
haftmann
parents:
49717
diff
changeset
|
680 |
case False |
0cfc1651be25
simplified construction of fold combinator on multisets;
haftmann
parents:
49717
diff
changeset
|
681 |
then have *: "count (M + {#x#}) x = 1" by simp |
0cfc1651be25
simplified construction of fold combinator on multisets;
haftmann
parents:
49717
diff
changeset
|
682 |
from False have "Finite_Set.fold (\<lambda>y. f y ^^ count (M + {#x#}) y) s (set_of M) = |
0cfc1651be25
simplified construction of fold combinator on multisets;
haftmann
parents:
49717
diff
changeset
|
683 |
Finite_Set.fold (\<lambda>y. f y ^^ count M y) s (set_of M)" |
0cfc1651be25
simplified construction of fold combinator on multisets;
haftmann
parents:
49717
diff
changeset
|
684 |
by (auto intro!: Finite_Set.fold_cong comp_fun_commute_funpow) |
0cfc1651be25
simplified construction of fold combinator on multisets;
haftmann
parents:
49717
diff
changeset
|
685 |
with False * show ?thesis |
0cfc1651be25
simplified construction of fold combinator on multisets;
haftmann
parents:
49717
diff
changeset
|
686 |
by (simp add: fold_def del: count_union) |
48023 | 687 |
next |
49822
0cfc1651be25
simplified construction of fold combinator on multisets;
haftmann
parents:
49717
diff
changeset
|
688 |
case True |
0cfc1651be25
simplified construction of fold combinator on multisets;
haftmann
parents:
49717
diff
changeset
|
689 |
def N \<equiv> "set_of M - {x}" |
0cfc1651be25
simplified construction of fold combinator on multisets;
haftmann
parents:
49717
diff
changeset
|
690 |
from N_def True have *: "set_of M = insert x N" "x \<notin> N" "finite N" by auto |
0cfc1651be25
simplified construction of fold combinator on multisets;
haftmann
parents:
49717
diff
changeset
|
691 |
then have "Finite_Set.fold (\<lambda>y. f y ^^ count (M + {#x#}) y) s N = |
0cfc1651be25
simplified construction of fold combinator on multisets;
haftmann
parents:
49717
diff
changeset
|
692 |
Finite_Set.fold (\<lambda>y. f y ^^ count M y) s N" |
0cfc1651be25
simplified construction of fold combinator on multisets;
haftmann
parents:
49717
diff
changeset
|
693 |
by (auto intro!: Finite_Set.fold_cong comp_fun_commute_funpow) |
0cfc1651be25
simplified construction of fold combinator on multisets;
haftmann
parents:
49717
diff
changeset
|
694 |
with * show ?thesis by (simp add: fold_def del: count_union) simp |
48023 | 695 |
qed |
696 |
qed |
|
697 |
||
49822
0cfc1651be25
simplified construction of fold combinator on multisets;
haftmann
parents:
49717
diff
changeset
|
698 |
corollary fold_mset_single [simp]: |
0cfc1651be25
simplified construction of fold combinator on multisets;
haftmann
parents:
49717
diff
changeset
|
699 |
"fold f s {#x#} = f x s" |
0cfc1651be25
simplified construction of fold combinator on multisets;
haftmann
parents:
49717
diff
changeset
|
700 |
proof - |
0cfc1651be25
simplified construction of fold combinator on multisets;
haftmann
parents:
49717
diff
changeset
|
701 |
have "fold f s ({#} + {#x#}) = f x s" by (simp only: fold_mset_insert) simp |
0cfc1651be25
simplified construction of fold combinator on multisets;
haftmann
parents:
49717
diff
changeset
|
702 |
then show ?thesis by simp |
0cfc1651be25
simplified construction of fold combinator on multisets;
haftmann
parents:
49717
diff
changeset
|
703 |
qed |
48023 | 704 |
|
49822
0cfc1651be25
simplified construction of fold combinator on multisets;
haftmann
parents:
49717
diff
changeset
|
705 |
lemma fold_mset_fun_comm: |
0cfc1651be25
simplified construction of fold combinator on multisets;
haftmann
parents:
49717
diff
changeset
|
706 |
"f x (fold f s M) = fold f (f x s) M" |
0cfc1651be25
simplified construction of fold combinator on multisets;
haftmann
parents:
49717
diff
changeset
|
707 |
by (induct M) (simp_all add: fold_mset_insert fun_left_comm) |
48023 | 708 |
|
709 |
lemma fold_mset_union [simp]: |
|
49822
0cfc1651be25
simplified construction of fold combinator on multisets;
haftmann
parents:
49717
diff
changeset
|
710 |
"fold f s (M + N) = fold f (fold f s M) N" |
0cfc1651be25
simplified construction of fold combinator on multisets;
haftmann
parents:
49717
diff
changeset
|
711 |
proof (induct M) |
48023 | 712 |
case empty then show ?case by simp |
713 |
next |
|
49822
0cfc1651be25
simplified construction of fold combinator on multisets;
haftmann
parents:
49717
diff
changeset
|
714 |
case (add M x) |
0cfc1651be25
simplified construction of fold combinator on multisets;
haftmann
parents:
49717
diff
changeset
|
715 |
have "M + {#x#} + N = (M + N) + {#x#}" |
0cfc1651be25
simplified construction of fold combinator on multisets;
haftmann
parents:
49717
diff
changeset
|
716 |
by (simp add: add_ac) |
0cfc1651be25
simplified construction of fold combinator on multisets;
haftmann
parents:
49717
diff
changeset
|
717 |
with add show ?case by (simp add: fold_mset_insert fold_mset_fun_comm) |
48023 | 718 |
qed |
719 |
||
720 |
lemma fold_mset_fusion: |
|
721 |
assumes "comp_fun_commute g" |
|
49822
0cfc1651be25
simplified construction of fold combinator on multisets;
haftmann
parents:
49717
diff
changeset
|
722 |
shows "(\<And>x y. h (g x y) = f x (h y)) \<Longrightarrow> h (fold g w A) = fold f (h w) A" (is "PROP ?P") |
48023 | 723 |
proof - |
724 |
interpret comp_fun_commute g by (fact assms) |
|
725 |
show "PROP ?P" by (induct A) auto |
|
726 |
qed |
|
727 |
||
728 |
end |
|
729 |
||
730 |
text {* |
|
731 |
A note on code generation: When defining some function containing a |
|
49822
0cfc1651be25
simplified construction of fold combinator on multisets;
haftmann
parents:
49717
diff
changeset
|
732 |
subterm @{term "fold F"}, code generation is not automatic. When |
48023 | 733 |
interpreting locale @{text left_commutative} with @{text F}, the |
49822
0cfc1651be25
simplified construction of fold combinator on multisets;
haftmann
parents:
49717
diff
changeset
|
734 |
would be code thms for @{const fold} become thms like |
0cfc1651be25
simplified construction of fold combinator on multisets;
haftmann
parents:
49717
diff
changeset
|
735 |
@{term "fold F z {#} = z"} where @{text F} is not a pattern but |
48023 | 736 |
contains defined symbols, i.e.\ is not a code thm. Hence a separate |
737 |
constant with its own code thms needs to be introduced for @{text |
|
738 |
F}. See the image operator below. |
|
739 |
*} |
|
740 |
||
741 |
||
742 |
subsection {* Image *} |
|
743 |
||
744 |
definition image_mset :: "('a \<Rightarrow> 'b) \<Rightarrow> 'a multiset \<Rightarrow> 'b multiset" where |
|
49822
0cfc1651be25
simplified construction of fold combinator on multisets;
haftmann
parents:
49717
diff
changeset
|
745 |
"image_mset f = fold (plus o single o f) {#}" |
48023 | 746 |
|
49823 | 747 |
lemma comp_fun_commute_mset_image: |
748 |
"comp_fun_commute (plus o single o f)" |
|
749 |
proof |
|
750 |
qed (simp add: add_ac fun_eq_iff) |
|
48023 | 751 |
|
752 |
lemma image_mset_empty [simp]: "image_mset f {#} = {#}" |
|
49823 | 753 |
by (simp add: image_mset_def) |
48023 | 754 |
|
755 |
lemma image_mset_single [simp]: "image_mset f {#x#} = {#f x#}" |
|
49823 | 756 |
proof - |
757 |
interpret comp_fun_commute "plus o single o f" |
|
758 |
by (fact comp_fun_commute_mset_image) |
|
759 |
show ?thesis by (simp add: image_mset_def) |
|
760 |
qed |
|
48023 | 761 |
|
762 |
lemma image_mset_union [simp]: |
|
49823 | 763 |
"image_mset f (M + N) = image_mset f M + image_mset f N" |
764 |
proof - |
|
765 |
interpret comp_fun_commute "plus o single o f" |
|
766 |
by (fact comp_fun_commute_mset_image) |
|
767 |
show ?thesis by (induct N) (simp_all add: image_mset_def add_ac) |
|
768 |
qed |
|
769 |
||
770 |
corollary image_mset_insert: |
|
771 |
"image_mset f (M + {#a#}) = image_mset f M + {#f a#}" |
|
772 |
by simp |
|
48023 | 773 |
|
49823 | 774 |
lemma set_of_image_mset [simp]: |
775 |
"set_of (image_mset f M) = image f (set_of M)" |
|
776 |
by (induct M) simp_all |
|
48040 | 777 |
|
49823 | 778 |
lemma size_image_mset [simp]: |
779 |
"size (image_mset f M) = size M" |
|
780 |
by (induct M) simp_all |
|
48023 | 781 |
|
49823 | 782 |
lemma image_mset_is_empty_iff [simp]: |
783 |
"image_mset f M = {#} \<longleftrightarrow> M = {#}" |
|
784 |
by (cases M) auto |
|
48023 | 785 |
|
786 |
syntax |
|
787 |
"_comprehension1_mset" :: "'a \<Rightarrow> 'b \<Rightarrow> 'b multiset \<Rightarrow> 'a multiset" |
|
788 |
("({#_/. _ :# _#})") |
|
789 |
translations |
|
790 |
"{#e. x:#M#}" == "CONST image_mset (%x. e) M" |
|
791 |
||
792 |
syntax |
|
793 |
"_comprehension2_mset" :: "'a \<Rightarrow> 'b \<Rightarrow> 'b multiset \<Rightarrow> bool \<Rightarrow> 'a multiset" |
|
794 |
("({#_/ | _ :# _./ _#})") |
|
795 |
translations |
|
796 |
"{#e | x:#M. P#}" => "{#e. x :# {# x:#M. P#}#}" |
|
797 |
||
798 |
text {* |
|
799 |
This allows to write not just filters like @{term "{#x:#M. x<c#}"} |
|
800 |
but also images like @{term "{#x+x. x:#M #}"} and @{term [source] |
|
801 |
"{#x+x|x:#M. x<c#}"}, where the latter is currently displayed as |
|
802 |
@{term "{#x+x|x:#M. x<c#}"}. |
|
803 |
*} |
|
804 |
||
805 |
enriched_type image_mset: image_mset |
|
806 |
proof - |
|
807 |
fix f g show "image_mset f \<circ> image_mset g = image_mset (f \<circ> g)" |
|
808 |
proof |
|
809 |
fix A |
|
810 |
show "(image_mset f \<circ> image_mset g) A = image_mset (f \<circ> g) A" |
|
811 |
by (induct A) simp_all |
|
812 |
qed |
|
813 |
show "image_mset id = id" |
|
814 |
proof |
|
815 |
fix A |
|
816 |
show "image_mset id A = id A" |
|
817 |
by (induct A) simp_all |
|
818 |
qed |
|
819 |
qed |
|
820 |
||
49717 | 821 |
declare image_mset.identity [simp] |
822 |
||
48023 | 823 |
|
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
824 |
subsection {* Alternative representations *} |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
825 |
|
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
826 |
subsubsection {* Lists *} |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
827 |
|
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
828 |
primrec multiset_of :: "'a list \<Rightarrow> 'a multiset" where |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
829 |
"multiset_of [] = {#}" | |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
830 |
"multiset_of (a # x) = multiset_of x + {# a #}" |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
831 |
|
37107 | 832 |
lemma in_multiset_in_set: |
833 |
"x \<in># multiset_of xs \<longleftrightarrow> x \<in> set xs" |
|
834 |
by (induct xs) simp_all |
|
835 |
||
836 |
lemma count_multiset_of: |
|
837 |
"count (multiset_of xs) x = length (filter (\<lambda>y. x = y) xs)" |
|
838 |
by (induct xs) simp_all |
|
839 |
||
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
840 |
lemma multiset_of_zero_iff[simp]: "(multiset_of x = {#}) = (x = [])" |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
841 |
by (induct x) auto |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
842 |
|
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
843 |
lemma multiset_of_zero_iff_right[simp]: "({#} = multiset_of x) = (x = [])" |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
844 |
by (induct x) auto |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
845 |
|
40950 | 846 |
lemma set_of_multiset_of[simp]: "set_of (multiset_of x) = set x" |
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
847 |
by (induct x) auto |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
848 |
|
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
849 |
lemma mem_set_multiset_eq: "x \<in> set xs = (x :# multiset_of xs)" |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
850 |
by (induct xs) auto |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
851 |
|
48012 | 852 |
lemma size_multiset_of [simp]: "size (multiset_of xs) = length xs" |
853 |
by (induct xs) simp_all |
|
854 |
||
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
855 |
lemma multiset_of_append [simp]: |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
856 |
"multiset_of (xs @ ys) = multiset_of xs + multiset_of ys" |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
857 |
by (induct xs arbitrary: ys) (auto simp: add_ac) |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
858 |
|
40303
2d507370e879
lemmas multiset_of_filter, sort_key_by_quicksort
haftmann
parents:
40250
diff
changeset
|
859 |
lemma multiset_of_filter: |
2d507370e879
lemmas multiset_of_filter, sort_key_by_quicksort
haftmann
parents:
40250
diff
changeset
|
860 |
"multiset_of (filter P xs) = {#x :# multiset_of xs. P x #}" |
2d507370e879
lemmas multiset_of_filter, sort_key_by_quicksort
haftmann
parents:
40250
diff
changeset
|
861 |
by (induct xs) simp_all |
2d507370e879
lemmas multiset_of_filter, sort_key_by_quicksort
haftmann
parents:
40250
diff
changeset
|
862 |
|
40950 | 863 |
lemma multiset_of_rev [simp]: |
864 |
"multiset_of (rev xs) = multiset_of xs" |
|
865 |
by (induct xs) simp_all |
|
866 |
||
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
867 |
lemma surj_multiset_of: "surj multiset_of" |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
868 |
apply (unfold surj_def) |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
869 |
apply (rule allI) |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
870 |
apply (rule_tac M = y in multiset_induct) |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
871 |
apply auto |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
872 |
apply (rule_tac x = "x # xa" in exI) |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
873 |
apply auto |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
874 |
done |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
875 |
|
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
876 |
lemma set_count_greater_0: "set x = {a. count (multiset_of x) a > 0}" |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
877 |
by (induct x) auto |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
878 |
|
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
879 |
lemma distinct_count_atmost_1: |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
880 |
"distinct x = (! a. count (multiset_of x) a = (if a \<in> set x then 1 else 0))" |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
881 |
apply (induct x, simp, rule iffI, simp_all) |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
882 |
apply (rule conjI) |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
883 |
apply (simp_all add: set_of_multiset_of [THEN sym] del: set_of_multiset_of) |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
884 |
apply (erule_tac x = a in allE, simp, clarify) |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
885 |
apply (erule_tac x = aa in allE, simp) |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
886 |
done |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
887 |
|
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
888 |
lemma multiset_of_eq_setD: |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
889 |
"multiset_of xs = multiset_of ys \<Longrightarrow> set xs = set ys" |
39302
d7728f65b353
renamed lemmas: ext_iff -> fun_eq_iff, set_ext_iff -> set_eq_iff, set_ext -> set_eqI
nipkow
parents:
39301
diff
changeset
|
890 |
by (rule) (auto simp add:multiset_eq_iff set_count_greater_0) |
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
891 |
|
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
892 |
lemma set_eq_iff_multiset_of_eq_distinct: |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
893 |
"distinct x \<Longrightarrow> distinct y \<Longrightarrow> |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
894 |
(set x = set y) = (multiset_of x = multiset_of y)" |
39302
d7728f65b353
renamed lemmas: ext_iff -> fun_eq_iff, set_ext_iff -> set_eq_iff, set_ext -> set_eqI
nipkow
parents:
39301
diff
changeset
|
895 |
by (auto simp: multiset_eq_iff distinct_count_atmost_1) |
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
896 |
|
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
897 |
lemma set_eq_iff_multiset_of_remdups_eq: |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
898 |
"(set x = set y) = (multiset_of (remdups x) = multiset_of (remdups y))" |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
899 |
apply (rule iffI) |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
900 |
apply (simp add: set_eq_iff_multiset_of_eq_distinct[THEN iffD1]) |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
901 |
apply (drule distinct_remdups [THEN distinct_remdups |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
902 |
[THEN set_eq_iff_multiset_of_eq_distinct [THEN iffD2]]]) |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
903 |
apply simp |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
904 |
done |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
905 |
|
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
906 |
lemma multiset_of_compl_union [simp]: |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
907 |
"multiset_of [x\<leftarrow>xs. P x] + multiset_of [x\<leftarrow>xs. \<not>P x] = multiset_of xs" |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
908 |
by (induct xs) (auto simp: add_ac) |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
909 |
|
41069
6fabc0414055
name filter operation just filter (c.f. List.filter and list comprehension syntax)
haftmann
parents:
40968
diff
changeset
|
910 |
lemma count_multiset_of_length_filter: |
39533
91a0ff0ff237
generalized lemmas multiset_of_insort, multiset_of_sort, properties_for_sort for *_key variants
haftmann
parents:
39314
diff
changeset
|
911 |
"count (multiset_of xs) x = length (filter (\<lambda>y. x = y) xs)" |
91a0ff0ff237
generalized lemmas multiset_of_insort, multiset_of_sort, properties_for_sort for *_key variants
haftmann
parents:
39314
diff
changeset
|
912 |
by (induct xs) auto |
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
913 |
|
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
914 |
lemma nth_mem_multiset_of: "i < length ls \<Longrightarrow> (ls ! i) :# multiset_of ls" |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
915 |
apply (induct ls arbitrary: i) |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
916 |
apply simp |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
917 |
apply (case_tac i) |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
918 |
apply auto |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
919 |
done |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
920 |
|
36903 | 921 |
lemma multiset_of_remove1[simp]: |
922 |
"multiset_of (remove1 a xs) = multiset_of xs - {#a#}" |
|
39302
d7728f65b353
renamed lemmas: ext_iff -> fun_eq_iff, set_ext_iff -> set_eq_iff, set_ext -> set_eqI
nipkow
parents:
39301
diff
changeset
|
923 |
by (induct xs) (auto simp add: multiset_eq_iff) |
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
924 |
|
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
925 |
lemma multiset_of_eq_length: |
37107 | 926 |
assumes "multiset_of xs = multiset_of ys" |
927 |
shows "length xs = length ys" |
|
48012 | 928 |
using assms by (metis size_multiset_of) |
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
929 |
|
39533
91a0ff0ff237
generalized lemmas multiset_of_insort, multiset_of_sort, properties_for_sort for *_key variants
haftmann
parents:
39314
diff
changeset
|
930 |
lemma multiset_of_eq_length_filter: |
91a0ff0ff237
generalized lemmas multiset_of_insort, multiset_of_sort, properties_for_sort for *_key variants
haftmann
parents:
39314
diff
changeset
|
931 |
assumes "multiset_of xs = multiset_of ys" |
91a0ff0ff237
generalized lemmas multiset_of_insort, multiset_of_sort, properties_for_sort for *_key variants
haftmann
parents:
39314
diff
changeset
|
932 |
shows "length (filter (\<lambda>x. z = x) xs) = length (filter (\<lambda>y. z = y) ys)" |
48012 | 933 |
using assms by (metis count_multiset_of) |
39533
91a0ff0ff237
generalized lemmas multiset_of_insort, multiset_of_sort, properties_for_sort for *_key variants
haftmann
parents:
39314
diff
changeset
|
934 |
|
45989
b39256df5f8a
moved theorem requiring multisets from More_List to Multiset
haftmann
parents:
45866
diff
changeset
|
935 |
lemma fold_multiset_equiv: |
b39256df5f8a
moved theorem requiring multisets from More_List to Multiset
haftmann
parents:
45866
diff
changeset
|
936 |
assumes f: "\<And>x y. x \<in> set xs \<Longrightarrow> y \<in> set xs \<Longrightarrow> f x \<circ> f y = f y \<circ> f x" |
b39256df5f8a
moved theorem requiring multisets from More_List to Multiset
haftmann
parents:
45866
diff
changeset
|
937 |
and equiv: "multiset_of xs = multiset_of ys" |
49822
0cfc1651be25
simplified construction of fold combinator on multisets;
haftmann
parents:
49717
diff
changeset
|
938 |
shows "List.fold f xs = List.fold f ys" |
46921 | 939 |
using f equiv [symmetric] |
940 |
proof (induct xs arbitrary: ys) |
|
45989
b39256df5f8a
moved theorem requiring multisets from More_List to Multiset
haftmann
parents:
45866
diff
changeset
|
941 |
case Nil then show ?case by simp |
b39256df5f8a
moved theorem requiring multisets from More_List to Multiset
haftmann
parents:
45866
diff
changeset
|
942 |
next |
b39256df5f8a
moved theorem requiring multisets from More_List to Multiset
haftmann
parents:
45866
diff
changeset
|
943 |
case (Cons x xs) |
b39256df5f8a
moved theorem requiring multisets from More_List to Multiset
haftmann
parents:
45866
diff
changeset
|
944 |
then have *: "set ys = set (x # xs)" by (blast dest: multiset_of_eq_setD) |
b39256df5f8a
moved theorem requiring multisets from More_List to Multiset
haftmann
parents:
45866
diff
changeset
|
945 |
have "\<And>x y. x \<in> set ys \<Longrightarrow> y \<in> set ys \<Longrightarrow> f x \<circ> f y = f y \<circ> f x" |
b39256df5f8a
moved theorem requiring multisets from More_List to Multiset
haftmann
parents:
45866
diff
changeset
|
946 |
by (rule Cons.prems(1)) (simp_all add: *) |
b39256df5f8a
moved theorem requiring multisets from More_List to Multiset
haftmann
parents:
45866
diff
changeset
|
947 |
moreover from * have "x \<in> set ys" by simp |
49822
0cfc1651be25
simplified construction of fold combinator on multisets;
haftmann
parents:
49717
diff
changeset
|
948 |
ultimately have "List.fold f ys = List.fold f (remove1 x ys) \<circ> f x" by (fact fold_remove1_split) |
0cfc1651be25
simplified construction of fold combinator on multisets;
haftmann
parents:
49717
diff
changeset
|
949 |
moreover from Cons.prems have "List.fold f xs = List.fold f (remove1 x ys)" by (auto intro: Cons.hyps) |
45989
b39256df5f8a
moved theorem requiring multisets from More_List to Multiset
haftmann
parents:
45866
diff
changeset
|
950 |
ultimately show ?case by simp |
b39256df5f8a
moved theorem requiring multisets from More_List to Multiset
haftmann
parents:
45866
diff
changeset
|
951 |
qed |
b39256df5f8a
moved theorem requiring multisets from More_List to Multiset
haftmann
parents:
45866
diff
changeset
|
952 |
|
39533
91a0ff0ff237
generalized lemmas multiset_of_insort, multiset_of_sort, properties_for_sort for *_key variants
haftmann
parents:
39314
diff
changeset
|
953 |
context linorder |
91a0ff0ff237
generalized lemmas multiset_of_insort, multiset_of_sort, properties_for_sort for *_key variants
haftmann
parents:
39314
diff
changeset
|
954 |
begin |
91a0ff0ff237
generalized lemmas multiset_of_insort, multiset_of_sort, properties_for_sort for *_key variants
haftmann
parents:
39314
diff
changeset
|
955 |
|
40210
aee7ef725330
sorting: avoid _key suffix if lemma applies both to simple and generalized variant; generalized insort_insert to insort_insert_key; additional lemmas
haftmann
parents:
39533
diff
changeset
|
956 |
lemma multiset_of_insort [simp]: |
39533
91a0ff0ff237
generalized lemmas multiset_of_insort, multiset_of_sort, properties_for_sort for *_key variants
haftmann
parents:
39314
diff
changeset
|
957 |
"multiset_of (insort_key k x xs) = {#x#} + multiset_of xs" |
37107 | 958 |
by (induct xs) (simp_all add: ac_simps) |
39533
91a0ff0ff237
generalized lemmas multiset_of_insort, multiset_of_sort, properties_for_sort for *_key variants
haftmann
parents:
39314
diff
changeset
|
959 |
|
40210
aee7ef725330
sorting: avoid _key suffix if lemma applies both to simple and generalized variant; generalized insort_insert to insort_insert_key; additional lemmas
haftmann
parents:
39533
diff
changeset
|
960 |
lemma multiset_of_sort [simp]: |
39533
91a0ff0ff237
generalized lemmas multiset_of_insort, multiset_of_sort, properties_for_sort for *_key variants
haftmann
parents:
39314
diff
changeset
|
961 |
"multiset_of (sort_key k xs) = multiset_of xs" |
37107 | 962 |
by (induct xs) (simp_all add: ac_simps) |
963 |
||
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
964 |
text {* |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
965 |
This lemma shows which properties suffice to show that a function |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
966 |
@{text "f"} with @{text "f xs = ys"} behaves like sort. |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
967 |
*} |
37074 | 968 |
|
39533
91a0ff0ff237
generalized lemmas multiset_of_insort, multiset_of_sort, properties_for_sort for *_key variants
haftmann
parents:
39314
diff
changeset
|
969 |
lemma properties_for_sort_key: |
91a0ff0ff237
generalized lemmas multiset_of_insort, multiset_of_sort, properties_for_sort for *_key variants
haftmann
parents:
39314
diff
changeset
|
970 |
assumes "multiset_of ys = multiset_of xs" |
40305
41833242cc42
tuned lemma proposition of properties_for_sort_key
haftmann
parents:
40303
diff
changeset
|
971 |
and "\<And>k. k \<in> set ys \<Longrightarrow> filter (\<lambda>x. f k = f x) ys = filter (\<lambda>x. f k = f x) xs" |
39533
91a0ff0ff237
generalized lemmas multiset_of_insort, multiset_of_sort, properties_for_sort for *_key variants
haftmann
parents:
39314
diff
changeset
|
972 |
and "sorted (map f ys)" |
91a0ff0ff237
generalized lemmas multiset_of_insort, multiset_of_sort, properties_for_sort for *_key variants
haftmann
parents:
39314
diff
changeset
|
973 |
shows "sort_key f xs = ys" |
46921 | 974 |
using assms |
975 |
proof (induct xs arbitrary: ys) |
|
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
976 |
case Nil then show ?case by simp |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
977 |
next |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
978 |
case (Cons x xs) |
39533
91a0ff0ff237
generalized lemmas multiset_of_insort, multiset_of_sort, properties_for_sort for *_key variants
haftmann
parents:
39314
diff
changeset
|
979 |
from Cons.prems(2) have |
40305
41833242cc42
tuned lemma proposition of properties_for_sort_key
haftmann
parents:
40303
diff
changeset
|
980 |
"\<forall>k \<in> set ys. filter (\<lambda>x. f k = f x) (remove1 x ys) = filter (\<lambda>x. f k = f x) xs" |
39533
91a0ff0ff237
generalized lemmas multiset_of_insort, multiset_of_sort, properties_for_sort for *_key variants
haftmann
parents:
39314
diff
changeset
|
981 |
by (simp add: filter_remove1) |
91a0ff0ff237
generalized lemmas multiset_of_insort, multiset_of_sort, properties_for_sort for *_key variants
haftmann
parents:
39314
diff
changeset
|
982 |
with Cons.prems have "sort_key f xs = remove1 x ys" |
91a0ff0ff237
generalized lemmas multiset_of_insort, multiset_of_sort, properties_for_sort for *_key variants
haftmann
parents:
39314
diff
changeset
|
983 |
by (auto intro!: Cons.hyps simp add: sorted_map_remove1) |
91a0ff0ff237
generalized lemmas multiset_of_insort, multiset_of_sort, properties_for_sort for *_key variants
haftmann
parents:
39314
diff
changeset
|
984 |
moreover from Cons.prems have "x \<in> set ys" |
91a0ff0ff237
generalized lemmas multiset_of_insort, multiset_of_sort, properties_for_sort for *_key variants
haftmann
parents:
39314
diff
changeset
|
985 |
by (auto simp add: mem_set_multiset_eq intro!: ccontr) |
91a0ff0ff237
generalized lemmas multiset_of_insort, multiset_of_sort, properties_for_sort for *_key variants
haftmann
parents:
39314
diff
changeset
|
986 |
ultimately show ?case using Cons.prems by (simp add: insort_key_remove1) |
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
987 |
qed |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
988 |
|
39533
91a0ff0ff237
generalized lemmas multiset_of_insort, multiset_of_sort, properties_for_sort for *_key variants
haftmann
parents:
39314
diff
changeset
|
989 |
lemma properties_for_sort: |
91a0ff0ff237
generalized lemmas multiset_of_insort, multiset_of_sort, properties_for_sort for *_key variants
haftmann
parents:
39314
diff
changeset
|
990 |
assumes multiset: "multiset_of ys = multiset_of xs" |
91a0ff0ff237
generalized lemmas multiset_of_insort, multiset_of_sort, properties_for_sort for *_key variants
haftmann
parents:
39314
diff
changeset
|
991 |
and "sorted ys" |
91a0ff0ff237
generalized lemmas multiset_of_insort, multiset_of_sort, properties_for_sort for *_key variants
haftmann
parents:
39314
diff
changeset
|
992 |
shows "sort xs = ys" |
91a0ff0ff237
generalized lemmas multiset_of_insort, multiset_of_sort, properties_for_sort for *_key variants
haftmann
parents:
39314
diff
changeset
|
993 |
proof (rule properties_for_sort_key) |
91a0ff0ff237
generalized lemmas multiset_of_insort, multiset_of_sort, properties_for_sort for *_key variants
haftmann
parents:
39314
diff
changeset
|
994 |
from multiset show "multiset_of ys = multiset_of xs" . |
91a0ff0ff237
generalized lemmas multiset_of_insort, multiset_of_sort, properties_for_sort for *_key variants
haftmann
parents:
39314
diff
changeset
|
995 |
from `sorted ys` show "sorted (map (\<lambda>x. x) ys)" by simp |
91a0ff0ff237
generalized lemmas multiset_of_insort, multiset_of_sort, properties_for_sort for *_key variants
haftmann
parents:
39314
diff
changeset
|
996 |
from multiset have "\<And>k. length (filter (\<lambda>y. k = y) ys) = length (filter (\<lambda>x. k = x) xs)" |
91a0ff0ff237
generalized lemmas multiset_of_insort, multiset_of_sort, properties_for_sort for *_key variants
haftmann
parents:
39314
diff
changeset
|
997 |
by (rule multiset_of_eq_length_filter) |
91a0ff0ff237
generalized lemmas multiset_of_insort, multiset_of_sort, properties_for_sort for *_key variants
haftmann
parents:
39314
diff
changeset
|
998 |
then have "\<And>k. replicate (length (filter (\<lambda>y. k = y) ys)) k = replicate (length (filter (\<lambda>x. k = x) xs)) k" |
91a0ff0ff237
generalized lemmas multiset_of_insort, multiset_of_sort, properties_for_sort for *_key variants
haftmann
parents:
39314
diff
changeset
|
999 |
by simp |
40305
41833242cc42
tuned lemma proposition of properties_for_sort_key
haftmann
parents:
40303
diff
changeset
|
1000 |
then show "\<And>k. k \<in> set ys \<Longrightarrow> filter (\<lambda>y. k = y) ys = filter (\<lambda>x. k = x) xs" |
39533
91a0ff0ff237
generalized lemmas multiset_of_insort, multiset_of_sort, properties_for_sort for *_key variants
haftmann
parents:
39314
diff
changeset
|
1001 |
by (simp add: replicate_length_filter) |
91a0ff0ff237
generalized lemmas multiset_of_insort, multiset_of_sort, properties_for_sort for *_key variants
haftmann
parents:
39314
diff
changeset
|
1002 |
qed |
91a0ff0ff237
generalized lemmas multiset_of_insort, multiset_of_sort, properties_for_sort for *_key variants
haftmann
parents:
39314
diff
changeset
|
1003 |
|
40303
2d507370e879
lemmas multiset_of_filter, sort_key_by_quicksort
haftmann
parents:
40250
diff
changeset
|
1004 |
lemma sort_key_by_quicksort: |
2d507370e879
lemmas multiset_of_filter, sort_key_by_quicksort
haftmann
parents:
40250
diff
changeset
|
1005 |
"sort_key f xs = sort_key f [x\<leftarrow>xs. f x < f (xs ! (length xs div 2))] |
2d507370e879
lemmas multiset_of_filter, sort_key_by_quicksort
haftmann
parents:
40250
diff
changeset
|
1006 |
@ [x\<leftarrow>xs. f x = f (xs ! (length xs div 2))] |
2d507370e879
lemmas multiset_of_filter, sort_key_by_quicksort
haftmann
parents:
40250
diff
changeset
|
1007 |
@ sort_key f [x\<leftarrow>xs. f x > f (xs ! (length xs div 2))]" (is "sort_key f ?lhs = ?rhs") |
2d507370e879
lemmas multiset_of_filter, sort_key_by_quicksort
haftmann
parents:
40250
diff
changeset
|
1008 |
proof (rule properties_for_sort_key) |
2d507370e879
lemmas multiset_of_filter, sort_key_by_quicksort
haftmann
parents:
40250
diff
changeset
|
1009 |
show "multiset_of ?rhs = multiset_of ?lhs" |
2d507370e879
lemmas multiset_of_filter, sort_key_by_quicksort
haftmann
parents:
40250
diff
changeset
|
1010 |
by (rule multiset_eqI) (auto simp add: multiset_of_filter) |
2d507370e879
lemmas multiset_of_filter, sort_key_by_quicksort
haftmann
parents:
40250
diff
changeset
|
1011 |
next |
2d507370e879
lemmas multiset_of_filter, sort_key_by_quicksort
haftmann
parents:
40250
diff
changeset
|
1012 |
show "sorted (map f ?rhs)" |
2d507370e879
lemmas multiset_of_filter, sort_key_by_quicksort
haftmann
parents:
40250
diff
changeset
|
1013 |
by (auto simp add: sorted_append intro: sorted_map_same) |
2d507370e879
lemmas multiset_of_filter, sort_key_by_quicksort
haftmann
parents:
40250
diff
changeset
|
1014 |
next |
40305
41833242cc42
tuned lemma proposition of properties_for_sort_key
haftmann
parents:
40303
diff
changeset
|
1015 |
fix l |
41833242cc42
tuned lemma proposition of properties_for_sort_key
haftmann
parents:
40303
diff
changeset
|
1016 |
assume "l \<in> set ?rhs" |
40346 | 1017 |
let ?pivot = "f (xs ! (length xs div 2))" |
1018 |
have *: "\<And>x. f l = f x \<longleftrightarrow> f x = f l" by auto |
|
40306 | 1019 |
have "[x \<leftarrow> sort_key f xs . f x = f l] = [x \<leftarrow> xs. f x = f l]" |
40305
41833242cc42
tuned lemma proposition of properties_for_sort_key
haftmann
parents:
40303
diff
changeset
|
1020 |
unfolding filter_sort by (rule properties_for_sort_key) (auto intro: sorted_map_same) |
40346 | 1021 |
with * have **: "[x \<leftarrow> sort_key f xs . f l = f x] = [x \<leftarrow> xs. f l = f x]" by simp |
1022 |
have "\<And>x P. P (f x) ?pivot \<and> f l = f x \<longleftrightarrow> P (f l) ?pivot \<and> f l = f x" by auto |
|
1023 |
then have "\<And>P. [x \<leftarrow> sort_key f xs . P (f x) ?pivot \<and> f l = f x] = |
|
1024 |
[x \<leftarrow> sort_key f xs. P (f l) ?pivot \<and> f l = f x]" by simp |
|
1025 |
note *** = this [of "op <"] this [of "op >"] this [of "op ="] |
|
40306 | 1026 |
show "[x \<leftarrow> ?rhs. f l = f x] = [x \<leftarrow> ?lhs. f l = f x]" |
40305
41833242cc42
tuned lemma proposition of properties_for_sort_key
haftmann
parents:
40303
diff
changeset
|
1027 |
proof (cases "f l" ?pivot rule: linorder_cases) |
46730 | 1028 |
case less |
1029 |
then have "f l \<noteq> ?pivot" and "\<not> f l > ?pivot" by auto |
|
1030 |
with less show ?thesis |
|
40346 | 1031 |
by (simp add: filter_sort [symmetric] ** ***) |
40305
41833242cc42
tuned lemma proposition of properties_for_sort_key
haftmann
parents:
40303
diff
changeset
|
1032 |
next |
40306 | 1033 |
case equal then show ?thesis |
40346 | 1034 |
by (simp add: * less_le) |
40305
41833242cc42
tuned lemma proposition of properties_for_sort_key
haftmann
parents:
40303
diff
changeset
|
1035 |
next |
46730 | 1036 |
case greater |
1037 |
then have "f l \<noteq> ?pivot" and "\<not> f l < ?pivot" by auto |
|
1038 |
with greater show ?thesis |
|
40346 | 1039 |
by (simp add: filter_sort [symmetric] ** ***) |
40306 | 1040 |
qed |
40303
2d507370e879
lemmas multiset_of_filter, sort_key_by_quicksort
haftmann
parents:
40250
diff
changeset
|
1041 |
qed |
2d507370e879
lemmas multiset_of_filter, sort_key_by_quicksort
haftmann
parents:
40250
diff
changeset
|
1042 |
|
2d507370e879
lemmas multiset_of_filter, sort_key_by_quicksort
haftmann
parents:
40250
diff
changeset
|
1043 |
lemma sort_by_quicksort: |
2d507370e879
lemmas multiset_of_filter, sort_key_by_quicksort
haftmann
parents:
40250
diff
changeset
|
1044 |
"sort xs = sort [x\<leftarrow>xs. x < xs ! (length xs div 2)] |
2d507370e879
lemmas multiset_of_filter, sort_key_by_quicksort
haftmann
parents:
40250
diff
changeset
|
1045 |
@ [x\<leftarrow>xs. x = xs ! (length xs div 2)] |
2d507370e879
lemmas multiset_of_filter, sort_key_by_quicksort
haftmann
parents:
40250
diff
changeset
|
1046 |
@ sort [x\<leftarrow>xs. x > xs ! (length xs div 2)]" (is "sort ?lhs = ?rhs") |
2d507370e879
lemmas multiset_of_filter, sort_key_by_quicksort
haftmann
parents:
40250
diff
changeset
|
1047 |
using sort_key_by_quicksort [of "\<lambda>x. x", symmetric] by simp |
2d507370e879
lemmas multiset_of_filter, sort_key_by_quicksort
haftmann
parents:
40250
diff
changeset
|
1048 |
|
40347
429bf4388b2f
added code lemmas for stable parametrized quicksort
haftmann
parents:
40346
diff
changeset
|
1049 |
text {* A stable parametrized quicksort *} |
429bf4388b2f
added code lemmas for stable parametrized quicksort
haftmann
parents:
40346
diff
changeset
|
1050 |
|
429bf4388b2f
added code lemmas for stable parametrized quicksort
haftmann
parents:
40346
diff
changeset
|
1051 |
definition part :: "('b \<Rightarrow> 'a) \<Rightarrow> 'a \<Rightarrow> 'b list \<Rightarrow> 'b list \<times> 'b list \<times> 'b list" where |
429bf4388b2f
added code lemmas for stable parametrized quicksort
haftmann
parents:
40346
diff
changeset
|
1052 |
"part f pivot xs = ([x \<leftarrow> xs. f x < pivot], [x \<leftarrow> xs. f x = pivot], [x \<leftarrow> xs. pivot < f x])" |
429bf4388b2f
added code lemmas for stable parametrized quicksort
haftmann
parents:
40346
diff
changeset
|
1053 |
|
429bf4388b2f
added code lemmas for stable parametrized quicksort
haftmann
parents:
40346
diff
changeset
|
1054 |
lemma part_code [code]: |
429bf4388b2f
added code lemmas for stable parametrized quicksort
haftmann
parents:
40346
diff
changeset
|
1055 |
"part f pivot [] = ([], [], [])" |
429bf4388b2f
added code lemmas for stable parametrized quicksort
haftmann
parents:
40346
diff
changeset
|
1056 |
"part f pivot (x # xs) = (let (lts, eqs, gts) = part f pivot xs; x' = f x in |
429bf4388b2f
added code lemmas for stable parametrized quicksort
haftmann
parents:
40346
diff
changeset
|
1057 |
if x' < pivot then (x # lts, eqs, gts) |
429bf4388b2f
added code lemmas for stable parametrized quicksort
haftmann
parents:
40346
diff
changeset
|
1058 |
else if x' > pivot then (lts, eqs, x # gts) |
429bf4388b2f
added code lemmas for stable parametrized quicksort
haftmann
parents:
40346
diff
changeset
|
1059 |
else (lts, x # eqs, gts))" |
429bf4388b2f
added code lemmas for stable parametrized quicksort
haftmann
parents:
40346
diff
changeset
|
1060 |
by (auto simp add: part_def Let_def split_def) |
429bf4388b2f
added code lemmas for stable parametrized quicksort
haftmann
parents:
40346
diff
changeset
|
1061 |
|
429bf4388b2f
added code lemmas for stable parametrized quicksort
haftmann
parents:
40346
diff
changeset
|
1062 |
lemma sort_key_by_quicksort_code [code]: |
429bf4388b2f
added code lemmas for stable parametrized quicksort
haftmann
parents:
40346
diff
changeset
|
1063 |
"sort_key f xs = (case xs of [] \<Rightarrow> [] |
429bf4388b2f
added code lemmas for stable parametrized quicksort
haftmann
parents:
40346
diff
changeset
|
1064 |
| [x] \<Rightarrow> xs |
429bf4388b2f
added code lemmas for stable parametrized quicksort
haftmann
parents:
40346
diff
changeset
|
1065 |
| [x, y] \<Rightarrow> (if f x \<le> f y then xs else [y, x]) |
429bf4388b2f
added code lemmas for stable parametrized quicksort
haftmann
parents:
40346
diff
changeset
|
1066 |
| _ \<Rightarrow> (let (lts, eqs, gts) = part f (f (xs ! (length xs div 2))) xs |
429bf4388b2f
added code lemmas for stable parametrized quicksort
haftmann
parents:
40346
diff
changeset
|
1067 |
in sort_key f lts @ eqs @ sort_key f gts))" |
429bf4388b2f
added code lemmas for stable parametrized quicksort
haftmann
parents:
40346
diff
changeset
|
1068 |
proof (cases xs) |
429bf4388b2f
added code lemmas for stable parametrized quicksort
haftmann
parents:
40346
diff
changeset
|
1069 |
case Nil then show ?thesis by simp |
429bf4388b2f
added code lemmas for stable parametrized quicksort
haftmann
parents:
40346
diff
changeset
|
1070 |
next |
46921 | 1071 |
case (Cons _ ys) note hyps = Cons show ?thesis |
1072 |
proof (cases ys) |
|
40347
429bf4388b2f
added code lemmas for stable parametrized quicksort
haftmann
parents:
40346
diff
changeset
|
1073 |
case Nil with hyps show ?thesis by simp |
429bf4388b2f
added code lemmas for stable parametrized quicksort
haftmann
parents:
40346
diff
changeset
|
1074 |
next |
46921 | 1075 |
case (Cons _ zs) note hyps = hyps Cons show ?thesis |
1076 |
proof (cases zs) |
|
40347
429bf4388b2f
added code lemmas for stable parametrized quicksort
haftmann
parents:
40346
diff
changeset
|
1077 |
case Nil with hyps show ?thesis by auto |
429bf4388b2f
added code lemmas for stable parametrized quicksort
haftmann
parents:
40346
diff
changeset
|
1078 |
next |
429bf4388b2f
added code lemmas for stable parametrized quicksort
haftmann
parents:
40346
diff
changeset
|
1079 |
case Cons |
429bf4388b2f
added code lemmas for stable parametrized quicksort
haftmann
parents:
40346
diff
changeset
|
1080 |
from sort_key_by_quicksort [of f xs] |
429bf4388b2f
added code lemmas for stable parametrized quicksort
haftmann
parents:
40346
diff
changeset
|
1081 |
have "sort_key f xs = (let (lts, eqs, gts) = part f (f (xs ! (length xs div 2))) xs |
429bf4388b2f
added code lemmas for stable parametrized quicksort
haftmann
parents:
40346
diff
changeset
|
1082 |
in sort_key f lts @ eqs @ sort_key f gts)" |
429bf4388b2f
added code lemmas for stable parametrized quicksort
haftmann
parents:
40346
diff
changeset
|
1083 |
by (simp only: split_def Let_def part_def fst_conv snd_conv) |
429bf4388b2f
added code lemmas for stable parametrized quicksort
haftmann
parents:
40346
diff
changeset
|
1084 |
with hyps Cons show ?thesis by (simp only: list.cases) |
429bf4388b2f
added code lemmas for stable parametrized quicksort
haftmann
parents:
40346
diff
changeset
|
1085 |
qed |
429bf4388b2f
added code lemmas for stable parametrized quicksort
haftmann
parents:
40346
diff
changeset
|
1086 |
qed |
429bf4388b2f
added code lemmas for stable parametrized quicksort
haftmann
parents:
40346
diff
changeset
|
1087 |
qed |
429bf4388b2f
added code lemmas for stable parametrized quicksort
haftmann
parents:
40346
diff
changeset
|
1088 |
|
39533
91a0ff0ff237
generalized lemmas multiset_of_insort, multiset_of_sort, properties_for_sort for *_key variants
haftmann
parents:
39314
diff
changeset
|
1089 |
end |
91a0ff0ff237
generalized lemmas multiset_of_insort, multiset_of_sort, properties_for_sort for *_key variants
haftmann
parents:
39314
diff
changeset
|
1090 |
|
40347
429bf4388b2f
added code lemmas for stable parametrized quicksort
haftmann
parents:
40346
diff
changeset
|
1091 |
hide_const (open) part |
429bf4388b2f
added code lemmas for stable parametrized quicksort
haftmann
parents:
40346
diff
changeset
|
1092 |
|
35268
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
1093 |
lemma multiset_of_remdups_le: "multiset_of (remdups xs) \<le> multiset_of xs" |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
1094 |
by (induct xs) (auto intro: order_trans) |
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1095 |
|
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1096 |
lemma multiset_of_update: |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1097 |
"i < length ls \<Longrightarrow> multiset_of (ls[i := v]) = multiset_of ls - {#ls ! i#} + {#v#}" |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1098 |
proof (induct ls arbitrary: i) |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1099 |
case Nil then show ?case by simp |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1100 |
next |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1101 |
case (Cons x xs) |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1102 |
show ?case |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1103 |
proof (cases i) |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1104 |
case 0 then show ?thesis by simp |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1105 |
next |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1106 |
case (Suc i') |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1107 |
with Cons show ?thesis |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1108 |
apply simp |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1109 |
apply (subst add_assoc) |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1110 |
apply (subst add_commute [of "{#v#}" "{#x#}"]) |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1111 |
apply (subst add_assoc [symmetric]) |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1112 |
apply simp |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1113 |
apply (rule mset_le_multiset_union_diff_commute) |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1114 |
apply (simp add: mset_le_single nth_mem_multiset_of) |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1115 |
done |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1116 |
qed |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1117 |
qed |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1118 |
|
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1119 |
lemma multiset_of_swap: |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1120 |
"i < length ls \<Longrightarrow> j < length ls \<Longrightarrow> |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1121 |
multiset_of (ls[j := ls ! i, i := ls ! j]) = multiset_of ls" |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1122 |
by (cases "i = j") (simp_all add: multiset_of_update nth_mem_multiset_of) |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1123 |
|
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1124 |
|
46168
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1125 |
subsubsection {* Association lists -- including code generation *} |
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1126 |
|
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1127 |
text {* Preliminaries *} |
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1128 |
|
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1129 |
text {* Raw operations on lists *} |
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1130 |
|
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1131 |
definition join_raw :: "('key \<Rightarrow> 'val \<times> 'val \<Rightarrow> 'val) \<Rightarrow> ('key \<times> 'val) list \<Rightarrow> ('key \<times> 'val) list \<Rightarrow> ('key \<times> 'val) list" |
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1132 |
where |
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1133 |
"join_raw f xs ys = foldr (\<lambda>(k, v). map_default k v (%v'. f k (v', v))) ys xs" |
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1134 |
|
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1135 |
lemma join_raw_Nil [simp]: |
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1136 |
"join_raw f xs [] = xs" |
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1137 |
by (simp add: join_raw_def) |
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1138 |
|
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1139 |
lemma join_raw_Cons [simp]: |
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1140 |
"join_raw f xs ((k, v) # ys) = map_default k v (%v'. f k (v', v)) (join_raw f xs ys)" |
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1141 |
by (simp add: join_raw_def) |
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1142 |
|
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1143 |
lemma map_of_join_raw: |
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1144 |
assumes "distinct (map fst ys)" |
47429
ec64d94cbf9c
multiset operations are defined with lift_definitions;
bulwahn
parents:
47308
diff
changeset
|
1145 |
shows "map_of (join_raw f xs ys) x = (case map_of xs x of None => map_of ys x | Some v => |
ec64d94cbf9c
multiset operations are defined with lift_definitions;
bulwahn
parents:
47308
diff
changeset
|
1146 |
(case map_of ys x of None => Some v | Some v' => Some (f x (v, v'))))" |
46168
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1147 |
using assms |
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1148 |
apply (induct ys) |
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1149 |
apply (auto simp add: map_of_map_default split: option.split) |
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1150 |
apply (metis map_of_eq_None_iff option.simps(2) weak_map_of_SomeI) |
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1151 |
by (metis Some_eq_map_of_iff map_of_eq_None_iff option.simps(2)) |
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1152 |
|
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1153 |
lemma distinct_join_raw: |
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1154 |
assumes "distinct (map fst xs)" |
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1155 |
shows "distinct (map fst (join_raw f xs ys))" |
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1156 |
using assms |
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1157 |
proof (induct ys) |
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1158 |
case (Cons y ys) |
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1159 |
thus ?case by (cases y) (simp add: distinct_map_default) |
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1160 |
qed auto |
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1161 |
|
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1162 |
definition |
46238
9ace9e5b79be
renaming theory AList_Impl back to AList (reverting 1fec5b365f9b; AList with distinct key invariant is called DAList)
bulwahn
parents:
46237
diff
changeset
|
1163 |
"subtract_entries_raw xs ys = foldr (%(k, v). AList.map_entry k (%v'. v' - v)) ys xs" |
46168
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1164 |
|
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1165 |
lemma map_of_subtract_entries_raw: |
47429
ec64d94cbf9c
multiset operations are defined with lift_definitions;
bulwahn
parents:
47308
diff
changeset
|
1166 |
assumes "distinct (map fst ys)" |
ec64d94cbf9c
multiset operations are defined with lift_definitions;
bulwahn
parents:
47308
diff
changeset
|
1167 |
shows "map_of (subtract_entries_raw xs ys) x = (case map_of xs x of None => None | Some v => |
ec64d94cbf9c
multiset operations are defined with lift_definitions;
bulwahn
parents:
47308
diff
changeset
|
1168 |
(case map_of ys x of None => Some v | Some v' => Some (v - v')))" |
ec64d94cbf9c
multiset operations are defined with lift_definitions;
bulwahn
parents:
47308
diff
changeset
|
1169 |
using assms unfolding subtract_entries_raw_def |
46168
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1170 |
apply (induct ys) |
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1171 |
apply auto |
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1172 |
apply (simp split: option.split) |
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1173 |
apply (simp add: map_of_map_entry) |
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1174 |
apply (auto split: option.split) |
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1175 |
apply (metis map_of_eq_None_iff option.simps(3) option.simps(4)) |
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1176 |
by (metis map_of_eq_None_iff option.simps(4) option.simps(5)) |
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1177 |
|
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1178 |
lemma distinct_subtract_entries_raw: |
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1179 |
assumes "distinct (map fst xs)" |
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1180 |
shows "distinct (map fst (subtract_entries_raw xs ys))" |
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1181 |
using assms |
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1182 |
unfolding subtract_entries_raw_def by (induct ys) (auto simp add: distinct_map_entry) |
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1183 |
|
47179 | 1184 |
text {* Operations on alists with distinct keys *} |
46168
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1185 |
|
47308 | 1186 |
lift_definition join :: "('a \<Rightarrow> 'b \<times> 'b \<Rightarrow> 'b) \<Rightarrow> ('a, 'b) alist \<Rightarrow> ('a, 'b) alist \<Rightarrow> ('a, 'b) alist" |
1187 |
is join_raw |
|
47179 | 1188 |
by (simp add: distinct_join_raw) |
46168
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1189 |
|
47308 | 1190 |
lift_definition subtract_entries :: "('a, ('b :: minus)) alist \<Rightarrow> ('a, 'b) alist \<Rightarrow> ('a, 'b) alist" |
1191 |
is subtract_entries_raw |
|
47179 | 1192 |
by (simp add: distinct_subtract_entries_raw) |
46168
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1193 |
|
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1194 |
text {* Implementing multisets by means of association lists *} |
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1195 |
|
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1196 |
definition count_of :: "('a \<times> nat) list \<Rightarrow> 'a \<Rightarrow> nat" where |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1197 |
"count_of xs x = (case map_of xs x of None \<Rightarrow> 0 | Some n \<Rightarrow> n)" |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1198 |
|
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1199 |
lemma count_of_multiset: |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1200 |
"count_of xs \<in> multiset" |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1201 |
proof - |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1202 |
let ?A = "{x::'a. 0 < (case map_of xs x of None \<Rightarrow> 0\<Colon>nat | Some (n\<Colon>nat) \<Rightarrow> n)}" |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1203 |
have "?A \<subseteq> dom (map_of xs)" |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1204 |
proof |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1205 |
fix x |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1206 |
assume "x \<in> ?A" |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1207 |
then have "0 < (case map_of xs x of None \<Rightarrow> 0\<Colon>nat | Some (n\<Colon>nat) \<Rightarrow> n)" by simp |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1208 |
then have "map_of xs x \<noteq> None" by (cases "map_of xs x") auto |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1209 |
then show "x \<in> dom (map_of xs)" by auto |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1210 |
qed |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1211 |
with finite_dom_map_of [of xs] have "finite ?A" |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1212 |
by (auto intro: finite_subset) |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1213 |
then show ?thesis |
39302
d7728f65b353
renamed lemmas: ext_iff -> fun_eq_iff, set_ext_iff -> set_eq_iff, set_ext -> set_eqI
nipkow
parents:
39301
diff
changeset
|
1214 |
by (simp add: count_of_def fun_eq_iff multiset_def) |
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1215 |
qed |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1216 |
|
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1217 |
lemma count_simps [simp]: |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1218 |
"count_of [] = (\<lambda>_. 0)" |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1219 |
"count_of ((x, n) # xs) = (\<lambda>y. if x = y then n else count_of xs y)" |
39302
d7728f65b353
renamed lemmas: ext_iff -> fun_eq_iff, set_ext_iff -> set_eq_iff, set_ext -> set_eqI
nipkow
parents:
39301
diff
changeset
|
1220 |
by (simp_all add: count_of_def fun_eq_iff) |
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1221 |
|
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1222 |
lemma count_of_empty: |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1223 |
"x \<notin> fst ` set xs \<Longrightarrow> count_of xs x = 0" |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1224 |
by (induct xs) (simp_all add: count_of_def) |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1225 |
|
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1226 |
lemma count_of_filter: |
46168
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1227 |
"count_of (List.filter (P \<circ> fst) xs) x = (if P x then count_of xs x else 0)" |
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1228 |
by (induct xs) auto |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1229 |
|
46168
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1230 |
lemma count_of_map_default [simp]: |
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1231 |
"count_of (map_default x b (%x. x + b) xs) y = (if x = y then count_of xs x + b else count_of xs y)" |
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1232 |
unfolding count_of_def by (simp add: map_of_map_default split: option.split) |
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1233 |
|
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1234 |
lemma count_of_join_raw: |
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1235 |
"distinct (map fst ys) ==> count_of xs x + count_of ys x = count_of (join_raw (%x (x, y). x + y) xs ys) x" |
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1236 |
unfolding count_of_def by (simp add: map_of_join_raw split: option.split) |
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1237 |
|
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1238 |
lemma count_of_subtract_entries_raw: |
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1239 |
"distinct (map fst ys) ==> count_of xs x - count_of ys x = count_of (subtract_entries_raw xs ys) x" |
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1240 |
unfolding count_of_def by (simp add: map_of_subtract_entries_raw split: option.split) |
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1241 |
|
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1242 |
text {* Code equations for multiset operations *} |
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1243 |
|
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1244 |
definition Bag :: "('a, nat) alist \<Rightarrow> 'a multiset" where |
46237 | 1245 |
"Bag xs = Abs_multiset (count_of (DAList.impl_of xs))" |
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1246 |
|
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1247 |
code_datatype Bag |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1248 |
|
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1249 |
lemma count_Bag [simp, code]: |
46237 | 1250 |
"count (Bag xs) = count_of (DAList.impl_of xs)" |
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1251 |
by (simp add: Bag_def count_of_multiset Abs_multiset_inverse) |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1252 |
|
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1253 |
lemma Mempty_Bag [code]: |
46394
68f973ffd763
improving code equations for multisets that violated the distinct AList abstraction
bulwahn
parents:
46238
diff
changeset
|
1254 |
"{#} = Bag (DAList.empty)" |
68f973ffd763
improving code equations for multisets that violated the distinct AList abstraction
bulwahn
parents:
46238
diff
changeset
|
1255 |
by (simp add: multiset_eq_iff alist.Alist_inverse DAList.empty_def) |
47143
212f7a975d49
association lists with distinct keys uses the quotient infrastructure to obtain code certificates;
bulwahn
parents:
46921
diff
changeset
|
1256 |
|
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1257 |
lemma single_Bag [code]: |
46394
68f973ffd763
improving code equations for multisets that violated the distinct AList abstraction
bulwahn
parents:
46238
diff
changeset
|
1258 |
"{#x#} = Bag (DAList.update x 1 DAList.empty)" |
47198
cfd8ff62eab1
use qualified names for rsp and rep_eq theorems in quotient_def
kuncar
parents:
47179
diff
changeset
|
1259 |
by (simp add: multiset_eq_iff alist.Alist_inverse update.rep_eq empty.rep_eq) |
46168
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1260 |
|
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1261 |
lemma union_Bag [code]: |
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1262 |
"Bag xs + Bag ys = Bag (join (\<lambda>x (n1, n2). n1 + n2) xs ys)" |
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1263 |
by (rule multiset_eqI) (simp add: count_of_join_raw alist.Alist_inverse distinct_join_raw join_def) |
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1264 |
|
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1265 |
lemma minus_Bag [code]: |
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1266 |
"Bag xs - Bag ys = Bag (subtract_entries xs ys)" |
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1267 |
by (rule multiset_eqI) |
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1268 |
(simp add: count_of_subtract_entries_raw alist.Alist_inverse distinct_subtract_entries_raw subtract_entries_def) |
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1269 |
|
41069
6fabc0414055
name filter operation just filter (c.f. List.filter and list comprehension syntax)
haftmann
parents:
40968
diff
changeset
|
1270 |
lemma filter_Bag [code]: |
46237 | 1271 |
"Multiset.filter P (Bag xs) = Bag (DAList.filter (P \<circ> fst) xs)" |
47429
ec64d94cbf9c
multiset operations are defined with lift_definitions;
bulwahn
parents:
47308
diff
changeset
|
1272 |
by (rule multiset_eqI) (simp add: count_of_filter DAList.filter.rep_eq) |
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1273 |
|
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1274 |
lemma mset_less_eq_Bag [code]: |
46237 | 1275 |
"Bag xs \<le> A \<longleftrightarrow> (\<forall>(x, n) \<in> set (DAList.impl_of xs). count_of (DAList.impl_of xs) x \<le> count A x)" |
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1276 |
(is "?lhs \<longleftrightarrow> ?rhs") |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1277 |
proof |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1278 |
assume ?lhs then show ?rhs |
46730 | 1279 |
by (auto simp add: mset_le_def) |
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1280 |
next |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1281 |
assume ?rhs |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1282 |
show ?lhs |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1283 |
proof (rule mset_less_eqI) |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1284 |
fix x |
46237 | 1285 |
from `?rhs` have "count_of (DAList.impl_of xs) x \<le> count A x" |
1286 |
by (cases "x \<in> fst ` set (DAList.impl_of xs)") (auto simp add: count_of_empty) |
|
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1287 |
then show "count (Bag xs) x \<le> count A x" |
46730 | 1288 |
by (simp add: mset_le_def) |
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1289 |
qed |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1290 |
qed |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1291 |
|
38857
97775f3e8722
renamed class/constant eq to equal; tuned some instantiations
haftmann
parents:
38287
diff
changeset
|
1292 |
instantiation multiset :: (equal) equal |
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1293 |
begin |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1294 |
|
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1295 |
definition |
45866
e62b319c7696
adding code attribute to enable evaluation of equality on multisets
bulwahn
parents:
45694
diff
changeset
|
1296 |
[code]: "HOL.equal A B \<longleftrightarrow> (A::'a multiset) \<le> B \<and> B \<le> A" |
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1297 |
|
46921 | 1298 |
instance |
1299 |
by default (simp add: equal_multiset_def eq_iff) |
|
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1300 |
|
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1301 |
end |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1302 |
|
46168
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1303 |
text {* Quickcheck generators *} |
38857
97775f3e8722
renamed class/constant eq to equal; tuned some instantiations
haftmann
parents:
38287
diff
changeset
|
1304 |
|
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1305 |
definition (in term_syntax) |
46168
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1306 |
bagify :: "('a\<Colon>typerep, nat) alist \<times> (unit \<Rightarrow> Code_Evaluation.term) |
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1307 |
\<Rightarrow> 'a multiset \<times> (unit \<Rightarrow> Code_Evaluation.term)" where |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1308 |
[code_unfold]: "bagify xs = Code_Evaluation.valtermify Bag {\<cdot>} xs" |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1309 |
|
37751 | 1310 |
notation fcomp (infixl "\<circ>>" 60) |
1311 |
notation scomp (infixl "\<circ>\<rightarrow>" 60) |
|
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1312 |
|
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1313 |
instantiation multiset :: (random) random |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1314 |
begin |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1315 |
|
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1316 |
definition |
37751 | 1317 |
"Quickcheck.random i = Quickcheck.random i \<circ>\<rightarrow> (\<lambda>xs. Pair (bagify xs))" |
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1318 |
|
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1319 |
instance .. |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1320 |
|
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1321 |
end |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1322 |
|
37751 | 1323 |
no_notation fcomp (infixl "\<circ>>" 60) |
1324 |
no_notation scomp (infixl "\<circ>\<rightarrow>" 60) |
|
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1325 |
|
46168
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1326 |
instantiation multiset :: (exhaustive) exhaustive |
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1327 |
begin |
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1328 |
|
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1329 |
definition exhaustive_multiset :: "('a multiset => (bool * term list) option) => code_numeral => (bool * term list) option" |
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1330 |
where |
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1331 |
"exhaustive_multiset f i = Quickcheck_Exhaustive.exhaustive (%xs. f (Bag xs)) i" |
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1332 |
|
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1333 |
instance .. |
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1334 |
|
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1335 |
end |
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1336 |
|
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1337 |
instantiation multiset :: (full_exhaustive) full_exhaustive |
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1338 |
begin |
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1339 |
|
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1340 |
definition full_exhaustive_multiset :: "('a multiset * (unit => term) => (bool * term list) option) => code_numeral => (bool * term list) option" |
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1341 |
where |
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1342 |
"full_exhaustive_multiset f i = Quickcheck_Exhaustive.full_exhaustive (%xs. f (bagify xs)) i" |
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1343 |
|
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1344 |
instance .. |
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1345 |
|
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1346 |
end |
bef8c811df20
improving code generation for multisets; adding exhaustive quickcheck generators for multisets
bulwahn
parents:
45989
diff
changeset
|
1347 |
|
36176
3fe7e97ccca8
replaced generic 'hide' command by more conventional 'hide_class', 'hide_type', 'hide_const', 'hide_fact' -- frees some popular keywords;
wenzelm
parents:
35712
diff
changeset
|
1348 |
hide_const (open) bagify |
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1349 |
|
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1350 |
|
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1351 |
subsection {* The multiset order *} |
10249 | 1352 |
|
1353 |
subsubsection {* Well-foundedness *} |
|
1354 |
||
28708
a1a436f09ec6
explicit check for pattern discipline before code translation
haftmann
parents:
28562
diff
changeset
|
1355 |
definition mult1 :: "('a \<times> 'a) set => ('a multiset \<times> 'a multiset) set" where |
37765 | 1356 |
"mult1 r = {(N, M). \<exists>a M0 K. M = M0 + {#a#} \<and> N = M0 + K \<and> |
23751 | 1357 |
(\<forall>b. b :# K --> (b, a) \<in> r)}" |
10249 | 1358 |
|
28708
a1a436f09ec6
explicit check for pattern discipline before code translation
haftmann
parents:
28562
diff
changeset
|
1359 |
definition mult :: "('a \<times> 'a) set => ('a multiset \<times> 'a multiset) set" where |
37765 | 1360 |
"mult r = (mult1 r)\<^sup>+" |
10249 | 1361 |
|
23751 | 1362 |
lemma not_less_empty [iff]: "(M, {#}) \<notin> mult1 r" |
26178 | 1363 |
by (simp add: mult1_def) |
10249 | 1364 |
|
23751 | 1365 |
lemma less_add: "(N, M0 + {#a#}) \<in> mult1 r ==> |
1366 |
(\<exists>M. (M, M0) \<in> mult1 r \<and> N = M + {#a#}) \<or> |
|
1367 |
(\<exists>K. (\<forall>b. b :# K --> (b, a) \<in> r) \<and> N = M0 + K)" |
|
19582 | 1368 |
(is "_ \<Longrightarrow> ?case1 (mult1 r) \<or> ?case2") |
10249 | 1369 |
proof (unfold mult1_def) |
23751 | 1370 |
let ?r = "\<lambda>K a. \<forall>b. b :# K --> (b, a) \<in> r" |
11464 | 1371 |
let ?R = "\<lambda>N M. \<exists>a M0 K. M = M0 + {#a#} \<and> N = M0 + K \<and> ?r K a" |
23751 | 1372 |
let ?case1 = "?case1 {(N, M). ?R N M}" |
10249 | 1373 |
|
23751 | 1374 |
assume "(N, M0 + {#a#}) \<in> {(N, M). ?R N M}" |
18258 | 1375 |
then have "\<exists>a' M0' K. |
11464 | 1376 |
M0 + {#a#} = M0' + {#a'#} \<and> N = M0' + K \<and> ?r K a'" by simp |
18258 | 1377 |
then show "?case1 \<or> ?case2" |
10249 | 1378 |
proof (elim exE conjE) |
1379 |
fix a' M0' K |
|
1380 |
assume N: "N = M0' + K" and r: "?r K a'" |
|
1381 |
assume "M0 + {#a#} = M0' + {#a'#}" |
|
18258 | 1382 |
then have "M0 = M0' \<and> a = a' \<or> |
11464 | 1383 |
(\<exists>K'. M0 = K' + {#a'#} \<and> M0' = K' + {#a#})" |
10249 | 1384 |
by (simp only: add_eq_conv_ex) |
18258 | 1385 |
then show ?thesis |
10249 | 1386 |
proof (elim disjE conjE exE) |
1387 |
assume "M0 = M0'" "a = a'" |
|
11464 | 1388 |
with N r have "?r K a \<and> N = M0 + K" by simp |
18258 | 1389 |
then have ?case2 .. then show ?thesis .. |
10249 | 1390 |
next |
1391 |
fix K' |
|
1392 |
assume "M0' = K' + {#a#}" |
|
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1393 |
with N have n: "N = K' + K + {#a#}" by (simp add: add_ac) |
10249 | 1394 |
|
1395 |
assume "M0 = K' + {#a'#}" |
|
1396 |
with r have "?R (K' + K) M0" by blast |
|
18258 | 1397 |
with n have ?case1 by simp then show ?thesis .. |
10249 | 1398 |
qed |
1399 |
qed |
|
1400 |
qed |
|
1401 |
||
23751 | 1402 |
lemma all_accessible: "wf r ==> \<forall>M. M \<in> acc (mult1 r)" |
10249 | 1403 |
proof |
1404 |
let ?R = "mult1 r" |
|
1405 |
let ?W = "acc ?R" |
|
1406 |
{ |
|
1407 |
fix M M0 a |
|
23751 | 1408 |
assume M0: "M0 \<in> ?W" |
1409 |
and wf_hyp: "!!b. (b, a) \<in> r ==> (\<forall>M \<in> ?W. M + {#b#} \<in> ?W)" |
|
1410 |
and acc_hyp: "\<forall>M. (M, M0) \<in> ?R --> M + {#a#} \<in> ?W" |
|
1411 |
have "M0 + {#a#} \<in> ?W" |
|
1412 |
proof (rule accI [of "M0 + {#a#}"]) |
|
10249 | 1413 |
fix N |
23751 | 1414 |
assume "(N, M0 + {#a#}) \<in> ?R" |
1415 |
then have "((\<exists>M. (M, M0) \<in> ?R \<and> N = M + {#a#}) \<or> |
|
1416 |
(\<exists>K. (\<forall>b. b :# K --> (b, a) \<in> r) \<and> N = M0 + K))" |
|
10249 | 1417 |
by (rule less_add) |
23751 | 1418 |
then show "N \<in> ?W" |
10249 | 1419 |
proof (elim exE disjE conjE) |
23751 | 1420 |
fix M assume "(M, M0) \<in> ?R" and N: "N = M + {#a#}" |
1421 |
from acc_hyp have "(M, M0) \<in> ?R --> M + {#a#} \<in> ?W" .. |
|
1422 |
from this and `(M, M0) \<in> ?R` have "M + {#a#} \<in> ?W" .. |
|
1423 |
then show "N \<in> ?W" by (simp only: N) |
|
10249 | 1424 |
next |
1425 |
fix K |
|
1426 |
assume N: "N = M0 + K" |
|
23751 | 1427 |
assume "\<forall>b. b :# K --> (b, a) \<in> r" |
1428 |
then have "M0 + K \<in> ?W" |
|
10249 | 1429 |
proof (induct K) |
18730 | 1430 |
case empty |
23751 | 1431 |
from M0 show "M0 + {#} \<in> ?W" by simp |
18730 | 1432 |
next |
1433 |
case (add K x) |
|
23751 | 1434 |
from add.prems have "(x, a) \<in> r" by simp |
1435 |
with wf_hyp have "\<forall>M \<in> ?W. M + {#x#} \<in> ?W" by blast |
|
1436 |
moreover from add have "M0 + K \<in> ?W" by simp |
|
1437 |
ultimately have "(M0 + K) + {#x#} \<in> ?W" .. |
|
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1438 |
then show "M0 + (K + {#x#}) \<in> ?W" by (simp only: add_assoc) |
10249 | 1439 |
qed |
23751 | 1440 |
then show "N \<in> ?W" by (simp only: N) |
10249 | 1441 |
qed |
1442 |
qed |
|
1443 |
} note tedious_reasoning = this |
|
1444 |
||
23751 | 1445 |
assume wf: "wf r" |
10249 | 1446 |
fix M |
23751 | 1447 |
show "M \<in> ?W" |
10249 | 1448 |
proof (induct M) |
23751 | 1449 |
show "{#} \<in> ?W" |
10249 | 1450 |
proof (rule accI) |
23751 | 1451 |
fix b assume "(b, {#}) \<in> ?R" |
1452 |
with not_less_empty show "b \<in> ?W" by contradiction |
|
10249 | 1453 |
qed |
1454 |
||
23751 | 1455 |
fix M a assume "M \<in> ?W" |
1456 |
from wf have "\<forall>M \<in> ?W. M + {#a#} \<in> ?W" |
|
10249 | 1457 |
proof induct |
1458 |
fix a |
|
23751 | 1459 |
assume r: "!!b. (b, a) \<in> r ==> (\<forall>M \<in> ?W. M + {#b#} \<in> ?W)" |
1460 |
show "\<forall>M \<in> ?W. M + {#a#} \<in> ?W" |
|
10249 | 1461 |
proof |
23751 | 1462 |
fix M assume "M \<in> ?W" |
1463 |
then show "M + {#a#} \<in> ?W" |
|
23373 | 1464 |
by (rule acc_induct) (rule tedious_reasoning [OF _ r]) |
10249 | 1465 |
qed |
1466 |
qed |
|
23751 | 1467 |
from this and `M \<in> ?W` show "M + {#a#} \<in> ?W" .. |
10249 | 1468 |
qed |
1469 |
qed |
|
1470 |
||
23751 | 1471 |
theorem wf_mult1: "wf r ==> wf (mult1 r)" |
26178 | 1472 |
by (rule acc_wfI) (rule all_accessible) |
10249 | 1473 |
|
23751 | 1474 |
theorem wf_mult: "wf r ==> wf (mult r)" |
26178 | 1475 |
unfolding mult_def by (rule wf_trancl) (rule wf_mult1) |
10249 | 1476 |
|
1477 |
||
1478 |
subsubsection {* Closure-free presentation *} |
|
1479 |
||
1480 |
text {* One direction. *} |
|
1481 |
||
1482 |
lemma mult_implies_one_step: |
|
23751 | 1483 |
"trans r ==> (M, N) \<in> mult r ==> |
11464 | 1484 |
\<exists>I J K. N = I + J \<and> M = I + K \<and> J \<noteq> {#} \<and> |
23751 | 1485 |
(\<forall>k \<in> set_of K. \<exists>j \<in> set_of J. (k, j) \<in> r)" |
26178 | 1486 |
apply (unfold mult_def mult1_def set_of_def) |
1487 |
apply (erule converse_trancl_induct, clarify) |
|
1488 |
apply (rule_tac x = M0 in exI, simp, clarify) |
|
1489 |
apply (case_tac "a :# K") |
|
1490 |
apply (rule_tac x = I in exI) |
|
1491 |
apply (simp (no_asm)) |
|
1492 |
apply (rule_tac x = "(K - {#a#}) + Ka" in exI) |
|
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1493 |
apply (simp (no_asm_simp) add: add_assoc [symmetric]) |
26178 | 1494 |
apply (drule_tac f = "\<lambda>M. M - {#a#}" in arg_cong) |
1495 |
apply (simp add: diff_union_single_conv) |
|
1496 |
apply (simp (no_asm_use) add: trans_def) |
|
1497 |
apply blast |
|
1498 |
apply (subgoal_tac "a :# I") |
|
1499 |
apply (rule_tac x = "I - {#a#}" in exI) |
|
1500 |
apply (rule_tac x = "J + {#a#}" in exI) |
|
1501 |
apply (rule_tac x = "K + Ka" in exI) |
|
1502 |
apply (rule conjI) |
|
39302
d7728f65b353
renamed lemmas: ext_iff -> fun_eq_iff, set_ext_iff -> set_eq_iff, set_ext -> set_eqI
nipkow
parents:
39301
diff
changeset
|
1503 |
apply (simp add: multiset_eq_iff split: nat_diff_split) |
26178 | 1504 |
apply (rule conjI) |
1505 |
apply (drule_tac f = "\<lambda>M. M - {#a#}" in arg_cong, simp) |
|
39302
d7728f65b353
renamed lemmas: ext_iff -> fun_eq_iff, set_ext_iff -> set_eq_iff, set_ext -> set_eqI
nipkow
parents:
39301
diff
changeset
|
1506 |
apply (simp add: multiset_eq_iff split: nat_diff_split) |
26178 | 1507 |
apply (simp (no_asm_use) add: trans_def) |
1508 |
apply blast |
|
1509 |
apply (subgoal_tac "a :# (M0 + {#a#})") |
|
1510 |
apply simp |
|
1511 |
apply (simp (no_asm)) |
|
1512 |
done |
|
10249 | 1513 |
|
1514 |
lemma one_step_implies_mult_aux: |
|
23751 | 1515 |
"trans r ==> |
1516 |
\<forall>I J K. (size J = n \<and> J \<noteq> {#} \<and> (\<forall>k \<in> set_of K. \<exists>j \<in> set_of J. (k, j) \<in> r)) |
|
1517 |
--> (I + K, I + J) \<in> mult r" |
|
26178 | 1518 |
apply (induct_tac n, auto) |
1519 |
apply (frule size_eq_Suc_imp_eq_union, clarify) |
|
1520 |
apply (rename_tac "J'", simp) |
|
1521 |
apply (erule notE, auto) |
|
1522 |
apply (case_tac "J' = {#}") |
|
1523 |
apply (simp add: mult_def) |
|
1524 |
apply (rule r_into_trancl) |
|
1525 |
apply (simp add: mult1_def set_of_def, blast) |
|
1526 |
txt {* Now we know @{term "J' \<noteq> {#}"}. *} |
|
1527 |
apply (cut_tac M = K and P = "\<lambda>x. (x, a) \<in> r" in multiset_partition) |
|
1528 |
apply (erule_tac P = "\<forall>k \<in> set_of K. ?P k" in rev_mp) |
|
1529 |
apply (erule ssubst) |
|
1530 |
apply (simp add: Ball_def, auto) |
|
1531 |
apply (subgoal_tac |
|
1532 |
"((I + {# x :# K. (x, a) \<in> r #}) + {# x :# K. (x, a) \<notin> r #}, |
|
1533 |
(I + {# x :# K. (x, a) \<in> r #}) + J') \<in> mult r") |
|
1534 |
prefer 2 |
|
1535 |
apply force |
|
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1536 |
apply (simp (no_asm_use) add: add_assoc [symmetric] mult_def) |
26178 | 1537 |
apply (erule trancl_trans) |
1538 |
apply (rule r_into_trancl) |
|
1539 |
apply (simp add: mult1_def set_of_def) |
|
1540 |
apply (rule_tac x = a in exI) |
|
1541 |
apply (rule_tac x = "I + J'" in exI) |
|
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1542 |
apply (simp add: add_ac) |
26178 | 1543 |
done |
10249 | 1544 |
|
17161 | 1545 |
lemma one_step_implies_mult: |
23751 | 1546 |
"trans r ==> J \<noteq> {#} ==> \<forall>k \<in> set_of K. \<exists>j \<in> set_of J. (k, j) \<in> r |
1547 |
==> (I + K, I + J) \<in> mult r" |
|
26178 | 1548 |
using one_step_implies_mult_aux by blast |
10249 | 1549 |
|
1550 |
||
1551 |
subsubsection {* Partial-order properties *} |
|
1552 |
||
35273 | 1553 |
definition less_multiset :: "'a\<Colon>order multiset \<Rightarrow> 'a multiset \<Rightarrow> bool" (infix "<#" 50) where |
1554 |
"M' <# M \<longleftrightarrow> (M', M) \<in> mult {(x', x). x' < x}" |
|
10249 | 1555 |
|
35273 | 1556 |
definition le_multiset :: "'a\<Colon>order multiset \<Rightarrow> 'a multiset \<Rightarrow> bool" (infix "<=#" 50) where |
1557 |
"M' <=# M \<longleftrightarrow> M' <# M \<or> M' = M" |
|
1558 |
||
35308 | 1559 |
notation (xsymbols) less_multiset (infix "\<subset>#" 50) |
1560 |
notation (xsymbols) le_multiset (infix "\<subseteq>#" 50) |
|
10249 | 1561 |
|
35268
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
1562 |
interpretation multiset_order: order le_multiset less_multiset |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
1563 |
proof - |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
1564 |
have irrefl: "\<And>M :: 'a multiset. \<not> M \<subset># M" |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
1565 |
proof |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
1566 |
fix M :: "'a multiset" |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
1567 |
assume "M \<subset># M" |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
1568 |
then have MM: "(M, M) \<in> mult {(x, y). x < y}" by (simp add: less_multiset_def) |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
1569 |
have "trans {(x'::'a, x). x' < x}" |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
1570 |
by (rule transI) simp |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
1571 |
moreover note MM |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
1572 |
ultimately have "\<exists>I J K. M = I + J \<and> M = I + K |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
1573 |
\<and> J \<noteq> {#} \<and> (\<forall>k\<in>set_of K. \<exists>j\<in>set_of J. (k, j) \<in> {(x, y). x < y})" |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
1574 |
by (rule mult_implies_one_step) |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
1575 |
then obtain I J K where "M = I + J" and "M = I + K" |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
1576 |
and "J \<noteq> {#}" and "(\<forall>k\<in>set_of K. \<exists>j\<in>set_of J. (k, j) \<in> {(x, y). x < y})" by blast |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
1577 |
then have aux1: "K \<noteq> {#}" and aux2: "\<forall>k\<in>set_of K. \<exists>j\<in>set_of K. k < j" by auto |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
1578 |
have "finite (set_of K)" by simp |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
1579 |
moreover note aux2 |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
1580 |
ultimately have "set_of K = {}" |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
1581 |
by (induct rule: finite_induct) (auto intro: order_less_trans) |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
1582 |
with aux1 show False by simp |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
1583 |
qed |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
1584 |
have trans: "\<And>K M N :: 'a multiset. K \<subset># M \<Longrightarrow> M \<subset># N \<Longrightarrow> K \<subset># N" |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
1585 |
unfolding less_multiset_def mult_def by (blast intro: trancl_trans) |
46921 | 1586 |
show "class.order (le_multiset :: 'a multiset \<Rightarrow> _) less_multiset" |
1587 |
by default (auto simp add: le_multiset_def irrefl dest: trans) |
|
35268
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
1588 |
qed |
10249 | 1589 |
|
46730 | 1590 |
lemma mult_less_irrefl [elim!]: "M \<subset># (M::'a::order multiset) ==> R" |
1591 |
by simp |
|
26567
7bcebb8c2d33
instantiation replacing primitive instance plus overloaded defs; more conservative type arities
haftmann
parents:
26178
diff
changeset
|
1592 |
|
10249 | 1593 |
|
1594 |
subsubsection {* Monotonicity of multiset union *} |
|
1595 |
||
46730 | 1596 |
lemma mult1_union: "(B, D) \<in> mult1 r ==> (C + B, C + D) \<in> mult1 r" |
26178 | 1597 |
apply (unfold mult1_def) |
1598 |
apply auto |
|
1599 |
apply (rule_tac x = a in exI) |
|
1600 |
apply (rule_tac x = "C + M0" in exI) |
|
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1601 |
apply (simp add: add_assoc) |
26178 | 1602 |
done |
10249 | 1603 |
|
35268
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
1604 |
lemma union_less_mono2: "B \<subset># D ==> C + B \<subset># C + (D::'a::order multiset)" |
26178 | 1605 |
apply (unfold less_multiset_def mult_def) |
1606 |
apply (erule trancl_induct) |
|
40249
cd404ecb9107
Remove unnecessary premise of mult1_union
Lars Noschinski <noschinl@in.tum.de>
parents:
39533
diff
changeset
|
1607 |
apply (blast intro: mult1_union) |
cd404ecb9107
Remove unnecessary premise of mult1_union
Lars Noschinski <noschinl@in.tum.de>
parents:
39533
diff
changeset
|
1608 |
apply (blast intro: mult1_union trancl_trans) |
26178 | 1609 |
done |
10249 | 1610 |
|
35268
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
1611 |
lemma union_less_mono1: "B \<subset># D ==> B + C \<subset># D + (C::'a::order multiset)" |
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1612 |
apply (subst add_commute [of B C]) |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1613 |
apply (subst add_commute [of D C]) |
26178 | 1614 |
apply (erule union_less_mono2) |
1615 |
done |
|
10249 | 1616 |
|
17161 | 1617 |
lemma union_less_mono: |
35268
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
1618 |
"A \<subset># C ==> B \<subset># D ==> A + B \<subset># C + (D::'a::order multiset)" |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
1619 |
by (blast intro!: union_less_mono1 union_less_mono2 multiset_order.less_trans) |
10249 | 1620 |
|
35268
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
1621 |
interpretation multiset_order: ordered_ab_semigroup_add plus le_multiset less_multiset |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
1622 |
proof |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
1623 |
qed (auto simp add: le_multiset_def intro: union_less_mono2) |
26145 | 1624 |
|
15072 | 1625 |
|
29125
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1626 |
subsection {* Termination proofs with multiset orders *} |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1627 |
|
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1628 |
lemma multi_member_skip: "x \<in># XS \<Longrightarrow> x \<in># {# y #} + XS" |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1629 |
and multi_member_this: "x \<in># {# x #} + XS" |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1630 |
and multi_member_last: "x \<in># {# x #}" |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1631 |
by auto |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1632 |
|
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1633 |
definition "ms_strict = mult pair_less" |
37765 | 1634 |
definition "ms_weak = ms_strict \<union> Id" |
29125
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1635 |
|
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1636 |
lemma ms_reduction_pair: "reduction_pair (ms_strict, ms_weak)" |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1637 |
unfolding reduction_pair_def ms_strict_def ms_weak_def pair_less_def |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1638 |
by (auto intro: wf_mult1 wf_trancl simp: mult_def) |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1639 |
|
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1640 |
lemma smsI: |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1641 |
"(set_of A, set_of B) \<in> max_strict \<Longrightarrow> (Z + A, Z + B) \<in> ms_strict" |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1642 |
unfolding ms_strict_def |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1643 |
by (rule one_step_implies_mult) (auto simp add: max_strict_def pair_less_def elim!:max_ext.cases) |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1644 |
|
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1645 |
lemma wmsI: |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1646 |
"(set_of A, set_of B) \<in> max_strict \<or> A = {#} \<and> B = {#} |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1647 |
\<Longrightarrow> (Z + A, Z + B) \<in> ms_weak" |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1648 |
unfolding ms_weak_def ms_strict_def |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1649 |
by (auto simp add: pair_less_def max_strict_def elim!:max_ext.cases intro: one_step_implies_mult) |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1650 |
|
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1651 |
inductive pw_leq |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1652 |
where |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1653 |
pw_leq_empty: "pw_leq {#} {#}" |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1654 |
| pw_leq_step: "\<lbrakk>(x,y) \<in> pair_leq; pw_leq X Y \<rbrakk> \<Longrightarrow> pw_leq ({#x#} + X) ({#y#} + Y)" |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1655 |
|
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1656 |
lemma pw_leq_lstep: |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1657 |
"(x, y) \<in> pair_leq \<Longrightarrow> pw_leq {#x#} {#y#}" |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1658 |
by (drule pw_leq_step) (rule pw_leq_empty, simp) |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1659 |
|
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1660 |
lemma pw_leq_split: |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1661 |
assumes "pw_leq X Y" |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1662 |
shows "\<exists>A B Z. X = A + Z \<and> Y = B + Z \<and> ((set_of A, set_of B) \<in> max_strict \<or> (B = {#} \<and> A = {#}))" |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1663 |
using assms |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1664 |
proof (induct) |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1665 |
case pw_leq_empty thus ?case by auto |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1666 |
next |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1667 |
case (pw_leq_step x y X Y) |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1668 |
then obtain A B Z where |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1669 |
[simp]: "X = A + Z" "Y = B + Z" |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1670 |
and 1[simp]: "(set_of A, set_of B) \<in> max_strict \<or> (B = {#} \<and> A = {#})" |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1671 |
by auto |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1672 |
from pw_leq_step have "x = y \<or> (x, y) \<in> pair_less" |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1673 |
unfolding pair_leq_def by auto |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1674 |
thus ?case |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1675 |
proof |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1676 |
assume [simp]: "x = y" |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1677 |
have |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1678 |
"{#x#} + X = A + ({#y#}+Z) |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1679 |
\<and> {#y#} + Y = B + ({#y#}+Z) |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1680 |
\<and> ((set_of A, set_of B) \<in> max_strict \<or> (B = {#} \<and> A = {#}))" |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1681 |
by (auto simp: add_ac) |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1682 |
thus ?case by (intro exI) |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1683 |
next |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1684 |
assume A: "(x, y) \<in> pair_less" |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1685 |
let ?A' = "{#x#} + A" and ?B' = "{#y#} + B" |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1686 |
have "{#x#} + X = ?A' + Z" |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1687 |
"{#y#} + Y = ?B' + Z" |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1688 |
by (auto simp add: add_ac) |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1689 |
moreover have |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1690 |
"(set_of ?A', set_of ?B') \<in> max_strict" |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1691 |
using 1 A unfolding max_strict_def |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1692 |
by (auto elim!: max_ext.cases) |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1693 |
ultimately show ?thesis by blast |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1694 |
qed |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1695 |
qed |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1696 |
|
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1697 |
lemma |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1698 |
assumes pwleq: "pw_leq Z Z'" |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1699 |
shows ms_strictI: "(set_of A, set_of B) \<in> max_strict \<Longrightarrow> (Z + A, Z' + B) \<in> ms_strict" |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1700 |
and ms_weakI1: "(set_of A, set_of B) \<in> max_strict \<Longrightarrow> (Z + A, Z' + B) \<in> ms_weak" |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1701 |
and ms_weakI2: "(Z + {#}, Z' + {#}) \<in> ms_weak" |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1702 |
proof - |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1703 |
from pw_leq_split[OF pwleq] |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1704 |
obtain A' B' Z'' |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1705 |
where [simp]: "Z = A' + Z''" "Z' = B' + Z''" |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1706 |
and mx_or_empty: "(set_of A', set_of B') \<in> max_strict \<or> (A' = {#} \<and> B' = {#})" |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1707 |
by blast |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1708 |
{ |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1709 |
assume max: "(set_of A, set_of B) \<in> max_strict" |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1710 |
from mx_or_empty |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1711 |
have "(Z'' + (A + A'), Z'' + (B + B')) \<in> ms_strict" |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1712 |
proof |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1713 |
assume max': "(set_of A', set_of B') \<in> max_strict" |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1714 |
with max have "(set_of (A + A'), set_of (B + B')) \<in> max_strict" |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1715 |
by (auto simp: max_strict_def intro: max_ext_additive) |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1716 |
thus ?thesis by (rule smsI) |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1717 |
next |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1718 |
assume [simp]: "A' = {#} \<and> B' = {#}" |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1719 |
show ?thesis by (rule smsI) (auto intro: max) |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1720 |
qed |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1721 |
thus "(Z + A, Z' + B) \<in> ms_strict" by (simp add:add_ac) |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1722 |
thus "(Z + A, Z' + B) \<in> ms_weak" by (simp add: ms_weak_def) |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1723 |
} |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1724 |
from mx_or_empty |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1725 |
have "(Z'' + A', Z'' + B') \<in> ms_weak" by (rule wmsI) |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1726 |
thus "(Z + {#}, Z' + {#}) \<in> ms_weak" by (simp add:add_ac) |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1727 |
qed |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1728 |
|
39301 | 1729 |
lemma empty_neutral: "{#} + x = x" "x + {#} = x" |
29125
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1730 |
and nonempty_plus: "{# x #} + rs \<noteq> {#}" |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1731 |
and nonempty_single: "{# x #} \<noteq> {#}" |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1732 |
by auto |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1733 |
|
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1734 |
setup {* |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1735 |
let |
35402 | 1736 |
fun msetT T = Type (@{type_name multiset}, [T]); |
29125
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1737 |
|
35402 | 1738 |
fun mk_mset T [] = Const (@{const_abbrev Mempty}, msetT T) |
29125
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1739 |
| mk_mset T [x] = Const (@{const_name single}, T --> msetT T) $ x |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1740 |
| mk_mset T (x :: xs) = |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1741 |
Const (@{const_name plus}, msetT T --> msetT T --> msetT T) $ |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1742 |
mk_mset T [x] $ mk_mset T xs |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1743 |
|
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1744 |
fun mset_member_tac m i = |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1745 |
(if m <= 0 then |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1746 |
rtac @{thm multi_member_this} i ORELSE rtac @{thm multi_member_last} i |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1747 |
else |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1748 |
rtac @{thm multi_member_skip} i THEN mset_member_tac (m - 1) i) |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1749 |
|
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1750 |
val mset_nonempty_tac = |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1751 |
rtac @{thm nonempty_plus} ORELSE' rtac @{thm nonempty_single} |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1752 |
|
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1753 |
val regroup_munion_conv = |
35402 | 1754 |
Function_Lib.regroup_conv @{const_abbrev Mempty} @{const_name plus} |
39301 | 1755 |
(map (fn t => t RS eq_reflection) (@{thms add_ac} @ @{thms empty_neutral})) |
29125
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1756 |
|
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1757 |
fun unfold_pwleq_tac i = |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1758 |
(rtac @{thm pw_leq_step} i THEN (fn st => unfold_pwleq_tac (i + 1) st)) |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1759 |
ORELSE (rtac @{thm pw_leq_lstep} i) |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1760 |
ORELSE (rtac @{thm pw_leq_empty} i) |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1761 |
|
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1762 |
val set_of_simps = [@{thm set_of_empty}, @{thm set_of_single}, @{thm set_of_union}, |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1763 |
@{thm Un_insert_left}, @{thm Un_empty_left}] |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1764 |
in |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1765 |
ScnpReconstruct.multiset_setup (ScnpReconstruct.Multiset |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1766 |
{ |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1767 |
msetT=msetT, mk_mset=mk_mset, mset_regroup_conv=regroup_munion_conv, |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1768 |
mset_member_tac=mset_member_tac, mset_nonempty_tac=mset_nonempty_tac, |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1769 |
mset_pwleq_tac=unfold_pwleq_tac, set_of_simps=set_of_simps, |
30595
c87a3350f5a9
proper spacing before ML antiquotations -- note that @ may be part of symbolic ML identifiers;
wenzelm
parents:
30428
diff
changeset
|
1770 |
smsI'= @{thm ms_strictI}, wmsI2''= @{thm ms_weakI2}, wmsI1= @{thm ms_weakI1}, |
c87a3350f5a9
proper spacing before ML antiquotations -- note that @ may be part of symbolic ML identifiers;
wenzelm
parents:
30428
diff
changeset
|
1771 |
reduction_pair= @{thm ms_reduction_pair} |
29125
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1772 |
}) |
10249 | 1773 |
end |
29125
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1774 |
*} |
d41182a8135c
method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents:
28823
diff
changeset
|
1775 |
|
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1776 |
|
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1777 |
subsection {* Legacy theorem bindings *} |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1778 |
|
39302
d7728f65b353
renamed lemmas: ext_iff -> fun_eq_iff, set_ext_iff -> set_eq_iff, set_ext -> set_eqI
nipkow
parents:
39301
diff
changeset
|
1779 |
lemmas multi_count_eq = multiset_eq_iff [symmetric] |
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1780 |
|
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1781 |
lemma union_commute: "M + N = N + (M::'a multiset)" |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1782 |
by (fact add_commute) |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1783 |
|
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1784 |
lemma union_assoc: "(M + N) + K = M + (N + (K::'a multiset))" |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1785 |
by (fact add_assoc) |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1786 |
|
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1787 |
lemma union_lcomm: "M + (N + K) = N + (M + (K::'a multiset))" |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1788 |
by (fact add_left_commute) |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1789 |
|
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1790 |
lemmas union_ac = union_assoc union_commute union_lcomm |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1791 |
|
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1792 |
lemma union_right_cancel: "M + K = N + K \<longleftrightarrow> M = (N::'a multiset)" |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1793 |
by (fact add_right_cancel) |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1794 |
|
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1795 |
lemma union_left_cancel: "K + M = K + N \<longleftrightarrow> M = (N::'a multiset)" |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1796 |
by (fact add_left_cancel) |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1797 |
|
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1798 |
lemma multi_union_self_other_eq: "(A::'a multiset) + X = A + Y \<Longrightarrow> X = Y" |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1799 |
by (fact add_imp_eq) |
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1800 |
|
35268
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
1801 |
lemma mset_less_trans: "(M::'a multiset) < K \<Longrightarrow> K < N \<Longrightarrow> M < N" |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
1802 |
by (fact order_less_trans) |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
1803 |
|
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
1804 |
lemma multiset_inter_commute: "A #\<inter> B = B #\<inter> A" |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
1805 |
by (fact inf.commute) |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
1806 |
|
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
1807 |
lemma multiset_inter_assoc: "A #\<inter> (B #\<inter> C) = A #\<inter> B #\<inter> C" |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
1808 |
by (fact inf.assoc [symmetric]) |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
1809 |
|
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
1810 |
lemma multiset_inter_left_commute: "A #\<inter> (B #\<inter> C) = B #\<inter> (A #\<inter> C)" |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
1811 |
by (fact inf.left_commute) |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
1812 |
|
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
1813 |
lemmas multiset_inter_ac = |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
1814 |
multiset_inter_commute |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
1815 |
multiset_inter_assoc |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
1816 |
multiset_inter_left_commute |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
1817 |
|
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
1818 |
lemma mult_less_not_refl: |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
1819 |
"\<not> M \<subset># (M::'a::order multiset)" |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
1820 |
by (fact multiset_order.less_irrefl) |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
1821 |
|
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
1822 |
lemma mult_less_trans: |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
1823 |
"K \<subset># M ==> M \<subset># N ==> K \<subset># (N::'a::order multiset)" |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
1824 |
by (fact multiset_order.less_trans) |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
1825 |
|
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
1826 |
lemma mult_less_not_sym: |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
1827 |
"M \<subset># N ==> \<not> N \<subset># (M::'a::order multiset)" |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
1828 |
by (fact multiset_order.less_not_sym) |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
1829 |
|
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
1830 |
lemma mult_less_asym: |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
1831 |
"M \<subset># N ==> (\<not> P ==> N \<subset># (M::'a::order multiset)) ==> P" |
04673275441a
switched notations for pointwise and multiset order
haftmann
parents:
35028
diff
changeset
|
1832 |
by (fact multiset_order.less_asym) |
34943
e97b22500a5c
cleanup of Multiset.thy: less duplication, tuned and simplified a couple of proofs, less historical organization of sections, conversion from associations lists to multisets, rudimentary code generation
haftmann
parents:
33102
diff
changeset
|
1833 |
|
35712
77aa29bf14ee
added a mechanism to Nitpick to support custom rendering of terms, and used it for multisets
blanchet
parents:
35402
diff
changeset
|
1834 |
ML {* |
77aa29bf14ee
added a mechanism to Nitpick to support custom rendering of terms, and used it for multisets
blanchet
parents:
35402
diff
changeset
|
1835 |
fun multiset_postproc _ maybe_name all_values (T as Type (_, [elem_T])) |
77aa29bf14ee
added a mechanism to Nitpick to support custom rendering of terms, and used it for multisets
blanchet
parents:
35402
diff
changeset
|
1836 |
(Const _ $ t') = |
77aa29bf14ee
added a mechanism to Nitpick to support custom rendering of terms, and used it for multisets
blanchet
parents:
35402
diff
changeset
|
1837 |
let |
77aa29bf14ee
added a mechanism to Nitpick to support custom rendering of terms, and used it for multisets
blanchet
parents:
35402
diff
changeset
|
1838 |
val (maybe_opt, ps) = |
77aa29bf14ee
added a mechanism to Nitpick to support custom rendering of terms, and used it for multisets
blanchet
parents:
35402
diff
changeset
|
1839 |
Nitpick_Model.dest_plain_fun t' ||> op ~~ |
77aa29bf14ee
added a mechanism to Nitpick to support custom rendering of terms, and used it for multisets
blanchet
parents:
35402
diff
changeset
|
1840 |
||> map (apsnd (snd o HOLogic.dest_number)) |
77aa29bf14ee
added a mechanism to Nitpick to support custom rendering of terms, and used it for multisets
blanchet
parents:
35402
diff
changeset
|
1841 |
fun elems_for t = |
77aa29bf14ee
added a mechanism to Nitpick to support custom rendering of terms, and used it for multisets
blanchet
parents:
35402
diff
changeset
|
1842 |
case AList.lookup (op =) ps t of |
77aa29bf14ee
added a mechanism to Nitpick to support custom rendering of terms, and used it for multisets
blanchet
parents:
35402
diff
changeset
|
1843 |
SOME n => replicate n t |
77aa29bf14ee
added a mechanism to Nitpick to support custom rendering of terms, and used it for multisets
blanchet
parents:
35402
diff
changeset
|
1844 |
| NONE => [Const (maybe_name, elem_T --> elem_T) $ t] |
77aa29bf14ee
added a mechanism to Nitpick to support custom rendering of terms, and used it for multisets
blanchet
parents:
35402
diff
changeset
|
1845 |
in |
77aa29bf14ee
added a mechanism to Nitpick to support custom rendering of terms, and used it for multisets
blanchet
parents:
35402
diff
changeset
|
1846 |
case maps elems_for (all_values elem_T) @ |
37261 | 1847 |
(if maybe_opt then [Const (Nitpick_Model.unrep (), elem_T)] |
1848 |
else []) of |
|
35712
77aa29bf14ee
added a mechanism to Nitpick to support custom rendering of terms, and used it for multisets
blanchet
parents:
35402
diff
changeset
|
1849 |
[] => Const (@{const_name zero_class.zero}, T) |
77aa29bf14ee
added a mechanism to Nitpick to support custom rendering of terms, and used it for multisets
blanchet
parents:
35402
diff
changeset
|
1850 |
| ts => foldl1 (fn (t1, t2) => |
77aa29bf14ee
added a mechanism to Nitpick to support custom rendering of terms, and used it for multisets
blanchet
parents:
35402
diff
changeset
|
1851 |
Const (@{const_name plus_class.plus}, T --> T --> T) |
77aa29bf14ee
added a mechanism to Nitpick to support custom rendering of terms, and used it for multisets
blanchet
parents:
35402
diff
changeset
|
1852 |
$ t1 $ t2) |
77aa29bf14ee
added a mechanism to Nitpick to support custom rendering of terms, and used it for multisets
blanchet
parents:
35402
diff
changeset
|
1853 |
(map (curry (op $) (Const (@{const_name single}, |
77aa29bf14ee
added a mechanism to Nitpick to support custom rendering of terms, and used it for multisets
blanchet
parents:
35402
diff
changeset
|
1854 |
elem_T --> T))) ts) |
77aa29bf14ee
added a mechanism to Nitpick to support custom rendering of terms, and used it for multisets
blanchet
parents:
35402
diff
changeset
|
1855 |
end |
77aa29bf14ee
added a mechanism to Nitpick to support custom rendering of terms, and used it for multisets
blanchet
parents:
35402
diff
changeset
|
1856 |
| multiset_postproc _ _ _ _ t = t |
77aa29bf14ee
added a mechanism to Nitpick to support custom rendering of terms, and used it for multisets
blanchet
parents:
35402
diff
changeset
|
1857 |
*} |
77aa29bf14ee
added a mechanism to Nitpick to support custom rendering of terms, and used it for multisets
blanchet
parents:
35402
diff
changeset
|
1858 |
|
38287 | 1859 |
declaration {* |
1860 |
Nitpick_Model.register_term_postprocessor @{typ "'a multiset"} |
|
38242 | 1861 |
multiset_postproc |
35712
77aa29bf14ee
added a mechanism to Nitpick to support custom rendering of terms, and used it for multisets
blanchet
parents:
35402
diff
changeset
|
1862 |
*} |
77aa29bf14ee
added a mechanism to Nitpick to support custom rendering of terms, and used it for multisets
blanchet
parents:
35402
diff
changeset
|
1863 |
|
49822
0cfc1651be25
simplified construction of fold combinator on multisets;
haftmann
parents:
49717
diff
changeset
|
1864 |
hide_const (open) fold |
0cfc1651be25
simplified construction of fold combinator on multisets;
haftmann
parents:
49717
diff
changeset
|
1865 |
|
37169
f69efa106feb
make Nitpick "show_all" option behave less surprisingly
blanchet
parents:
37107
diff
changeset
|
1866 |
end |
49388 | 1867 |