induction ls; intuition; simpl in *.
omega.
destruct n.
destruct ls; simpl in *; try omega.
exists a. exists nil.
simpl.
intuition.
inversion H; clear H.
edestruct IHls; intuition.
eauto.
destruct H.
intuition.
exists x.
exists (a :: x0).
subst.
simpl.
intuition.
Qed.

Lemma getAllBlists_app_rel_map : forall n,
rel_map (fun ls1 ls2 => ls1 = (rev ls2)) (getAllBlists_app n) (getAllBlists n).