proposition: Lemma eqListTrans : forall l1 l2 l3, eqList l1 l2 -> eqList l2 l3 -> eqList l1 l3.
proof: Proof. intro l1; induction l1. intro l2; induction l2. intro l3; induction l3. simpl; trivial. simpl; intuition. simpl; intuition. intro l2; induction l2. intro l3; induction l3. simpl; trivial. simpl; intuition. intro l3; induction l3. simpl; trivial. simpl. intros Hl1l2 Hl2l3. destruct Hl1l2 as [Haa0 Hl1l2]. destruct Hl2l3 as [Ha0a1 Hl2l3]. split. transitivity a0; assumption. apply IHl1 with l2; assumption. Qed.
imports: MSets Arith NArith Notations Sorting Coq.Program.Equality GeoCoq.Tactics.Coinc.tactics_axioms