Goal:
  
  A : Type
  B : Type
  a : A
  l : list A
  b : B
  l' : list B
  IHl : ∀ l' : list B, #|l| = #|l'| → Forall2 (λ (_ : A) (_ : B), True) l l'
  H : S #|l| = S #|l'|
  ============================
   (Forall2 (λ (_ : A) (_ : B), True) (a :: l) (b :: l'))


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 ]