Goal:
  
  A : Type
  f : A → bool
  g : nat → A
  n : nat
  fg : ∀ x : nat, x < S n → f (g x)
  IHn : (∀ x : nat, x < n → f (g x)) → forallb f (unfold n g)
  ============================
   (is_true (true && true))


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 ])