proposition: Lemma mapM_fmap_Some_inv (g : B → A) (l : list A) (k : list B) : mapM f l = Some k → (∀ x y, f x = Some y → g y = x) → g <$> k = l.
proof: Proof. eauto using mapM_fmap_Forall2_Some_inv, Forall2_true, mapM_length. Qed.
imports: stdpp(options)