Goal:
  
  G : t
  to_simple : forall (x y : V.t) (p : PathOf x y),
              is_simple p = true -> SPath (nodes p) x y
  x0 : V.t
  y0 : V.t
  p : PathOf x0 y0
  Hp : is_simple p = true
  x : V.t
  y : V.t
  z : V.t
  e : EdgeOf x y
  p0 : PathOf y z
  Hp0 : ~~ VSet.mem x (nodes p0) && is_simple p0 = true
  ============================
   (DisjointAdd x (nodes p0) (VSet.add x (nodes p0)))


DEBUG:Going to execute:
let tacT H := let ph := fresh "X" in
                         destruct H as [H ph] in
           let tacT2 H :=
            let ph := fresh "X" in
            let ph' := fresh "X" in
            destruct H as [H ph ph']
           in
           match goal with
           | H:exists y, _ y |- _ => tac H
           | H:{x : _ | ?P x} |- _ => tac H
           | H:∑ y, ?P y |- _ => tacT H
           | H:exists2 x : _, _ x & _ x |- _ => tac2 H
           | H:{x : _ | ?P x & _ x} |- _ => tac2 H
           | H:{x : _ & ?P x & _ x} |- _ => tacT2 H
           end