Goal:
  
  G1 : t
  G2 : t
  s : VSet.t
  x : V.t
  y : V.t
  p : SPath G2 s x y
  _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_
  __view_subject__ : VSet.mem _x0_ (V G1) = true
  ============================
   (VSet.In _x0_ (V G1) -> VSet.In _z0_ (V G1) -> VSet.In _x0_ (V G1))


DEBUG:Going to execute:
<coq-core.plugins.ltac::trivial@0> $1 $2

Goals:

DEBUG:Going to execute:
hnf

Goals:

DEBUG:Going to execute:
intros

Goals:

DEBUG:Going to execute:
solve
[ do
![ solve
 [ trivial | apply : eq_sym ; trivial ]
 | discriminate
 | contradiction
 | Ltac.split ]
| case not_locked_false_eq_true; Ltac.assumption
| match goal with
  | H:~ _ |- _ => solve [ case H; trivial ]
  end ]