# HG changeset patch
# User paulson
# Date 1250259616 -3600
# Node ID 532c11b965b56d6dcfe3b82b747523bd359c9b68
# Parent  37d87022cad37733426b6445e82cb841c7975eaa
Put back characters that had been erased by Emacs

diff -r 37d87022cad3 -r 532c11b965b5 src/HOL/Bali/Basis.thy
--- a/src/HOL/Bali/Basis.thy	Thu Aug 13 17:19:54 2009 +0100
+++ b/src/HOL/Bali/Basis.thy	Fri Aug 14 15:20:16 2009 +0100
@@ -63,36 +63,36 @@
 by (auto intro: r_into_rtrancl rtrancl_trans)
 
 lemma triangle_lemma:
- "\<lbrakk> \<And> a b c. \<lbrakk>(a,b)\<in>r; (a,c)\<in>r\<rbrakk> \<Longrightarrow> b=c; (a,x)\<in>r*; (a,y)\<in>r*\<rbrakk> 
- \<Longrightarrow> (x,y)\<in>r* \<or> (y,x)\<in>r*"
+ "\<lbrakk> \<And> a b c. \<lbrakk>(a,b)\<in>r; (a,c)\<in>r\<rbrakk> \<Longrightarrow> b=c; (a,x)\<in>r\<^sup>*; (a,y)\<in>r\<^sup>*\<rbrakk> 
+ \<Longrightarrow> (x,y)\<in>r\<^sup>* \<or> (y,x)\<in>r\<^sup>*"
 proof -
   note converse_rtrancl_induct = converse_rtrancl_induct [consumes 1]
   note converse_rtranclE = converse_rtranclE [consumes 1] 
   assume unique: "\<And> a b c. \<lbrakk>(a,b)\<in>r; (a,c)\<in>r\<rbrakk> \<Longrightarrow> b=c"
-  assume "(a,x)\<in>r*" 
-  then show "(a,y)\<in>r* \<Longrightarrow> (x,y)\<in>r* \<or> (y,x)\<in>r*"
+  assume "(a,x)\<in>r\<^sup>*" 
+  then show "(a,y)\<in>r\<^sup>* \<Longrightarrow> (x,y)\<in>r\<^sup>* \<or> (y,x)\<in>r\<^sup>*"
   proof (induct rule: converse_rtrancl_induct)
-    assume "(x,y)\<in>r*"
+    assume "(x,y)\<in>r\<^sup>*"
     then show ?thesis 
       by blast
   next
     fix a v
     assume a_v_r: "(a, v) \<in> r" and
-          v_x_rt: "(v, x) \<in> r*" and
-          a_y_rt: "(a, y) \<in> r*"  and
-             hyp: "(v, y) \<in> r* \<Longrightarrow> (x, y) \<in> r* \<or> (y, x) \<in> r*"
+          v_x_rt: "(v, x) \<in> r\<^sup>*" and
+          a_y_rt: "(a, y) \<in> r\<^sup>*"  and
+             hyp: "(v, y) \<in> r\<^sup>* \<Longrightarrow> (x, y) \<in> r\<^sup>* \<or> (y, x) \<in> r\<^sup>*"
     from a_y_rt 
-    show "(x, y) \<in> r* \<or> (y, x) \<in> r*"
+    show "(x, y) \<in> r\<^sup>* \<or> (y, x) \<in> r\<^sup>*"
     proof (cases rule: converse_rtranclE)
       assume "a=y"
-      with a_v_r v_x_rt have "(y,x) \<in> r*"
+      with a_v_r v_x_rt have "(y,x) \<in> r\<^sup>*"
 	by (auto intro: r_into_rtrancl rtrancl_trans)
       then show ?thesis 
 	by blast
     next
       fix w 
       assume a_w_r: "(a, w) \<in> r" and
-            w_y_rt: "(w, y) \<in> r*"
+            w_y_rt: "(w, y) \<in> r\<^sup>*"
       from a_v_r a_w_r unique 
       have "v=w" 
 	by auto
@@ -105,7 +105,7 @@
 
 
 lemma rtrancl_cases [consumes 1, case_names Refl Trancl]:
- "\<lbrakk>(a,b)\<in>r*;  a = b \<Longrightarrow> P; (a,b)\<in>r+ \<Longrightarrow> P\<rbrakk> \<Longrightarrow> P"
+ "\<lbrakk>(a,b)\<in>r\<^sup>*;  a = b \<Longrightarrow> P; (a,b)\<in>r\<^sup>+ \<Longrightarrow> P\<rbrakk> \<Longrightarrow> P"
 apply (erule rtranclE)
 apply (auto dest: rtrancl_into_trancl1)
 done