Goal:
  
  G1 : t
  G2 : t
  l : labelling
  Gl := relabel_on G1 G2 l : t
  H : invariants G1
  preserves_edges : forall e : EdgeSet.elt,
                    EdgeSet.In e (E G1) -> EdgeSet.In e (E G2)
  HGl : correct_labelling G1 l
  H0 : invariants G2
  H1 : acyclic_no_loop G2
  embed : forall v1 v2 : VSet.elt,
          VSet.In v1 (V G1) ->
          VSet.In v2 (V G1) -> (lsp G2 v1 v2 <= lsp G1 v1 v2)%nbar
  s0 : VSet.t
  x : V.t
  yin : VSet.In x (V G1)
  ============================
   (exists n : Z,
      lsp G2 x (first_in G1 Gl (spath_refl Gl s0 x)) = Some n /\
      sweight (spath_refl Gl s0 x) <=
      n + diff l (first_in G1 Gl (spath_refl Gl s0 x)) x)


DEBUG:Going to execute:
<coq-equations.plugin::simp@0> $1 $2
DEBUG LTAC Evaluated term: (EdgeSet.mem ?x ?s)