Goal:
  
  G1 : t
  G2 : t
  __view_subject_4_ : VSet.Subset (V G1) (V G2)
  __view_subject_5_ : EdgeSet.Subset (E G1) (E G2)
  __view_subject_6_ : s G1 = s G2
  h : VSet.For_all
        (fun x : VSet.elt =>
         VSet.for_all (fun y : VSet.elt => lsp G1 x y == lsp G2 x y) (V G1) =
         true) (V G1)
  v1 : VSet.elt
  v2 : VSet.elt
  H : VSet.In v1 (V G1)
  H0 : VSet.In v2 (V G1)
  ============================
   (lsp G2 v1 v2 <= lsp G1 v1 v2)%nbar


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 ]