Goal:
  
  G1 : t
  G2 : t
  H : invariants G1
  ext := EdgeSet.diff (E G2) (E G1) : EdgeSet.t
  bs := border_set G1 ext : VSet.t
  s : VSet.t
  y : V.t
  z : V.t
  p : SPath G2 s y z
  _s2_ : VSet.t
  _x0_ : V.t
  _z0_ : V.t
  _s1_ : VSet.t
  _y0_ : V.t
  _d_ : DisjointAdd _x0_ _s1_ _s2_
  e : EdgeOf G2 _x0_ _y0_
  _q_ : SPath G2 _s1_ _y0_ _z0_
  h : ~ VSet.In _x0_ (V G1)
  _x_ : V.t
  _projT1_ : Z
  _hz_ : VSet.In _z0_ (V G1)
  _e_ := (_x_, _projT1_, _x0_) : (V.t × Z) × V.t
  _he_ : EdgeSet.In _e_ ext
  ============================
   (EdgeSet.Raw.InT (?Goal, ?Goal0, _y0_) (EdgeSet.this ext))


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.