1 (* Title: HOL/ZF/LProd.thy
4 Introduces the lprod relation.
5 See "Partizan Games in Isabelle/HOLZF", available from http://www4.in.tum.de/~obua/partizan
9 imports "~~/src/HOL/Library/Multiset"
13 lprod :: "('a * 'a) set \<Rightarrow> ('a list * 'a list) set"
14 for R :: "('a * 'a) set"
16 lprod_single[intro!]: "(a, b) \<in> R \<Longrightarrow> ([a], [b]) \<in> lprod R"
17 | lprod_list[intro!]: "(ah@at, bh@bt) \<in> lprod R \<Longrightarrow> (a,b) \<in> R \<or> a = b \<Longrightarrow> (ah@a#at, bh@b#bt) \<in> lprod R"
19 lemma "(as,bs) \<in> lprod R \<Longrightarrow> length as = length bs"
20 apply (induct as bs rule: lprod.induct)
24 lemma "(as, bs) \<in> lprod R \<Longrightarrow> 1 \<le> length as \<and> 1 \<le> length bs"
25 apply (induct as bs rule: lprod.induct)
29 lemma lprod_subset_elem: "(as, bs) \<in> lprod S \<Longrightarrow> S \<subseteq> R \<Longrightarrow> (as, bs) \<in> lprod R"
30 apply (induct as bs rule: lprod.induct)
34 lemma lprod_subset: "S \<subseteq> R \<Longrightarrow> lprod S \<subseteq> lprod R"
35 by (auto intro: lprod_subset_elem)
37 lemma lprod_implies_mult: "(as, bs) \<in> lprod R \<Longrightarrow> trans R \<Longrightarrow> (multiset_of as, multiset_of bs) \<in> mult R"
38 proof (induct as bs rule: lprod.induct)
39 case (lprod_single a b)
40 note step = one_step_implies_mult[
41 where r=R and I="{#}" and K="{#a#}" and J="{#b#}", simplified]
42 show ?case by (auto intro: lprod_single step)
44 case (lprod_list ah at bh bt a b)
45 then have transR: "trans R" by auto
46 have as: "multiset_of (ah @ a # at) = multiset_of (ah @ at) + {#a#}" (is "_ = ?ma + _")
47 by (simp add: algebra_simps)
48 have bs: "multiset_of (bh @ b # bt) = multiset_of (bh @ bt) + {#b#}" (is "_ = ?mb + _")
49 by (simp add: algebra_simps)
50 from lprod_list have "(?ma, ?mb) \<in> mult R"
52 with mult_implies_one_step[OF transR] have
53 "\<exists>I J K. ?mb = I + J \<and> ?ma = I + K \<and> J \<noteq> {#} \<and> (\<forall>k\<in>set_of K. \<exists>j\<in>set_of J. (k, j) \<in> R)"
55 then obtain I J K where
56 decomposed: "?mb = I + J \<and> ?ma = I + K \<and> J \<noteq> {#} \<and> (\<forall>k\<in>set_of K. \<exists>j\<in>set_of J. (k, j) \<in> R)"
61 have "((I + {#b#}) + K, (I + {#b#}) + J) \<in> mult R"
62 apply (rule one_step_implies_mult[OF transR])
63 apply (auto simp add: decomposed)
66 apply (simp only: as bs)
67 apply (simp only: decomposed True)
68 apply (simp add: algebra_simps)
72 from False lprod_list have False: "(a, b) \<in> R" by blast
73 have "(I + (K + {#a#}), I + (J + {#b#})) \<in> mult R"
74 apply (rule one_step_implies_mult[OF transR])
75 apply (auto simp add: False decomposed)
78 apply (simp only: as bs)
79 apply (simp only: decomposed)
80 apply (simp add: algebra_simps)
85 lemma wf_lprod[simp,intro]:
89 have subset: "lprod (R^+) \<subseteq> inv_image (mult (R^+)) multiset_of"
90 by (auto simp add: lprod_implies_mult trans_trancl)
91 note lprodtrancl = wf_subset[OF wf_inv_image[where r="mult (R^+)" and f="multiset_of",
92 OF wf_mult[OF wf_trancl[OF wf_R]]], OF subset]
93 note lprod = wf_subset[OF lprodtrancl, where p="lprod R", OF lprod_subset, simplified]
94 show ?thesis by (auto intro: lprod)
97 definition gprod_2_2 :: "('a * 'a) set \<Rightarrow> (('a * 'a) * ('a * 'a)) set" where
98 "gprod_2_2 R \<equiv> { ((a,b), (c,d)) . (a = c \<and> (b,d) \<in> R) \<or> (b = d \<and> (a,c) \<in> R) }"
100 definition gprod_2_1 :: "('a * 'a) set \<Rightarrow> (('a * 'a) * ('a * 'a)) set" where
101 "gprod_2_1 R \<equiv> { ((a,b), (c,d)) . (a = d \<and> (b,c) \<in> R) \<or> (b = c \<and> (a,d) \<in> R) }"
103 lemma lprod_2_3: "(a, b) \<in> R \<Longrightarrow> ([a, c], [b, c]) \<in> lprod R"
104 by (auto intro: lprod_list[where a=c and b=c and
105 ah = "[a]" and at = "[]" and bh="[b]" and bt="[]", simplified])
107 lemma lprod_2_4: "(a, b) \<in> R \<Longrightarrow> ([c, a], [c, b]) \<in> lprod R"
108 by (auto intro: lprod_list[where a=c and b=c and
109 ah = "[]" and at = "[a]" and bh="[]" and bt="[b]", simplified])
111 lemma lprod_2_1: "(a, b) \<in> R \<Longrightarrow> ([c, a], [b, c]) \<in> lprod R"
112 by (auto intro: lprod_list[where a=c and b=c and
113 ah = "[]" and at = "[a]" and bh="[b]" and bt="[]", simplified])
115 lemma lprod_2_2: "(a, b) \<in> R \<Longrightarrow> ([a, c], [c, b]) \<in> lprod R"
116 by (auto intro: lprod_list[where a=c and b=c and
117 ah = "[a]" and at = "[]" and bh="[]" and bt="[b]", simplified])
120 assumes wfR: "wf R" shows "wf (gprod_2_1 R)"
122 have "gprod_2_1 R \<subseteq> inv_image (lprod R) (\<lambda> (a,b). [a,b])"
123 by (auto simp add: gprod_2_1_def lprod_2_1 lprod_2_2)
124 with wfR show ?thesis
125 by (rule_tac wf_subset, auto)
129 assumes wfR: "wf R" shows "wf (gprod_2_2 R)"
131 have "gprod_2_2 R \<subseteq> inv_image (lprod R) (\<lambda> (a,b). [a,b])"
132 by (auto simp add: gprod_2_2_def lprod_2_3 lprod_2_4)
133 with wfR show ?thesis
134 by (rule_tac wf_subset, auto)
137 lemma lprod_3_1: assumes "(x', x) \<in> R" shows "([y, z, x'], [x, y, z]) \<in> lprod R"
138 apply (rule lprod_list[where a="y" and b="y" and ah="[]" and at="[z,x']" and bh="[x]" and bt="[z]", simplified])
139 apply (auto simp add: lprod_2_1 assms)
142 lemma lprod_3_2: assumes "(z',z) \<in> R" shows "([z', x, y], [x,y,z]) \<in> lprod R"
143 apply (rule lprod_list[where a="y" and b="y" and ah="[z',x]" and at="[]" and bh="[x]" and bt="[z]", simplified])
144 apply (auto simp add: lprod_2_2 assms)
147 lemma lprod_3_3: assumes xr: "(xr, x) \<in> R" shows "([xr, y, z], [x, y, z]) \<in> lprod R"
148 apply (rule lprod_list[where a="y" and b="y" and ah="[xr]" and at="[z]" and bh="[x]" and bt="[z]", simplified])
149 apply (simp add: xr lprod_2_3)
152 lemma lprod_3_4: assumes yr: "(yr, y) \<in> R" shows "([x, yr, z], [x, y, z]) \<in> lprod R"
153 apply (rule lprod_list[where a="x" and b="x" and ah="[]" and at="[yr,z]" and bh="[]" and bt="[y,z]", simplified])
154 apply (simp add: yr lprod_2_3)
157 lemma lprod_3_5: assumes zr: "(zr, z) \<in> R" shows "([x, y, zr], [x, y, z]) \<in> lprod R"
158 apply (rule lprod_list[where a="x" and b="x" and ah="[]" and at="[y,zr]" and bh="[]" and bt="[y,z]", simplified])
159 apply (simp add: zr lprod_2_4)
162 lemma lprod_3_6: assumes y': "(y', y) \<in> R" shows "([x, z, y'], [x, y, z]) \<in> lprod R"
163 apply (rule lprod_list[where a="z" and b="z" and ah="[x]" and at="[y']" and bh="[x,y]" and bt="[]", simplified])
164 apply (simp add: y' lprod_2_4)
167 lemma lprod_3_7: assumes z': "(z',z) \<in> R" shows "([x, z', y], [x, y, z]) \<in> lprod R"
168 apply (rule lprod_list[where a="y" and b="y" and ah="[x, z']" and at="[]" and bh="[x]" and bt="[z]", simplified])
169 apply (simp add: z' lprod_2_4)
172 definition perm :: "('a \<Rightarrow> 'a) \<Rightarrow> 'a set \<Rightarrow> bool" where
173 "perm f A \<equiv> inj_on f A \<and> f ` A = A"
175 lemma "((as,bs) \<in> lprod R) =
176 (\<exists> f. perm f {0 ..< (length as)} \<and>
177 (\<forall> j. j < length as \<longrightarrow> ((nth as j, nth bs (f j)) \<in> R \<or> (nth as j = nth bs (f j)))) \<and>
178 (\<exists> i. i < length as \<and> (nth as i, nth bs (f i)) \<in> R))"
181 lemma "trans R \<Longrightarrow> (ah@a#at, bh@b#bt) \<in> lprod R \<Longrightarrow> (b, a) \<in> R \<or> a = b \<Longrightarrow> (ah@at, bh@bt) \<in> lprod R"