Goal:
  
  A : Type
  B : Type
  C : Type
  Q : C → Type
  P : C → A → Prop
  fn : ∀ x : A, (∀ y : C, Q y → P y x) → B
  Hl : ∀ y : C, Q y → ∥ All (P y) [] ∥
  n : nat
  x : A
  H0 : nth_error [] (S n) = Some x
  ============================
   (∃ D : ∀ y : C, Q y → P y x,
      nth_error (map_All fn [] Hl) (S n) = Some (fn x D))


DEBUG:Going to execute:
fun H =>
             try intros until H; intro_block_id H || intro_block H;
              (try simpl in H; DepElim.simplify_equations_in H)