Goal:
  
  G1 : t
  ext : EdgeSet.t
  i : VSet.t
  f : EdgeSet.elt -> VSet.t -> VSet.t
  trf : transpose VSet.Equal f
  prpf : Proper (eq ==> VSet.Equal ==> VSet.Equal) f
  ============================
   (forall (a : EdgeSet.elt) (l : list EdgeSet.elt),
    VSet.Equal
      (fold_left (fun (a0 : VSet.t) (e : EdgeSet.elt) => f e a0) l i)
      (fold_right f i l) ->
    VSet.Equal
      (fold_left (fun (a0 : VSet.t) (e : EdgeSet.elt) => f e a0) (a :: l) i)
      (fold_right f i (a :: l)))


DEBUG:Going to execute:
trivial; hnf; intros; (solve
            [ do
            ![ solve
             [ trivial | apply : eq_sym ; trivial ]
             | discriminate
             | contradiction
             | Ltac.split ]
            | case not_locked_false_eq_true; Ltac.assumption
            | match goal with
              | H:~ _ |- _ => solve [ case H; trivial ]
              end ])