author  nipkow 
Mon, 16 Aug 2004 14:22:27 +0200  
changeset 15131  c69542757a4d 
parent 15096  be1d3b8cfbd5 
child 15140  322485b816ac 
permissions  rwrr 
10213  1 
(* Title: HOL/Transitive_Closure.thy 
2 
ID: $Id$ 

3 
Author: Lawrence C Paulson, Cambridge University Computer Laboratory 

4 
Copyright 1992 University of Cambridge 

5 
*) 

6 

12691  7 
header {* Reflexive and Transitive closure of a relation *} 
8 

15131  9 
theory Transitive_Closure 
10 
import Inductive 

11 
files ("../Provers/trancl.ML") 

12 
begin 

12691  13 

14 
text {* 

15 
@{text rtrancl} is reflexive/transitive closure, 

16 
@{text trancl} is transitive closure, 

17 
@{text reflcl} is reflexive closure. 

18 

19 
These postfix operators have \emph{maximum priority}, forcing their 

20 
operands to be atomic. 

21 
*} 

10213  22 

11327
cd2c27a23df1
Transitive closure is now defined via "inductive".
berghofe
parents:
11115
diff
changeset

23 
consts 
12691  24 
rtrancl :: "('a \<times> 'a) set => ('a \<times> 'a) set" ("(_^*)" [1000] 999) 
11327
cd2c27a23df1
Transitive closure is now defined via "inductive".
berghofe
parents:
11115
diff
changeset

25 

cd2c27a23df1
Transitive closure is now defined via "inductive".
berghofe
parents:
11115
diff
changeset

26 
inductive "r^*" 
12691  27 
intros 
12823  28 
rtrancl_refl [intro!, CPure.intro!, simp]: "(a, a) : r^*" 
29 
rtrancl_into_rtrancl [CPure.intro]: "(a, b) : r^* ==> (b, c) : r ==> (a, c) : r^*" 

11327
cd2c27a23df1
Transitive closure is now defined via "inductive".
berghofe
parents:
11115
diff
changeset

30 

13704
854501b1e957
Transitive closure is now defined inductively as well.
berghofe
parents:
12937
diff
changeset

31 
consts 
12691  32 
trancl :: "('a \<times> 'a) set => ('a \<times> 'a) set" ("(_^+)" [1000] 999) 
13704
854501b1e957
Transitive closure is now defined inductively as well.
berghofe
parents:
12937
diff
changeset

33 

854501b1e957
Transitive closure is now defined inductively as well.
berghofe
parents:
12937
diff
changeset

34 
inductive "r^+" 
854501b1e957
Transitive closure is now defined inductively as well.
berghofe
parents:
12937
diff
changeset

35 
intros 
854501b1e957
Transitive closure is now defined inductively as well.
berghofe
parents:
12937
diff
changeset

36 
r_into_trancl [intro, CPure.intro]: "(a, b) : r ==> (a, b) : r^+" 
854501b1e957
Transitive closure is now defined inductively as well.
berghofe
parents:
12937
diff
changeset

37 
trancl_into_trancl [CPure.intro]: "(a, b) : r^+ ==> (b, c) : r ==> (a,c) : r^+" 
10213  38 

39 
syntax 

12691  40 
"_reflcl" :: "('a \<times> 'a) set => ('a \<times> 'a) set" ("(_^=)" [1000] 999) 
10213  41 
translations 
12691  42 
"r^=" == "r \<union> Id" 
10213  43 

10827  44 
syntax (xsymbols) 
14361
ad2f5da643b4
* Support for raw latex output in control symbols: \<^raw...>
schirmer
parents:
14337
diff
changeset

45 
rtrancl :: "('a \<times> 'a) set => ('a \<times> 'a) set" ("(_\<^sup>*)" [1000] 999) 
ad2f5da643b4
* Support for raw latex output in control symbols: \<^raw...>
schirmer
parents:
14337
diff
changeset

46 
trancl :: "('a \<times> 'a) set => ('a \<times> 'a) set" ("(_\<^sup>+)" [1000] 999) 
ad2f5da643b4
* Support for raw latex output in control symbols: \<^raw...>
schirmer
parents:
14337
diff
changeset

47 
"_reflcl" :: "('a \<times> 'a) set => ('a \<times> 'a) set" ("(_\<^sup>=)" [1000] 999) 
12691  48 

14565  49 
syntax (HTML output) 
50 
rtrancl :: "('a \<times> 'a) set => ('a \<times> 'a) set" ("(_\<^sup>*)" [1000] 999) 

51 
trancl :: "('a \<times> 'a) set => ('a \<times> 'a) set" ("(_\<^sup>+)" [1000] 999) 

52 
"_reflcl" :: "('a \<times> 'a) set => ('a \<times> 'a) set" ("(_\<^sup>=)" [1000] 999) 

53 

12691  54 

55 
subsection {* Reflexivetransitive closure *} 

56 

57 
lemma r_into_rtrancl [intro]: "!!p. p \<in> r ==> p \<in> r^*" 

58 
 {* @{text rtrancl} of @{text r} contains @{text r} *} 

59 
apply (simp only: split_tupled_all) 

60 
apply (erule rtrancl_refl [THEN rtrancl_into_rtrancl]) 

61 
done 

62 

63 
lemma rtrancl_mono: "r \<subseteq> s ==> r^* \<subseteq> s^*" 

64 
 {* monotonicity of @{text rtrancl} *} 

65 
apply (rule subsetI) 

66 
apply (simp only: split_tupled_all) 

67 
apply (erule rtrancl.induct) 

14208  68 
apply (rule_tac [2] rtrancl_into_rtrancl, blast+) 
12691  69 
done 
70 

12823  71 
theorem rtrancl_induct [consumes 1, induct set: rtrancl]: 
12937
0c4fd7529467
clarified syntax of ``long'' statements: fixes/assumes/shows;
wenzelm
parents:
12823
diff
changeset

