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)
  x : nat
  H : x < n
  ============================
   (is_true (f (g x)))


DEBUG:Going to execute:
apply : eq_sym ; trivial
Level 0: Backtrace:

Proof is not complete.
Level 0: Backtrace:

Proof is not complete.