Goal:
  
  A : Type
  B : Type
  P : B → A → A → Type
  b : B
  bs : list B
  hd : A
  tl : list A
  tl' : list A
  h : OnOne2All P bs tl tl'
  i' : B
  x : A
  y : A
  u : list A
  v : list A
  p : P i' x y × tl = u ++ x :: v ∧ tl' = u ++ y :: v
  ============================
   (P i' x y
    × hd :: tl = (hd :: u) ++ x :: v ∧ hd :: tl' = (hd :: u) ++ y :: v)


DEBUG:Going to execute:
<Coq.Init.Tauto.simplif> flags;
            <Coq.Init.Tauto.axioms> flags ||
              match reverse goal with
              | id:(?X1 → ?X2) → ?X3
                |- _ =>
                    Ltac.cut X3;
                     [ intro; clear id; t_tauto_intuit
                     | Ltac.cut (X1 → X2);
                        [ exact
                        id
                        | generalize (λ y : X2, id (λ x : X1, y)); intro;
                           clear id; (solve [ t_tauto_intuit ]) ] ]
              | id:¬ ?X1 → ?X3
                |- _ =>
                    Ltac.cut X3;
                     [ intro; clear id; t_tauto_intuit
                     | Ltac.cut (¬ X1);
                        [ exact
                        id
                        | clear id; intro; (solve [ t_tauto_intuit ]) ] ]
              | |- ?X1 =>
                    <Coq.Init.Tauto.is_disj> flags X1; (solve
                     [ Ltac.left; t_tauto_intuit
                     | Ltac.right; t_tauto_intuit ])
              end ||
                match goal with
                | |- _ → _ => intro; t_tauto_intuit
                | |- _ => t_reduce; t_solver
                end || t_solver