72 
assumes a: "(a, b) : r^*" 
0c4fd7529467
clarified syntax of ``long'' statements: fixes/assumes/shows;
wenzelm
parents:
12823
diff
changeset

73 
and cases: "P a" "!!y z. [ (a, y) : r^*; (y, z) : r; P y ] ==> P z" 
0c4fd7529467
clarified syntax of ``long'' statements: fixes/assumes/shows;
wenzelm
parents:
12823
diff
changeset

74 
shows "P b" 
12691  75 
proof  
76 
from a have "a = a > P b" 

12823  77 
by (induct "%x y. x = a > P y" a b) (rules intro: cases)+ 
12691  78 
thus ?thesis by rules 
79 
qed 

80 

14404
4952c5a92e04
Transitive_Closure: added consumes and case_names attributes
nipkow
parents:
14398
diff
changeset

81 
lemmas rtrancl_induct2 = 
4952c5a92e04
Transitive_Closure: added consumes and case_names attributes
nipkow
parents:
14398
diff
changeset

82 
rtrancl_induct[of "(ax,ay)" "(bx,by)", split_format (complete), 
4952c5a92e04
Transitive_Closure: added consumes and case_names attributes
nipkow
parents:
14398
diff
changeset

83 
consumes 1, case_names refl step] 
4952c5a92e04
Transitive_Closure: added consumes and case_names attributes
nipkow
parents:
14398
diff
changeset

84 

12691  85 
lemma trans_rtrancl: "trans(r^*)" 
86 
 {* transitivity of transitive closure!!  by induction *} 

12823  87 
proof (rule transI) 
88 
fix x y z 

89 
assume "(x, y) \<in> r\<^sup>*" 

90 
assume "(y, z) \<in> r\<^sup>*" 

91 
thus "(x, z) \<in> r\<^sup>*" by induct (rules!)+ 

92 
qed 

12691  93 

94 
lemmas rtrancl_trans = trans_rtrancl [THEN transD, standard] 

95 

96 
lemma rtranclE: 

97 
"[ (a::'a,b) : r^*; (a = b) ==> P; 

98 
!!y.[ (a,y) : r^*; (y,b) : r ] ==> P 

99 
] ==> P" 

100 
 {* elimination of @{text rtrancl}  by induction on a special formula *} 

101 
proof  

102 
assume major: "(a::'a,b) : r^*" 

103 
case rule_context 

104 
show ?thesis 

105 
apply (subgoal_tac "(a::'a) = b  (EX y. (a,y) : r^* & (y,b) : r)") 

106 
apply (rule_tac [2] major [THEN rtrancl_induct]) 

107 
prefer 2 apply (blast!) 

108 
prefer 2 apply (blast!) 

109 
apply (erule asm_rl exE disjE conjE prems)+ 

110 
done 

111 
qed 

112 

12823  113 
lemma converse_rtrancl_into_rtrancl: 
114 
"(a, b) \<in> r \<Longrightarrow> (b, c) \<in> r\<^sup>* \<Longrightarrow> (a, c) \<in> r\<^sup>*" 

115 
by (rule rtrancl_trans) rules+ 

12691  116 

117 
text {* 

118 
\medskip More @{term "r^*"} equations and inclusions. 

119 
*} 

120 

121 
lemma rtrancl_idemp [simp]: "(r^*)^* = r^*" 

122 
apply auto 

123 
apply (erule rtrancl_induct) 

124 
apply (rule rtrancl_refl) 

125 
apply (blast intro: rtrancl_trans) 

126 
done 

127 

128 
lemma rtrancl_idemp_self_comp [simp]: "R^* O R^* = R^*" 

129 
apply (rule set_ext) 

130 
apply (simp only: split_tupled_all) 

131 
apply (blast intro: rtrancl_trans) 

132 
done 

133 

134 
lemma rtrancl_subset_rtrancl: "r \<subseteq> s^* ==> r^* \<subseteq> s^*" 

14208  135 
by (drule rtrancl_mono, simp) 
12691  136 

137 
lemma rtrancl_subset: "R \<subseteq> S ==> S \<subseteq> R^* ==> S^* = R^*" 

138 
apply (drule rtrancl_mono) 

14398
c5c47703f763
Efficient, graphbased reasoner for linear and partial orders.
ballarin
parents:
14361
diff
changeset

139 
apply (drule rtrancl_mono, simp) 
12691  140 
done 
141 

142 
lemma rtrancl_Un_rtrancl: "(R^* \<union> S^*)^* = (R \<union> S)^*" 

143 
by (blast intro!: rtrancl_subset intro: r_into_rtrancl rtrancl_mono [THEN subsetD]) 

144 

145 
lemma rtrancl_reflcl [simp]: "(R^=)^* = R^*" 

146 
by (blast intro!: rtrancl_subset intro: r_into_rtrancl) 

147 

148 
lemma rtrancl_r_diff_Id: "(r  Id)^* = r^*" 

149 
apply (rule sym) 

14208  150 
apply (rule rtrancl_subset, blast, clarify) 
12691  151 
apply (rename_tac a b) 
14208  152 
apply (case_tac "a = b", blast) 
12691  153 
apply (blast intro!: r_into_rtrancl) 
154 
done 

155 

12823  156 
theorem rtrancl_converseD: 
12937
0c4fd7529467
clarified syntax of ``long'' statements: fixes/assumes/shows;
wenzelm
parents:
12823
diff
changeset

157 
assumes r: "(x, y) \<in> (r^1)^*" 
0c4fd7529467
clarified syntax of ``long'' statements: fixes/assumes/shows;
wenzelm
parents:
12823
diff
changeset

158 
shows "(y, x) \<in> r^*" 
12823  159 
proof  
160 
from r show ?thesis 

161 
by induct (rules intro: rtrancl_trans dest!: converseD)+ 

162 
qed 

12691  163 

12823  164 
theorem rtrancl_converseI: 
12937
0c4fd7529467
clarified syntax of ``long'' statements: fixes/assumes/shows;
wenzelm
parents:
12823
diff
changeset

