Goal:
  
  A : Type
  P : A → Prop
  p : A → bool
  q : A → bool
  x : A
  l : list A
  H : P x
  H0 : Forall P l
  H1 : ∀ x : A, P x → p x = q x
  H2 : forallb p l = forallb q l
  ============================
   (p x && forallb p l = q x && forallb q l)


DEBUG:Going to execute:
<Coq.Init.Tauto.is_empty> flags X1; elim H
Level 2: Backtrace:

In environment
A : Type
P : A → Prop
p, q : A → bool
x : A
l : list A
H : P x
H0 : Forall P l
H1 : ∀ x : A, P x → p x = q x
H2 : forallb p l = forallb q l
Unable to unify "q x && forallb q l" with "p x && forallb p l".
Level 2: Backtrace:

In environment
A : Type
P : A → Prop
p, q : A → bool
x : A
l : list A
H : P x
H0 : Forall P l
H1 : ∀ x : A, P x → p x = q x
H2 : forallb p l = forallb q l
Unable to unify "q x && forallb q l" with "p x && forallb p l".
Level 3: Backtrace:

In environment
A : Type
P : A → Prop
p, q : A → bool
x : A
l : list A
H : P x
H0 : Forall P l
H1 : ∀ x : A, P x → p x = q x
H2 : forallb p l = forallb q l
Unable to unify "q x && forallb q l" with "p x && forallb p l".
Level 3: Backtrace:

In environment
A : Type
P : A → Prop
p, q : A → bool
x : A
l : list A
H : P x
H0 : Forall P l
H1 : ∀ x : A, P x → p x = q x
H2 : forallb p l = forallb q l
Unable to unify "q x && forallb q l" with "p x && forallb p l".
Level 2: Backtrace:

In environment
A : Type
P : A → Prop
p, q : A → bool
x : A
l : list A
H : P x
H0 : Forall P l
H1 : ∀ x : A, P x → p x = q x
H2 : forallb p l = forallb q l
Unable to unify "q x && forallb q l" with "p x && forallb p l".
Level 2: Backtrace:

In environment
A : Type
P : A → Prop
p, q : A → bool
x : A
l : list A
H : P x
H0 : Forall P l
H1 : ∀ x : A, P x → p x = q x
H2 : forallb p l = forallb q l
Unable to unify "q x && forallb q l" with "p x && forallb p l".