Goal:
  
  A : Type
  B : Type
  C : Type
  P : A → B → C → Type
  p0 : A × B
  c : C
  l : list ((A × B) × C)
  p : P (p0, c).1.1 (p0, c).1.2 (p0, c).2
  X : All (λ abc : (A × B) × C, P abc.1.1 abc.1.2 abc.2) l
  IHX : All (λ '(a, b, c), P a b c) l
  ============================
   (let '(a, b) := p0 in P a b c)


DEBUG:Going to execute:
match goal with
           | H:¬ _ |- _ => solve [ case H; trivial ]
           end
Level 1: Backtrace:

No such assumption.
Level 0: Backtrace:

No such assumption.
Level 0: Backtrace:

No such assumption.
Level 0: Backtrace:

No such assumption.