Section subseq.
Variable A B : Type.
Hypothesis A_eq_dec : forall x y : A, {x = y} + {x <> y}.
Proof using.
induction l; simpl; tauto.
Qed.
Proof using.
induction zs; intros; simpl in *;
repeat break_match; subst; simpl in *; intuition; subst; eauto;
right; (eapply IHzs; [|eauto]); simpl; eauto.
Qed.
Proof using.
induction ys; intros.
- destruct xs; simpl in *; intuition.
- simpl in *. break_match; simpl in *; intuition; subst; intuition eauto;
right; (eapply IHys; [eauto| intuition]).
Qed.
Proof using.
induction ys; intros.
- destruct xs; simpl in *; intuition.
- simpl in *. invc_NoDup.
break_match.
+ constructor.
+ intuition.
subst. constructor; eauto using subseq_In.
Qed.
Proof using.
induction xs; intros; simpl.
- auto.
- repeat break_match; auto.
+ intuition congruence.
+ find_inversion. auto.
Qed.
Proof using.
induction ys; intros; simpl in *.
- repeat break_match; try discriminate; auto.
- repeat break_match; try discriminate; auto.
intuition.
+ subst. simpl in *. find_inversion. auto.
+ right. repeat find_reverse_rewrite. auto.
Qed.
Proof using.
induction ys; intros; simpl in *; intuition; break_match; eauto.
Qed.
Proof using.
induction ys; intros; simpl in *; break_match; intuition.
subst. simpl in *. specialize (IHys l). concludes. auto with *.
Qed.
Proof using.
induction xs; intros; destruct ys; simpl in *;
intuition eauto using f_equal2, subseq_cons_drop.
exfalso.
repeat find_apply_lem_hyp subseq_length.
simpl in *. omega.
Qed.

Lemma subseq_filter :
forall (f : A -> bool) xs,
subseq (filter f xs) xs.