Proof using.
intros n; elim n; simpl in |- *; auto.
intros l1; case l1; simpl in |- *; auto.
intros b l l2 H; Contradict H; auto with arith.
intros n0 H l1; case l1; simpl in |- *; auto with arith.
Qed.

Theorem skip_n_app2 :
forall (n : nat) (l1 l2 : list A),
n <= length l1 -> skip_n (l1 ++ l2) n = skip_n l1 n ++ l2.