165 
assumes r: "(y, x) \<in> r^*" 
0c4fd7529467
clarified syntax of ``long'' statements: fixes/assumes/shows;
wenzelm
parents:
12823
diff
changeset

166 
shows "(x, y) \<in> (r^1)^*" 
12823  167 
proof  
168 
from r show ?thesis 

169 
by induct (rules intro: rtrancl_trans converseI)+ 

170 
qed 

12691  171 

172 
lemma rtrancl_converse: "(r^1)^* = (r^*)^1" 

173 
by (fast dest!: rtrancl_converseD intro!: rtrancl_converseI) 

174 

14404
4952c5a92e04
Transitive_Closure: added consumes and case_names attributes
nipkow
parents:
14398
diff
changeset

175 
theorem converse_rtrancl_induct[consumes 1]: 
12937
0c4fd7529467
clarified syntax of ``long'' statements: fixes/assumes/shows;
wenzelm
parents:
12823
diff
changeset

176 
assumes major: "(a, b) : r^*" 
0c4fd7529467
clarified syntax of ``long'' statements: fixes/assumes/shows;
wenzelm
parents:
12823
diff
changeset

177 
and cases: "P b" "!!y z. [ (y, z) : r; (z, b) : r^*; P z ] ==> P y" 
0c4fd7529467
clarified syntax of ``long'' statements: fixes/assumes/shows;
wenzelm
parents:
12823
diff
changeset

178 
shows "P a" 
12691  179 
proof  
12823  180 
from rtrancl_converseI [OF major] 
12691  181 
show ?thesis 
12823  182 
by induct (rules intro: cases dest!: converseD rtrancl_converseD)+ 
12691  183 
qed 
184 

14404
4952c5a92e04
Transitive_Closure: added consumes and case_names attributes
nipkow
parents:
14398
diff
changeset

185 
lemmas converse_rtrancl_induct2 = 
4952c5a92e04
Transitive_Closure: added consumes and case_names attributes
nipkow
parents:
14398
diff
changeset

186 
converse_rtrancl_induct[of "(ax,ay)" "(bx,by)", split_format (complete), 
4952c5a92e04
Transitive_Closure: added consumes and case_names attributes
nipkow
parents:
14398
diff
changeset

187 
consumes 1, case_names refl step] 
12691  188 

189 
lemma converse_rtranclE: 

190 
"[ (x,z):r^*; 

191 
x=z ==> P; 

192 
!!y. [ (x,y):r; (y,z):r^* ] ==> P 

193 
] ==> P" 

194 
proof  

195 
assume major: "(x,z):r^*" 

196 
case rule_context 

197 
show ?thesis 

198 
apply (subgoal_tac "x = z  (EX y. (x,y) : r & (y,z) : r^*)") 

199 
apply (rule_tac [2] major [THEN converse_rtrancl_induct]) 

13726  200 
prefer 2 apply rules 
201 
prefer 2 apply rules 

12691  202 
apply (erule asm_rl exE disjE conjE prems)+ 
203 
done 

204 
qed 

205 

206 
ML_setup {* 

207 
bind_thm ("converse_rtranclE2", split_rule 

208 
(read_instantiate [("x","(xa,xb)"), ("z","(za,zb)")] (thm "converse_rtranclE"))); 

209 
*} 

210 

211 
lemma r_comp_rtrancl_eq: "r O r^* = r^* O r" 

212 
by (blast elim: rtranclE converse_rtranclE 

213 
intro: rtrancl_into_rtrancl converse_rtrancl_into_rtrancl) 

214 

215 

216 
subsection {* Transitive closure *} 

10331  217 

13704
854501b1e957
Transitive closure is now defined inductively as well.
berghofe
parents:
12937
diff
changeset

218 
lemma trancl_mono: "!!p. p \<in> r^+ ==> r \<subseteq> s ==> p \<in> s^+" 
854501b1e957
Transitive closure is now defined inductively as well.
berghofe
parents:
12937
diff
changeset

219 
apply (simp only: split_tupled_all) 
854501b1e957
Transitive closure is now defined inductively as well.
berghofe
parents:
12937
diff
changeset

220 
apply (erule trancl.induct) 
854501b1e957
Transitive closure is now defined inductively as well.
berghofe
parents:
12937
diff
changeset

221 
apply (rules dest: subsetD)+ 
12691  222 
done 
223 

13704
854501b1e957
Transitive closure is now defined inductively as well.
berghofe
parents:
12937
diff
changeset

224 
lemma r_into_trancl': "!!p. p : r ==> p : r^+" 
854501b1e957
Transitive closure is now defined inductively as well.
berghofe
parents:
12937
diff
changeset

225 
by (simp only: split_tupled_all) (erule r_into_trancl) 
854501b1e957
Transitive closure is now defined inductively as well.
berghofe
parents:
12937
diff
changeset

226 

12691  227 
text {* 
228 
\medskip Conversions between @{text trancl} and @{text rtrancl}. 

229 
*} 

230 

13704
854501b1e957
Transitive closure is now defined inductively as well.
berghofe
parents:
12937
diff
changeset

231 
lemma trancl_into_rtrancl: "(a, b) \<in> r^+ ==> (a, b) \<in> r^*" 
854501b1e957
Transitive closure is now defined inductively as well.
berghofe
parents:
12937
diff
changeset

232 
by (erule trancl.induct) rules+ 
12691  233 

13704
854501b1e957
Transitive closure is now defined inductively as well.
berghofe
parents:
12937
diff
changeset

234 
lemma rtrancl_into_trancl1: assumes r: "(a, b) \<in> r^*" 
854501b1e957
Transitive closure is now defined inductively as well.
berghofe
parents:
12937
diff
changeset

235 
shows "!!c. (b, c) \<in> r ==> (a, c) \<in> r^+" using r 
854501b1e957
Transitive closure is now defined inductively as well.
berghofe
parents:
12937
diff
changeset

