dictionary - Agda: Derive equality *and* AVL dicts in the same program? -

i'm doing pl theory work in agda, , i've run situation

• i need kind of dictionary (like stdlib avl trees) encode finite maps.
• i need derive equality types, since have many constructors , pairwise comparison tedious.

agda-prelude, provides second not first, , stdlib provides first not second. 2 not compatible.

are there existing libraries can use give me both functionalities without conflicts? i'm not worried performance, if finite maps list-backed that's fine, i'd prefer not prove bunch of theorems them manually.