Goal:
  
  A : Type
  B : Type
  C : Type
  f : A → B → C
  a : A
  l0 : list A
  l0' : list A
  l1' : list B
  IHl0 : ∀ (l0' : list A) (l1 l1' : list B),
           #|l0| = #|l1|
           → #|l0'| = #|l1'|
             → map2 f (l0 ++ l0') (l1 ++ l1') =
               map2 f l0 l1 ++ map2 f l0' l1'
  H : S #|l0| = 0
  H0 : #|l0'| = #|l1'|
  ============================
   (match l1' with
    | [] => []
    | hd' :: tl' => f a hd' :: map2 f (l0 ++ l0') tl'
    end = map2 f l0' l1')


DEBUG:Going to execute:
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 ]