236 
by induct rules+ 
12691  237 

238 
lemma rtrancl_into_trancl2: "[ (a,b) : r; (b,c) : r^* ] ==> (a,c) : r^+" 

239 
 {* intro rule from @{text r} and @{text rtrancl} *} 

14208  240 
apply (erule rtranclE, rules) 
12691  241 
apply (rule rtrancl_trans [THEN rtrancl_into_trancl1]) 
242 
apply (assumption  rule r_into_rtrancl)+ 

243 
done 

244 

13704
854501b1e957
Transitive closure is now defined inductively as well.
berghofe
parents:
12937
diff
changeset

245 
lemma trancl_induct [consumes 1, induct set: trancl]: 
854501b1e957
Transitive closure is now defined inductively as well.
berghofe
parents:
12937
diff
changeset

246 
assumes a: "(a,b) : r^+" 
854501b1e957
Transitive closure is now defined inductively as well.
berghofe
parents:
12937
diff
changeset

247 
and cases: "!!y. (a, y) : r ==> P y" 
854501b1e957
Transitive closure is now defined inductively as well.
berghofe
parents:
12937
diff
changeset

248 
"!!y z. (a,y) : r^+ ==> (y, z) : r ==> P y ==> P z" 
854501b1e957
Transitive closure is now defined inductively as well.
berghofe
parents:
12937
diff
changeset

249 
shows "P b" 
12691  250 
 {* Nice induction rule for @{text trancl} *} 
251 
proof  

13704
854501b1e957
Transitive closure is now defined inductively as well.
berghofe
parents:
12937
diff
changeset

252 
from a have "a = a > P b" 
854501b1e957
Transitive closure is now defined inductively as well.
berghofe
parents:
12937
diff
changeset

253 
by (induct "%x y. x = a > P y" a b) (rules intro: cases)+ 
854501b1e957
Transitive closure is now defined inductively as well.
berghofe
parents:
12937
diff
changeset

254 
thus ?thesis by rules 
12691  255 
qed 
256 

257 
lemma trancl_trans_induct: 

258 
"[ (x,y) : r^+; 

259 
!!x y. (x,y) : r ==> P x y; 

260 
!!x y z. [ (x,y) : r^+; P x y; (y,z) : r^+; P y z ] ==> P x z 

261 
] ==> P x y" 

262 
 {* Another induction rule for trancl, incorporating transitivity *} 

263 
proof  

264 
assume major: "(x,y) : r^+" 

265 
case rule_context 

266 
show ?thesis 

13704
854501b1e957
Transitive closure is now defined inductively as well.
berghofe
parents:
12937
diff
changeset

267 
by (rules intro: r_into_trancl major [THEN trancl_induct] prems) 
12691  268 
qed 
269 

13704
854501b1e957
Transitive closure is now defined inductively as well.
berghofe
parents:
12937
diff
changeset

270 
inductive_cases tranclE: "(a, b) : r^+" 
10980  271 

12691  272 
lemma trans_trancl: "trans(r^+)" 
273 
 {* Transitivity of @{term "r^+"} *} 

13704
854501b1e957
Transitive closure is now defined inductively as well.
berghofe
parents:
12937
diff
changeset

274 
proof (rule transI) 
854501b1e957
Transitive closure is now defined inductively as well.
berghofe
parents:
12937
diff
changeset

275 
fix x y z 
854501b1e957
Transitive closure is now defined inductively as well.
berghofe
parents:
12937
diff
changeset

276 
assume "(x, y) \<in> r^+" 
854501b1e957
Transitive closure is now defined inductively as well.
berghofe
parents:
12937
diff
changeset

277 
assume "(y, z) \<in> r^+" 
854501b1e957
Transitive closure is now defined inductively as well.
berghofe
parents:
12937
diff
changeset

278 
thus "(x, z) \<in> r^+" by induct (rules!)+ 
854501b1e957
Transitive closure is now defined inductively as well.
berghofe
parents:
12937
diff
changeset

279 
qed 
12691  280 

281 
lemmas trancl_trans = trans_trancl [THEN transD, standard] 

282 

13704
854501b1e957
Transitive closure is now defined inductively as well.
berghofe
parents:
12937
diff
changeset

283 
lemma rtrancl_trancl_trancl: assumes r: "(x, y) \<in> r^*" 
854501b1e957
Transitive closure is now defined inductively as well.
berghofe
parents:
12937
diff
changeset

284 
shows "!!z. (y, z) \<in> r^+ ==> (x, z) \<in> r^+" using r 
854501b1e957
Transitive closure is now defined inductively as well.
berghofe
parents:
12937
diff
changeset

285 
by induct (rules intro: trancl_trans)+ 
12691  286 

287 
lemma trancl_into_trancl2: "(a, b) \<in> r ==> (b, c) \<in> r^+ ==> (a, c) \<in> r^+" 

288 
by (erule transD [OF trans_trancl r_into_trancl]) 

289 

290 
lemma trancl_insert: 

291 
"(insert (y, x) r)^+ = r^+ \<union> {(a, b). (a, y) \<in> r^* \<and> (x, b) \<in> r^*}" 

292 
 {* primitive recursion for @{text trancl} over finite relations *} 

293 
apply (rule equalityI) 

294 
apply (rule subsetI) 

295 
apply (simp only: split_tupled_all) 

14208  296 
apply (erule trancl_induct, blast) 
12691  297 
apply (blast intro: rtrancl_into_trancl1 trancl_into_rtrancl r_into_trancl trancl_trans) 
298 
apply (rule subsetI) 

299 
apply (blast intro: trancl_mono rtrancl_mono 

300 
[THEN [2] rev_subsetD] rtrancl_trancl_trancl rtrancl_into_trancl2) 

301 
done 

302 

13704
854501b1e957
Transitive closure is now defined inductively as well.
berghofe
parents:
12937
diff
changeset

