Goal:
  
  A : Type
  B : Type
  C : Type
  P : nat → A → B → Type
  Q : B → C → Type
  R : nat → A → C → Type
  S : nat → A → C → Type
  l'' : list C
  n : nat
  b1 : sigma (λ _ : list B, list C)
  b : All2 Q (pr1 b1) (pr2 b1)
  ============================
   ({| pr1 := []; pr2 := l'' |} = b1
    → let H := CoreTactics.block in
      All2i R n [] l''
      → (∀ (n : nat) (x : A) (y : B) (z : C),
           P n x y → Q y z → R n x z → S n x z)
        → let H0 := CoreTactics.block in All2i S n [] l'')


DEBUG:Going to execute:
let xn := fresh id "'" in
           destruct id as [xn id]; DepElim.decompose_exists xn id;
            cbv beta iota delta [TODO projection TODO projection] in id, id';
            DepElim.decompose_exists id id'
DEBUG LTAC Evaluated term: b1
DEBUG LTAC Evaluated term: (sigma (λ _ : list B, list C))
Level 3: type of id
 has value 
(sigma (λ _ : list B, list C))