∀ {V : Type u_1} {s : Set V} [inst : DecidablePred fun x => x ∈ s] [inst_1 : Fintype V] {G : SimpleGraph V}
  [inst_2 : DecidableRel G.Adj] [inst_3 : DecidableEq V],
  Finset.map (Function.Embedding.subtype fun x => x ∈ s).sym2Map (SimpleGraph.induce s G).edgeFinset =
    G.edgeFinset ∩ s.toFinset.sym2