Goal:
    A : Type  n : nat  P : A → bool  d : A
  ============================
   (true → S n < 0 → ∃ x : A, d = x ∧ P x)


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