intros. rewrite lseg_unroll by auto.
apply pred_ext. apply orp_left; auto.
rewrite andp_assoc.
do 2 (apply derives_extract_prop; intro).
congruence.
apply orp_right2. auto.
Qed.

Lemma unfold_lseg_neq (ls: listspec list_structid list_link list_token):
forall P Q1 Q R (v v2: val) dsh psh (s: list val),
~ (readable_share dsh) ->
PROPx P (LOCALx (Q1::Q) (SEPx (lseg ls dsh psh s v v2 :: R))) |--
!! (ptr_neq v v2) ->
PROPx P (LOCALx (Q1::Q) (SEPx (lseg ls dsh psh s v v2 :: R))) |--
EX hryp: elemtype ls * list val * val * val,
match hryp with (h,r,y,p) =>
!! (s=p::r /\ is_pointer_or_null y) &&
!! (p=v) &&
PROPx P (LOCALx Q
(SEPx (list_token dsh v :: list_cell ls dsh h v::
field_at psh list_struct (StructField list_link :: nil) (valinject (nested_field_type list_struct (StructField list_link :: nil)) y) v ::
lseg ls dsh psh r y v2 ::
R)))
end.