(* This program is free software; you can redistribute it and/or      *)
(* modify it under the terms of the GNU Lesser General Public License *)
(* as published by the Free Software Foundation; either version 2.1   *)
(* of the License, or (at your option) any later version.             *)
(*                                                                    *)
(* This program is distributed in the hope that it will be useful,    *)
(* but WITHOUT ANY WARRANTY; without even the implied warranty of     *)
(* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the      *)
(* GNU General Public License for more details.                       *)
(*                                                                    *)
(* You should have received a copy of the GNU Lesser General Public   *)
(* License along with this program; if not, write to the Free         *)
(* Software Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA *)
(* 02110-1301 USA                                                     *)
(** %\subsection*{ support :  seq\_set.v }%*)
(** - From seqs we can make (sub)setoids containing exactly the listed elements: (seq_set v) = $\{a\in A | \exists i. a=v_i\}$. Note that v:(seq n A) doesn't give us an n-element set a priori since v may contain duplicates. *)
Set Implicit Arguments.
Unset Strict Implicit.
Require Export finite.
From Algebra Require Export Parts.
Section MAIN.
(** %\label{seqset}% *)
Definition seq_set : forall (A : Setoid) (n : Nat) (v : seq n A), part_set A.
intros.
simpl in |- *.
apply
(Build_Predicate (Pred_fun:=fun a : A => exists i : fin n, a =' v i in _)).
red in |- *.
intros.
inversion H.
exists x0.
apply Trans with x; auto with algebra.
Defined.
Variable A : Setoid.
Variable n : Nat.

Lemma seq_set_comp :
forall v v' : seq n A, v =' v' in _ -> seq_set v =' seq_set v' in _.