
diff -r 2f5edb146f7e -r 1f073030b97a doc-src/TutorialI/CTL/CTLind.thy
--- a/doc-src/TutorialI/CTL/CTLind.thy	Fri Jan 18 17:46:17 2002 +0100
+++ b/doc-src/TutorialI/CTL/CTLind.thy	Fri Jan 18 18:30:19 2002 +0100
@@ -47,7 +47,7 @@
  apply(blast);
 apply(clarify);
 apply(drule_tac x = "\<lambda>i. case i of 0 \<Rightarrow> t | Suc i \<Rightarrow> f i" in bspec);
-apply(simp_all add:Paths_def split:nat.split);
+apply(simp_all add: Paths_def split: nat.split);
 done
 
 text{*\noindent
@@ -106,7 +106,7 @@
 
  apply(subst lfp_unfold[OF mono_af]);
  apply(simp (no_asm) add: af_def);
- apply(blast intro:Avoid.intros);
+ apply(blast intro: Avoid.intros);
 
 txt{*
 Having proved the main goal, we return to the proof obligation that the 
@@ -120,10 +120,10 @@
 *}
 
 apply(erule contrapos_pp);
-apply(simp add:wf_iff_no_infinite_down_chain);
+apply(simp add: wf_iff_no_infinite_down_chain);
 apply(erule exE);
 apply(rule ex_infinite_path);
-apply(auto simp add:Paths_def);
+apply(auto simp add: Paths_def);
 done
 
 text{*
@@ -140,7 +140,7 @@
 \index{CTL|)}*}
 
 theorem AF_lemma2:  "{s. \<forall>p \<in> Paths s. \<exists> i. p i \<in> A} \<subseteq> lfp(af A)";
-by(auto elim:Avoid_in_lfp intro:Avoid.intros);
+by(auto elim: Avoid_in_lfp intro: Avoid.intros);
 
 
 (*<*)end(*>*)