303 
lemma trancl_converseI: "(x, y) \<in> (r^+)^1 ==> (x, y) \<in> (r^1)^+" 
854501b1e957
Transitive closure is now defined inductively as well.
berghofe
parents:
12937
diff
changeset

304 
apply (drule converseD) 
854501b1e957
Transitive closure is now defined inductively as well.
berghofe
parents:
12937
diff
changeset

305 
apply (erule trancl.induct) 
854501b1e957
Transitive closure is now defined inductively as well.
berghofe
parents:
12937
diff
changeset

306 
apply (rules intro: converseI trancl_trans)+ 
12691  307 
done 
308 

13704
854501b1e957
Transitive closure is now defined inductively as well.
berghofe
parents:
12937
diff
changeset

309 
lemma trancl_converseD: "(x, y) \<in> (r^1)^+ ==> (x, y) \<in> (r^+)^1" 
854501b1e957
Transitive closure is now defined inductively as well.
berghofe
parents:
12937
diff
changeset

310 
apply (rule converseI) 
854501b1e957
Transitive closure is now defined inductively as well.
berghofe
parents:
12937
diff
changeset

311 
apply (erule trancl.induct) 
854501b1e957
Transitive closure is now defined inductively as well.
berghofe
parents:
12937
diff
changeset

312 
apply (rules dest: converseD intro: trancl_trans)+ 
854501b1e957
Transitive closure is now defined inductively as well.
berghofe
parents:
12937
diff
changeset

313 
done 
12691  314 

13704
854501b1e957
Transitive closure is now defined inductively as well.
berghofe
parents:
12937
diff
changeset

315 
lemma trancl_converse: "(r^1)^+ = (r^+)^1" 
854501b1e957
Transitive closure is now defined inductively as well.
berghofe
parents:
12937
diff
changeset

316 
by (fastsimp simp add: split_tupled_all 
854501b1e957
Transitive closure is now defined inductively as well.
berghofe
parents:
12937
diff
changeset

317 
intro!: trancl_converseI trancl_converseD) 
12691  318 

319 
lemma converse_trancl_induct: 

320 
"[ (a,b) : r^+; !!y. (y,b) : r ==> P(y); 

321 
!!y z.[ (y,z) : r; (z,b) : r^+; P(z) ] ==> P(y) ] 

322 
==> P(a)" 

323 
proof  

324 
assume major: "(a,b) : r^+" 

325 
case rule_context 

326 
show ?thesis 

327 
apply (rule major [THEN converseI, THEN trancl_converseI [THEN trancl_induct]]) 

328 
apply (rule prems) 

329 
apply (erule converseD) 

330 
apply (blast intro: prems dest!: trancl_converseD) 

331 
done 

332 
qed 

333 

334 
lemma tranclD: "(x, y) \<in> R^+ ==> EX z. (x, z) \<in> R \<and> (z, y) \<in> R^*" 

14208  335 
apply (erule converse_trancl_induct, auto) 
12691  336 
apply (blast intro: rtrancl_trans) 
337 
done 

338 

13867  339 
lemma irrefl_tranclI: "r^1 \<inter> r^* = {} ==> (x, x) \<notin> r^+" 
340 
by(blast elim: tranclE dest: trancl_into_rtrancl) 

12691  341 

342 
lemma irrefl_trancl_rD: "!!X. ALL x. (x, x) \<notin> r^+ ==> (x, y) \<in> r ==> x \<noteq> y" 

343 
by (blast dest: r_into_trancl) 

344 

345 
lemma trancl_subset_Sigma_aux: 

346 
"(a, b) \<in> r^* ==> r \<subseteq> A \<times> A ==> a = b \<or> a \<in> A" 

14208  347 
apply (erule rtrancl_induct, auto) 
12691  348 
done 
349 

350 
lemma trancl_subset_Sigma: "r \<subseteq> A \<times> A ==> r^+ \<subseteq> A \<times> A" 

13704
854501b1e957
Transitive closure is now defined inductively as well.
berghofe
parents:
12937
diff
changeset

351 
apply (rule subsetI) 
854501b1e957
Transitive closure is now defined inductively as well.
berghofe
parents:
12937
diff
changeset

352 
apply (simp only: split_tupled_all) 
854501b1e957
Transitive closure is now defined inductively as well.
berghofe
parents:
12937
diff
changeset

353 
apply (erule tranclE) 
854501b1e957
Transitive closure is now defined inductively as well.
berghofe
parents:
12937
diff
changeset

354 
apply (blast dest!: trancl_into_rtrancl trancl_subset_Sigma_aux)+ 
12691  355 
done 
10996
74e970389def
Moved some thms from Transitive_ClosureTr.ML to Transitive_Closure.thy
nipkow
parents:
10980
diff
changeset

356 

11090  357 
lemma reflcl_trancl [simp]: "(r^+)^= = r^*" 
11084  358 
apply safe 
12691  359 
apply (erule trancl_into_rtrancl) 
11084  360 
apply (blast elim: rtranclE dest: rtrancl_into_trancl1) 
361 
done 

10996
74e970389def
Moved some thms from Transitive_ClosureTr.ML to Transitive_Closure.thy
nipkow
parents:
10980
diff
changeset

362 

11090  363 
lemma trancl_reflcl [simp]: "(r^=)^+ = r^*" 
11084  364 
apply safe 
14208  365 
apply (drule trancl_into_rtrancl, simp) 
366 
apply (erule rtranclE, safe) 

367 
apply (rule r_into_trancl, simp) 

11084  368 
apply (rule rtrancl_into_trancl1) 
14208  369 
apply (erule rtrancl_reflcl [THEN equalityD2, THEN subsetD], fast) 
11084  370 
done 
10996
74e970389def
Moved some thms from Transitive_ClosureTr.ML to Transitive_Closure.thy
nipkow
parents:
10980
diff
changeset

371 

