X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;ds=inline;f=matita%2Fmatita%2Flib%2Ftutorial%2Fchapter5.ma;h=b90433657462f8772e85e64726861a620a388a1c;hb=9b93455c674edb6e5d5d034df52666fedfe04bd4;hp=9cd43fd236e03d1240773b713e8e9786de3e021d;hpb=770ba48ba232d7f1782629c572820a0f1bfe4fde;p=helm.git

diff --git a/matita/matita/lib/tutorial/chapter5.ma b/matita/matita/lib/tutorial/chapter5.ma
index 9cd43fd23..b90433657 100644
--- a/matita/matita/lib/tutorial/chapter5.ma
+++ b/matita/matita/lib/tutorial/chapter5.ma
@@ -7,7 +7,7 @@ effectively searching an element of that set inside a data structure. In this
 section we shall define several boolean functions acting on lists of elements in 
 a DeqSet, and prove some of their properties.*)
 
-include "basics/list.ma". 
+include "basics/lists/list.ma". 
 include "tutorial/chapter4.ma".
 
 (* The first function we define is an effective version of the membership relation,