(*
  Definition saKey := sa_equiv Key.
  Definition saKeyA := sa_prod saKey saA.
  Definition saKeyAList := sa_list saKeyA.
  Definition saSum := sa_sum saA sa_unit.
  Definition saRange := sa_bijection _ _ (bij_sa_sum_option A) _ saSum.
*)

  Fixpoint lookup k (rho: list (Key*A)) :=
    match rho with
      | nil => None
      | (k', a) :: rho' =>
          if Key_dec_eq k k' then Some a else lookup k rho'
    end.Instance Join_Key : Join Key := @Join_equiv Key.

Lemma join_hom2_comparable {A}{B}{C} `{Perm_alg A}{SA: Sep_alg A}`{Perm_alg B}{SB: Sep_alg B}`{Perm_alg C}{SC: Sep_alg C}: forall (g: A -> B -> C) a1 a2 b1 b2, comparable a1 a2 -> comparable b1 b2 -> join_hom2 g -> comparable (g a1 b1) (g a2 b2).