11090  372 
lemma trancl_empty [simp]: "{}^+ = {}" 
11084  373 
by (auto elim: trancl_induct) 
10996
74e970389def
Moved some thms from Transitive_ClosureTr.ML to Transitive_Closure.thy
nipkow
parents:
10980
diff
changeset

374 

11090  375 
lemma rtrancl_empty [simp]: "{}^* = Id" 
11084  376 
by (rule subst [OF reflcl_trancl]) simp 
10996
74e970389def
Moved some thms from Transitive_ClosureTr.ML to Transitive_Closure.thy
nipkow
parents:
10980
diff
changeset

377 

11090  378 
lemma rtranclD: "(a, b) \<in> R^* ==> a = b \<or> a \<noteq> b \<and> (a, b) \<in> R^+" 
11084  379 
by (force simp add: reflcl_trancl [symmetric] simp del: reflcl_trancl) 
380 

10996
74e970389def
Moved some thms from Transitive_ClosureTr.ML to Transitive_Closure.thy
nipkow
parents:
10980
diff
changeset

381 

12691  382 
text {* @{text Domain} and @{text Range} *} 
10996
74e970389def
Moved some thms from Transitive_ClosureTr.ML to Transitive_Closure.thy
nipkow
parents:
10980
diff
changeset

383 

11090  384 
lemma Domain_rtrancl [simp]: "Domain (R^*) = UNIV" 
11084  385 
by blast 
10996
74e970389def
Moved some thms from Transitive_ClosureTr.ML to Transitive_Closure.thy
nipkow
parents:
10980
diff
changeset

386 

11090  387 
lemma Range_rtrancl [simp]: "Range (R^*) = UNIV" 
11084  388 
by blast 
10996
74e970389def
Moved some thms from Transitive_ClosureTr.ML to Transitive_Closure.thy
nipkow
parents:
10980
diff
changeset

389 

11090  390 
lemma rtrancl_Un_subset: "(R^* \<union> S^*) \<subseteq> (R Un S)^*" 
11084  391 
by (rule rtrancl_Un_rtrancl [THEN subst]) fast 
10996
74e970389def
Moved some thms from Transitive_ClosureTr.ML to Transitive_Closure.thy
nipkow
parents:
10980
diff
changeset

392 

11090  393 
lemma in_rtrancl_UnI: "x \<in> R^* \<or> x \<in> S^* ==> x \<in> (R \<union> S)^*" 
11084  394 
by (blast intro: subsetD [OF rtrancl_Un_subset]) 
10996
74e970389def
Moved some thms from Transitive_ClosureTr.ML to Transitive_Closure.thy
nipkow
parents:
10980
diff
changeset

395 

11090  396 
lemma trancl_domain [simp]: "Domain (r^+) = Domain r" 
11084  397 
by (unfold Domain_def) (blast dest: tranclD) 
10996
74e970389def
Moved some thms from Transitive_ClosureTr.ML to Transitive_Closure.thy
nipkow
parents:
10980
diff
changeset

398 

11090  399 
lemma trancl_range [simp]: "Range (r^+) = Range r" 
11084  400 
by (simp add: Range_def trancl_converse [symmetric]) 
10996
74e970389def
Moved some thms from Transitive_ClosureTr.ML to Transitive_Closure.thy
nipkow
parents:
10980
diff
changeset

401 

11115  402 
lemma Not_Domain_rtrancl: 
12691  403 
"x ~: Domain R ==> ((x, y) : R^*) = (x = y)" 
404 
apply auto 

405 
by (erule rev_mp, erule rtrancl_induct, auto) 

406 

11327
cd2c27a23df1
Transitive closure is now defined via "inductive".
berghofe
parents:
11115
diff
changeset

407 

12691  408 
text {* More about converse @{text rtrancl} and @{text trancl}, should 
409 
be merged with main body. *} 

12428
f3033eed309a
setup [trans] rules for calculational Isar reasoning
kleing
parents:
11327
diff
changeset

410 

14337
e13731554e50
undid split_comp_eq[simp] because it leads to nontermination together with split_def!
nipkow
parents:
14208
diff
changeset

411 
lemma single_valued_confluent: 
e13731554e50
undid split_comp_eq[simp] because it leads to nontermination together with split_def!
nipkow
parents:
14208
diff
changeset

412 
"\<lbrakk> single_valued r; (x,y) \<in> r^*; (x,z) \<in> r^* \<rbrakk> 
e13731554e50
undid split_comp_eq[simp] because it leads to nontermination together with split_def!
nipkow
parents:
14208
diff
changeset

413 
\<Longrightarrow> (y,z) \<in> r^* \<or> (z,y) \<in> r^*" 
e13731554e50
undid split_comp_eq[simp] because it leads to nontermination together with split_def!
nipkow
parents:
14208
diff
changeset

414 
apply(erule rtrancl_induct) 
e13731554e50
undid split_comp_eq[simp] because it leads to nontermination together with split_def!
nipkow
parents:
14208
diff
changeset

415 
apply simp 
e13731554e50
undid split_comp_eq[simp] because it leads to nontermination together with split_def!
nipkow
parents:
14208
diff
changeset

416 
apply(erule disjE) 
e13731554e50
undid split_comp_eq[simp] because it leads to nontermination together with split_def!
nipkow
parents:
14208
diff
changeset

417 
apply(blast elim:converse_rtranclE dest:single_valuedD) 
e13731554e50
undid split_comp_eq[simp] because it leads to nontermination together with split_def!
nipkow
parents:
14208
diff
changeset

418 
apply(blast intro:rtrancl_trans) 
e13731554e50
undid split_comp_eq[simp] because it leads to nontermination together with split_def!
nipkow
parents:
14208
diff
changeset

419 
done 
e13731554e50
undid split_comp_eq[simp] because it leads to nontermination together with split_def!
nipkow
parents:
14208
diff
changeset

420 

12691  421 
lemma r_r_into_trancl: "(a, b) \<in> R ==> (b, c) \<in> R ==> (a, c) \<in> R^+" 
12428
f3033eed309a
setup [trans] rules for calculational Isar reasoning
kleing
parents:
11327
diff
changeset

