Goal:
  
  A : Type
  B : Type
  f : nat → A → B
  g : nat → A → B
  l : list A
  H : ∀ (n : nat) (x : A), f n x = g n x
  ============================
   (∀ (k : nat) (x : A), 0 ≤ k → k < #|l| + 0 → f k x = g k x)


DEBUG:Going to execute:
solve
[ trivial
with eq_true
| reflexivity
| symmetry; trivial
| contradiction
| congruence ]