Goal:
  
  G : t
  HI : invariants G
  HG : acyclic_no_loop G
  s0 : VSet.t
  x : V.t
  y : V.t
  d : DisjointAdd x s0 (V G)
  e : EdgeOf G x y
  p : SPath G s0 y (s G)
  IHp : let H := CoreTactics.block in
        forall (x : V.t) (z : Z) (p0 : SPath G (V G) x (s G)),
        {|
          pr1 := {| pr1 := V G; pr2 := {| pr1 := x; pr2 := s G |} |};
          pr2 := p0
        |} =
        {|
          pr1 := {| pr1 := s0; pr2 := {| pr1 := y; pr2 := s G |} |}; pr2 := p
        |} ->
        let H0 := CoreTactics.block in
        sweight p0 = z ->
        ~ VSet.In x (V G) -> let H1 := CoreTactics.block in z = 0
  z0 : Z
  ============================
   (let H := CoreTactics.block in
    sweight (spath_step G s0 (V G) x y (s G) d e p) = z0 ->
    ~ VSet.In x (V G) -> let H0 := CoreTactics.block in z0 = 0)


DEBUG:Going to execute:
match goal with
           | |- context [ eq_rect_r _ _ eq_refl ] => progress simpl eq_rect_r
           | |- context [ eq_rect _ _ _ _ eq_refl ] => progress simpl eq_rect
           | |- context [ Prop.Logic.transport _ eq_refl _ ] =>
                 progress simpl Prop.Logic.transport
           | |- context [ Logic.eq_elim _ _ _ _ _ eq_refl ] =>
                 progress simpl eq_rect
           | |- context [ Logic.eq_elim_r _ _ _ _ eq_refl ] =>
                 progress simpl Logic.eq_elim_r
           | |- context [ noConfusion_inv _ ] =>
                 progress simpl noConfusion_inv
           | |- DepElim.opaque_ind_pack_eq_inv ?G eq_refl =>
                 apply (DepElim.simplify_ind_pack_inv B x p G)
           | |- let _ := CoreTactics.block in _ => fail 1
           | |- _ => simplify * || simplify ?; cbv beta
           | |- _ -> ?B =>
                 let ty := type of B in
                 intro || (let H := fresh in
                           intro
                           H)
           | |- forall x, _ => let H := fresh x in
                               intro
                               H
           | |- _ => intro
           end