Goal:
  
  G1 : t
  G2 : t
  H : invariants G1
  H0 : invariants G2
  l : labelling
  HGl : correct_labelling G1 l
  embed : full_subgraph G1 G2
  acG2 : acyclic_no_loop G2
  Gl := relabel_on G1 G2 l : t
  l' := to_label ∘ lsp Gl (s Gl) : V.t -> nat
  sGl : l' (s Gl) = 0%nat
  eGl : forall e : EdgeSet.elt,
        EdgeSet.In e (E Gl) ->
        Z.of_nat (l' e..s) + e..w <= Z.of_nat (l' e..t)
  e : EdgeSet.elt
  H1 : EdgeSet.In e (E G2)
  ============================
   (Z.of_nat (l' e..s) + e..w <= Z.of_nat (l' e..t))


DEBUG:Going to execute:
match goal with
           | H:~ _ |- _ => solve [ case H; trivial ]
           end
Level 1: Backtrace:

No such assumption.
Level 0: Backtrace:

No such assumption.
Level 0: Backtrace:

No such assumption.
Level 0: Backtrace:

No such assumption.