{V : Type u} →
  {G : SimpleGraph V} →
    {motive : G.Subgraph → Sort u_1} →
      (t : G.Subgraph) →
        ((verts : Set V) →
            (Adj : V → V → Prop) →
              (adj_sub : ∀ {v w : V}, Adj v w → G.Adj v w) →
                (edge_vert : ∀ {v w : V}, Adj v w → v ∈ verts) →
                  (symm : Symmetric Adj) →
                    motive { verts := verts, Adj := Adj, adj_sub := adj_sub, edge_vert := edge_vert, symm := symm }) →
          motive t