tuned
authornipkow
Fri, 03 Oct 2014 11:55:07 +0200
changeset 58522 ad010811f450
parent 58521 b70e93c05efe
child 58541 48e23e342415
tuned
src/Doc/Prog_Prove/Isar.thy
--- a/src/Doc/Prog_Prove/Isar.thy	Fri Oct 03 11:48:27 2014 +0200
+++ b/src/Doc/Prog_Prove/Isar.thy	Fri Oct 03 11:55:07 2014 +0200
@@ -863,7 +863,7 @@
 Because each \isacom{case} command introduces a list of assumptions
 named like the case name, which is the name of a rule of the inductive
 definition, those rules now need to be accessed with a qualified name, here
-@{thm[source] ev.ev0} and @{thm[source] ev.evSS}
+@{thm[source] ev.ev0} and @{thm[source] ev.evSS}.
 \end{warn}
 
 In the case @{thm[source]evSS} of the proof above we have pretended that the