unfold distinct in |- *.
simple induction n.
simpl in |- *.
auto with algebra.
intros.
generalize H1; clear H1.
case i; case j.
intro x; case x.
intros l x0; case x0.
intros l0 H1.
simpl in H1.
absurd (0 = 0); auto.
intros n1 l0.
intro q; clear q.
red in |- *; red in H0.
intro.
cut
(v (Build_finiteT (lt_n_S _ _ l0)) =' v (Build_finiteT (lt_n_S _ _ l)) in _).
intro.
apply
H0
with
(Build_finiteT (lt_n_S (S n1) (pred (S n0)) l0))
(Build_finiteT (lt_n_S 0 (pred (S n0)) l)); auto with algebra.
simpl in |- *.
auto.
apply Trans with (Seqtl v (Build_finiteT l0)); auto with algebra.
intros n1 l x0; case x0.
intros l0 H1.
clear H1.
red in |- *; intro.
cut
(v (Build_finiteT (lt_n_S _ _ l0)) =' v (Build_finiteT (lt_n_S _ _ l)) in _).
intro.
red in H0.
apply H0 with (Build_finiteT (lt_n_S _ _ l0)) (Build_finiteT (lt_n_S _ _ l));
auto with algebra.
simpl in |- *.
auto.
apply Trans with (Seqtl v (Build_finiteT l0)); auto with algebra.
intros n2 l0.
simpl in |- *.
intros.
apply H0; auto with algebra.
Qed.
Hint Resolve Seqtl_preserves_distinct: algebra.

(* Specifications: *)
Lemma omit_preserves_distinct :
forall (A : Setoid) (n : Nat) (v : seq (S n) A),
distinct v -> forall i : fin (S n), distinct (omit v i).