422 
by (fast intro: trancl_trans) 
f3033eed309a
setup [trans] rules for calculational Isar reasoning
kleing
parents:
11327
diff
changeset

423 

f3033eed309a
setup [trans] rules for calculational Isar reasoning
kleing
parents:
11327
diff
changeset

424 
lemma trancl_into_trancl [rule_format]: 
12691  425 
"(a, b) \<in> r\<^sup>+ ==> (b, c) \<in> r > (a,c) \<in> r\<^sup>+" 
426 
apply (erule trancl_induct) 

12428
f3033eed309a
setup [trans] rules for calculational Isar reasoning
kleing
parents:
11327
diff
changeset

427 
apply (fast intro: r_r_into_trancl) 
f3033eed309a
setup [trans] rules for calculational Isar reasoning
kleing
parents:
11327
diff
changeset

428 
apply (fast intro: r_r_into_trancl trancl_trans) 
f3033eed309a
setup [trans] rules for calculational Isar reasoning
kleing
parents:
11327
diff
changeset

429 
done 
f3033eed309a
setup [trans] rules for calculational Isar reasoning
kleing
parents:
11327
diff
changeset

430 

f3033eed309a
setup [trans] rules for calculational Isar reasoning
kleing
parents:
11327
diff
changeset

431 
lemma trancl_rtrancl_trancl: 
12691  432 
"(a, b) \<in> r\<^sup>+ ==> (b, c) \<in> r\<^sup>* ==> (a, c) \<in> r\<^sup>+" 
12428
f3033eed309a
setup [trans] rules for calculational Isar reasoning
kleing
parents:
11327
diff
changeset

433 
apply (drule tranclD) 
f3033eed309a
setup [trans] rules for calculational Isar reasoning
kleing
parents:
11327
diff
changeset

434 
apply (erule exE, erule conjE) 
f3033eed309a
setup [trans] rules for calculational Isar reasoning
kleing
parents:
11327
diff
changeset

435 
apply (drule rtrancl_trans, assumption) 
14208  436 
apply (drule rtrancl_into_trancl2, assumption, assumption) 
12428
f3033eed309a
setup [trans] rules for calculational Isar reasoning
kleing
parents:
11327
diff
changeset

437 
done 
f3033eed309a
setup [trans] rules for calculational Isar reasoning
kleing
parents:
11327
diff
changeset

438 

12691  439 
lemmas transitive_closure_trans [trans] = 
440 
r_r_into_trancl trancl_trans rtrancl_trans 

441 
trancl_into_trancl trancl_into_trancl2 

442 
rtrancl_into_rtrancl converse_rtrancl_into_rtrancl 

443 
rtrancl_trancl_trancl trancl_rtrancl_trancl 

12428
f3033eed309a
setup [trans] rules for calculational Isar reasoning
kleing
parents:
11327
diff
changeset

444 

f3033eed309a
setup [trans] rules for calculational Isar reasoning
kleing
parents:
11327
diff
changeset

445 
declare trancl_into_rtrancl [elim] 
11327
cd2c27a23df1
Transitive closure is now defined via "inductive".
berghofe
parents:
11115
diff
changeset

446 

cd2c27a23df1
Transitive closure is now defined via "inductive".
berghofe
parents:
11115
diff
changeset

447 
declare rtranclE [cases set: rtrancl] 
cd2c27a23df1
Transitive closure is now defined via "inductive".
berghofe
parents:
11115
diff
changeset

448 
declare tranclE [cases set: trancl] 
cd2c27a23df1
Transitive closure is now defined via "inductive".
berghofe
parents:
11115
diff
changeset

449 

15076
4b3d280ef06a
New prover for transitive and reflexivetransitive closure of relations.
ballarin
parents:
14565
diff
changeset

450 
subsection {* Setup of transitivity reasoner *} 
4b3d280ef06a
New prover for transitive and reflexivetransitive closure of relations.
ballarin
parents:
14565
diff
changeset

451 

4b3d280ef06a
New prover for transitive and reflexivetransitive closure of relations.
ballarin
parents:
14565
diff
changeset

452 
use "../Provers/trancl.ML"; 
4b3d280ef06a
New prover for transitive and reflexivetransitive closure of relations.
ballarin
parents:
14565
diff
changeset

453 

4b3d280ef06a
New prover for transitive and reflexivetransitive closure of relations.
ballarin
parents:
14565
diff
changeset

