exact forall_congr' fun H' ↦ ⟨fun h ↦ ⟨fun f ↦ h _
  (Subgraph.edgeSet_subset _ $ (aux hG ⟨f⟩).choose_spec) f rfl⟩, fun h _ _ ↦ h.elim⟩
α : 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)
no goals