include "logic/equality.ma".
include "higher_order_defs/functions.ma".
+inductive list (A:Set) : Set :=
+ | nil: list A
+ | cons: A -> list A -> list A.
+
notation "hvbox(hd break :: tl)"
right associative with precedence 46
for @{'cons $hd $tl}.
right associative with precedence 47
for @{'append $l1 $l2 }.
-inductive list (A:Set) : Set :=
- | nil: list A
- | cons: A -> list A -> list A.
-
interpretation "nil" 'nil = (cic:/matita/list/list.ind#xpointer(1/1/1) _).
interpretation "cons" 'cons hd tl =
(cic:/matita/list/list.ind#xpointer(1/1/2) _ hd tl).
theorem nil_cons:
\forall A:Set.\forall l:list A.\forall a:A.
a::l <> [].
- intros.
- unfold; intros.
+ intros;
+ unfold Not;
+ intros;
discriminate H.
qed.
[ nil => l2
| (cons hd tl) => hd :: append A tl l2 ].
+definition tail := \lambda A:Set. \lambda l: list A.
+ match l with
+ [ nil => []
+ | (cons hd tl) => tl].
+
interpretation "append" 'append l1 l2 = (cic:/matita/list/append.con _ l1 l2).
theorem append_nil: \forall A:Set.\forall l:list A.l @ [] = l.
- intros.
- elim l.
- reflexivity.
- simplify.
- rewrite > H.
- reflexivity.
+ intros;
+ elim l;
+ [ reflexivity;
+ | simplify;
+ rewrite > H;
+ reflexivity;
+ ]
qed.
theorem associative_append: \forall A:Set.associative (list A) (append A).
- intros; unfold; intros.
- elim x.
- simplify; reflexivity.
- simplify.
- rewrite > H.
- reflexivity.
+ intros; unfold; intros;
+ elim x;
+ [ simplify;
+ reflexivity;
+ | simplify;
+ rewrite > H;
+ reflexivity;
+ ]
qed.
theorem cons_append_commute:
\forall A:Set.\forall l1,l2:list A.\forall a:A.
a :: (l1 @ l2) = (a :: l1) @ l2.
- intros.
- reflexivity.
+ intros;
+ reflexivity;
qed.
(*