simp only [kill_of_ne_bot hG, Set.disjoint_left, isContained_iff_exists_subgraph,
  @forall_swap _ H.Subgraph, Set.iUnion_singleton_eq_range, deleteEdges_eq_self, Set.mem_iUnion,
  Set.mem_range, not_exists, not_nonempty_iff, Nonempty.forall]
α : Type u_1
β : Type u_2
γ : Type u_3
G G₁ G₂ G₃ : SimpleGraph α
H : SimpleGraph β
I : SimpleGraph γ
hG : G ≠ ⊥
⊢ G.kill H = H ↔ ¬G ⊑ H
α : Type u_1
β : Type u_2
γ : Type u_3
G G₁ G₂ G₃ : SimpleGraph α
H : SimpleGraph β
I : SimpleGraph γ
hG : G ≠ ⊥
⊢ (∀ (y : H.Subgraph), ∀ x ∈ H.edgeSet, ∀ (a : G ≃g y.coe), x ∉ {⋯.some}) ↔ ∀ (x : H.Subgraph), IsEmpty (G ≃g x.coe)