X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;f=matita%2Fmatita%2Flib%2Ftutorial%2Fchapter8.ma;h=47cfbdeb7b392e6539c1ff877898334142e64fe4;hb=245ff83b44c373455592e2e2271a2a7a79610799;hp=427b148427f3e34efde54a55286a284424c0b1be;hpb=a57efb7e02d1c0af621ab36bd345f2f79f063a0c;p=helm.git

diff --git a/matita/matita/lib/tutorial/chapter8.ma b/matita/matita/lib/tutorial/chapter8.ma
index 427b14842..47cfbdeb7 100644
--- a/matita/matita/lib/tutorial/chapter8.ma
+++ b/matita/matita/lib/tutorial/chapter8.ma
@@ -5,6 +5,7 @@ We shall apply all the previous machinery to the study of regular languages
 and the constructions of the associated finite automata. *)
 
 include "tutorial/chapter7.ma".
+include "basics/core_notation/card_1.ma".
 
 (* The type re of regular expressions over an alphabet $S$ is the smallest 
 collection of objects generated by the following constructors: *)