Set Implicit Arguments.
Inductive fold_rel (A: Type) (f: A -> A -> A -> Prop):  A -> list A -> A -> Prop :=
| fold_rel_nil: forall w, fold_rel f w nil w
| fold_rel_cons: forall a l w w1 w2,
f w a w1 ->
fold_rel f w1 l w2 ->
fold_rel f w (a::l) w2.
Inductive list_forall2 {A B} (P: A -> B -> Prop): list A -> list B -> Prop :=
| list_forall2_nil:
list_forall2 P nil nil
| list_forall2_cons:
forall a1 al b1 bl,
P a1 b1 ->
list_forall2 P al bl ->
list_forall2 P (a1 :: al) (b1 :: bl).
Fixpoint replace (A: Type) (l: list A) (n:nat) (new: A) {struct n} : option (list A) :=
match (l, n) with
| (nil, n) => None
| (x :: xs, O) => Some (new :: xs)
| (x :: xs, S n) =>
match (replace xs n new) with
|  None => None
|  Some xs => Some (x :: xs)
end
end.
Definition list_join {A} {JA: Join A}: A -> list A -> A -> Prop :=
fold_rel join.

Lemma list_join_assoc2 {A}  {JA: Join A}{PA: Perm_alg A}:
forall {a b: A} {cl e f},
list_join b cl f -> join a f e ->
exists d,  join a b d /\ list_join d cl e.