454 
ML_setup {* 
4b3d280ef06a
New prover for transitive and reflexivetransitive closure of relations.
ballarin
parents:
14565
diff
changeset

455 

4b3d280ef06a
New prover for transitive and reflexivetransitive closure of relations.
ballarin
parents:
14565
diff
changeset

456 
structure Trancl_Tac = Trancl_Tac_Fun ( 
4b3d280ef06a
New prover for transitive and reflexivetransitive closure of relations.
ballarin
parents:
14565
diff
changeset

457 
struct 
4b3d280ef06a
New prover for transitive and reflexivetransitive closure of relations.
ballarin
parents:
14565
diff
changeset

458 
val r_into_trancl = thm "r_into_trancl"; 
4b3d280ef06a
New prover for transitive and reflexivetransitive closure of relations.
ballarin
parents:
14565
diff
changeset

459 
val trancl_trans = thm "trancl_trans"; 
4b3d280ef06a
New prover for transitive and reflexivetransitive closure of relations.
ballarin
parents:
14565
diff
changeset

460 
val rtrancl_refl = thm "rtrancl_refl"; 
4b3d280ef06a
New prover for transitive and reflexivetransitive closure of relations.
ballarin
parents:
14565
diff
changeset

461 
val r_into_rtrancl = thm "r_into_rtrancl"; 
4b3d280ef06a
New prover for transitive and reflexivetransitive closure of relations.
ballarin
parents:
14565
diff
changeset

462 
val trancl_into_rtrancl = thm "trancl_into_rtrancl"; 
4b3d280ef06a
New prover for transitive and reflexivetransitive closure of relations.
ballarin
parents:
14565
diff
changeset

463 
val rtrancl_trancl_trancl = thm "rtrancl_trancl_trancl"; 
4b3d280ef06a
New prover for transitive and reflexivetransitive closure of relations.
ballarin
parents:
14565
diff
changeset

464 
val trancl_rtrancl_trancl = thm "trancl_rtrancl_trancl"; 
4b3d280ef06a
New prover for transitive and reflexivetransitive closure of relations.
ballarin
parents:
14565
diff
changeset

465 
val rtrancl_trans = thm "rtrancl_trans"; 
15096  466 

15076
4b3d280ef06a
New prover for transitive and reflexivetransitive closure of relations.
ballarin
parents:
14565
diff
changeset

467 
fun decomp (Trueprop $ t) = 
4b3d280ef06a
New prover for transitive and reflexivetransitive closure of relations.
ballarin
parents:
14565
diff
changeset

468 
let fun dec (Const ("op :", _) $ (Const ("Pair", _) $ a $ b) $ rel ) = 
4b3d280ef06a
New prover for transitive and reflexivetransitive closure of relations.
ballarin
parents:
14565
diff
changeset

469 
let fun decr (Const ("Transitive_Closure.rtrancl", _ ) $ r) = (r,"r*") 
4b3d280ef06a
New prover for transitive and reflexivetransitive closure of relations.
ballarin
parents:
14565
diff
changeset

470 
 decr (Const ("Transitive_Closure.trancl", _ ) $ r) = (r,"r+") 
4b3d280ef06a
New prover for transitive and reflexivetransitive closure of relations.
ballarin
parents:
14565
diff
changeset

471 
 decr r = (r,"r"); 
4b3d280ef06a
New prover for transitive and reflexivetransitive closure of relations.
ballarin
parents:
14565
diff
changeset

472 
val (rel,r) = decr rel; 
4b3d280ef06a
New prover for transitive and reflexivetransitive closure of relations.
ballarin
parents:
14565
diff
changeset

473 
in Some (a,b,rel,r) end 
4b3d280ef06a
New prover for transitive and reflexivetransitive closure of relations.
ballarin
parents:
14565
diff
changeset

474 
 dec _ = None 
4b3d280ef06a
New prover for transitive and reflexivetransitive closure of relations.
ballarin
parents:
14565
diff
changeset

475 
in dec t end; 
4b3d280ef06a
New prover for transitive and reflexivetransitive closure of relations.
ballarin
parents:
14565
diff
changeset

476 

4b3d280ef06a
New prover for transitive and reflexivetransitive closure of relations.
ballarin
parents:
14565
diff
changeset

477 
end); (* struct *) 
4b3d280ef06a
New prover for transitive and reflexivetransitive closure of relations.
ballarin
parents:
14565
diff
changeset

478 

4b3d280ef06a
New prover for transitive and reflexivetransitive closure of relations.
ballarin
parents:
14565
diff
changeset

479 
simpset_ref() := simpset () 
4b3d280ef06a
New prover for transitive and reflexivetransitive closure of relations.
ballarin
parents:
14565
diff
changeset

480 
addSolver (mk_solver "Trancl" (fn _ => Trancl_Tac.trancl_tac)) 
4b3d280ef06a
New prover for transitive and reflexivetransitive closure of relations.
ballarin
parents:
14565
diff
changeset

481 
addSolver (mk_solver "Rtrancl" (fn _ => Trancl_Tac.rtrancl_tac)); 
4b3d280ef06a
New prover for transitive and reflexivetransitive closure of relations.
ballarin
parents:
14565
diff
changeset

482 

4b3d280ef06a
New prover for transitive and reflexivetransitive closure of relations.
ballarin
parents:
14565
diff
changeset

483 
*} 
4b3d280ef06a
New prover for transitive and reflexivetransitive closure of relations.
ballarin
parents:
14565
diff
changeset

484 

4b3d280ef06a
New prover for transitive and reflexivetransitive closure of relations.
ballarin
parents:
14565
diff
changeset

485 
(* Optional methods 
4b3d280ef06a
New prover for transitive and reflexivetransitive closure of relations.
ballarin
parents:
14565
diff
changeset

486 

4b3d280ef06a
New prover for transitive and reflexivetransitive closure of relations.
ballarin
parents:
14565
diff
changeset

487 
method_setup trancl = 
4b3d280ef06a
New prover for transitive and reflexivetransitive closure of relations.
ballarin
parents:
14565
diff
changeset

488 
{* Method.no_args (Method.SIMPLE_METHOD' HEADGOAL (trancl_tac)) *} 
4b3d280ef06a
New prover for transitive and reflexivetransitive closure of relations.
ballarin
parents:
14565
diff
changeset

489 
{* simple transitivity reasoner *} 
4b3d280ef06a
New prover for transitive and reflexivetransitive closure of relations.
ballarin
parents:
14565
diff
changeset

490 
method_setup rtrancl = 
4b3d280ef06a
New prover for transitive and reflexivetransitive closure of relations.
ballarin
parents:
14565
diff
changeset

491 
{* Method.no_args (Method.SIMPLE_METHOD' HEADGOAL (rtrancl_tac)) *} 
4b3d280ef06a
New prover for transitive and reflexivetransitive closure of relations.
ballarin
parents:
14565
diff
changeset

492 
{* simple transitivity reasoner *} 
4b3d280ef06a
New prover for transitive and reflexivetransitive closure of relations.
ballarin
parents:
14565
diff
changeset

493 

4b3d280ef06a
New prover for transitive and reflexivetransitive closure of relations.
ballarin
parents:
14565
diff
changeset

494 
*) 
4b3d280ef06a
New prover for transitive and reflexivetransitive closure of relations.
ballarin
parents:
14565
diff
changeset

495 

10213  496 
end 