1 (**************************************************************************)
4 (* ||A|| A project by Andrea Asperti *)
6 (* ||I|| Developers: *)
7 (* ||T|| The HELM team. *)
8 (* ||A|| http://helm.cs.unibo.it *)
10 (* \ / This file is distributed under the terms of the *)
11 (* v GNU General Public License Version 2 *)
13 (**************************************************************************)
15 set "baseuri" "cic:/matita/list/".
16 include "logic/equality.ma".
17 include "datatypes/bool.ma".
18 include "higher_order_defs/functions.ma".
19 include "nat/plus.ma".
20 include "nat/orders.ma".
22 inductive list (A:Type) : Type :=
24 | cons: A -> list A -> list A.
26 notation "hvbox(hd break :: tl)"
27 right associative with precedence 46
30 notation "[ list0 x sep ; ]"
31 non associative with precedence 90
32 for ${fold right @'nil rec acc @{'cons $x $acc}}.
34 notation "hvbox(l1 break @ l2)"
35 right associative with precedence 47
36 for @{'append $l1 $l2 }.
38 interpretation "nil" 'nil = (cic:/matita/list/list/list.ind#xpointer(1/1/1) _).
39 interpretation "cons" 'cons hd tl =
40 (cic:/matita/list/list/list.ind#xpointer(1/1/2) _ hd tl).
42 (* theorem test_notation: [O; S O; S (S O)] = O :: S O :: S (S O) :: []. *)
45 \forall A:Type.\forall l:list A.\forall a:A.
53 let rec id_list A (l: list A) on l :=
56 | (cons hd tl) => hd :: id_list A tl ].
58 let rec append A (l1: list A) l2 on l1 :=
61 | (cons hd tl) => hd :: append A tl l2 ].
63 definition tail := \lambda A:Type. \lambda l: list A.
66 | (cons hd tl) => tl].
68 interpretation "append" 'append l1 l2 = (cic:/matita/list/list/append.con _ l1 l2).
70 theorem append_nil: \forall A:Type.\forall l:list A.l @ [] = l.
80 theorem associative_append: \forall A:Type.associative (list A) (append A).
81 intros; unfold; intros;
91 theorem cons_append_commute:
92 \forall A:Type.\forall l1,l2:list A.\forall a:A.
93 a :: (l1 @ l2) = (a :: l1) @ l2.
98 lemma append_cons:\forall A.\forall a:A.\forall l,l1.
101 rewrite > associative_append.
105 inductive permutation (A:Type) : list A -> list A -> Prop \def
106 | refl : \forall l:list A. permutation ? l l
107 | swap : \forall l:list A. \forall x,y:A.
108 permutation ? (x :: y :: l) (y :: x :: l)
109 | trans : \forall l1,l2,l3:list A.
110 permutation ? l1 l2 -> permut1 ? l2 l3 -> permutation ? l1 l3
111 with permut1 : list A -> list A -> Prop \def
112 | step : \forall l1,l2:list A. \forall x,y:A.
113 permut1 ? (l1 @ (x :: y :: l2)) (l1 @ (y :: x :: l2)).
115 include "nat/nat.ma".
117 definition x1 \def S O.
118 definition x2 \def S x1.
119 definition x3 \def S x2.
121 theorem tmp : permutation nat (x1 :: x2 :: x3 :: []) (x1 :: x3 :: x2 :: []).
122 apply (trans ? (x1 :: x2 :: x3 :: []) (x1 :: x2 :: x3 :: []) ?).
124 apply (step ? (x1::[]) [] x2 x3).
129 theorem nil_append_nil_both:
130 \forall A:Type.\forall l1,l2:list A.
131 l1 @ l2 = [] \to l1 = [] \land l2 = [].
135 include "nat/nat.ma".
137 theorem test_notation: [O; S O; S (S O)] = O :: S O :: S (S O) :: [].
141 theorem test_append: [O;O;O;O;O;O] = [O;O;O] @ [O;O] @ [O].
147 let rec nth (A:Type) l d n on n ≝
154 | S n' ⇒ nth A (tail ? l) d n'
157 let rec map (A,B:Type) (f: A → B) (l : list A) on l : list B ≝
158 match l with [ nil ⇒ nil ? | cons x tl ⇒ f x :: (map A B f tl)].
160 let rec foldr (A,B:Type) (f : A → B → B) (b : B) (l : list A) on l : B :=
161 match l with [ nil ⇒ b | (cons a l) ⇒ f a (foldr ? ? f b l)].
163 definition length ≝ λT:Type.λl:list T.foldr T nat (λx,c.S c) O l.
165 definition filter \def
166 \lambda T:Type.\lambda l:list T.\lambda p:T \to bool.
168 (\lambda x,l0.match (p x) with [ true => x::l0 | false => l0]) [] l.
170 definition iota : nat → nat → list nat ≝
171 λn,m. nat_rect (λ_.list ?) (nil ?) (λx,acc.cons ? (n+x) acc) m.
173 (* ### induction principle for functions visiting 2 lists in parallel *)
175 ∀T1,T2:Type.∀l1:list T1.∀l2:list T2.∀P:list T1 → list T2 → Prop.
176 length ? l1 = length ? l2 →
177 (P (nil ?) (nil ?)) →
178 (∀tl1,tl2,hd1,hd2. P tl1 tl2 → P (hd1::tl1) (hd2::tl2)) →
180 intros (T1 T2 l1 l2 P Hl Pnil Pcons);
181 generalize in match Hl; clear Hl; generalize in match l2; clear l2;
182 elim l1 1 (l2 x1); [ cases l2; intros (Hl); [assumption| simplify in Hl; destruct Hl]]
183 intros 3 (tl1 IH l2); cases l2; [1: simplify; intros 1 (Hl); destruct Hl]
184 intros 1 (Hl); apply Pcons; apply IH; simplify in Hl; destruct Hl; assumption;
187 lemma eq_map : ∀A,B,f,g,l. (∀x.f x = g x) → map A B f l = map A B g l.
188 intros (A B f g l Efg); elim l; simplify; [1: reflexivity ];
189 rewrite > (Efg a); rewrite > H; reflexivity;
192 lemma le_length_filter : \forall A,l,p.length A (filter A l p) \leq length A l.
195 |simplify;apply (bool_elim ? (p a));intro
196 [simplify;apply le_S_S;assumption
197 |simplify;apply le_S;assumption]]