Goal:
  
  G : t
  HI : invariants G
  HG : acyclic_no_loop G
  n : Z
  x : V.t
  e : EdgeSet.elt
  Hle : forall l : labelling,
        correct_labelling G l -> Z.of_nat (l x) + n <= Z.of_nat (l e..s)
  Vy : ~ VSet.In e..s (V G)
  nneg : n <= 0
  n0 : x <> e..s
  z : Z
  H : lsp G x (s G) = Some z
  mem : VSet.In x (V G)
  G' := Subgraph1.G' G (s G) x z : t
  X : correct_labelling G (to_label ∘ lsp G' (s G'))
  HI' : invariants G'
  HG' : acyclic_no_loop G'
  H' : EdgeSet.In e (E G)
  ============================
   (EdgeSet.In e (E G))


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