Goal:
  
  G : t
  HI : invariants G
  HG : acyclic_no_loop G
  n : Z
  x : V.t
  y : V.t
  Vy : VSet.In y (V G) -> False
  Hle : leq_vertices G n x y
  e : y = y
  Hy : x = y
  XX : Z.of_nat (to_label (lsp G (s G) x)) + n <=
       Z.of_nat (to_label (lsp G (s G) x))
  ============================
   (n <= 0)


DEBUG:Going to execute:
match reverse goal with
           | |- ?X1 => <Coq.Init.Tauto.is_unit_or_eq> flags X1; constructor 1
           | H:?X1 |- _ => <Coq.Init.Tauto.is_empty> flags X1; elim H
           | _ => Ltac.assumption
           end