AFTD Auto-Formalizing Theoretical Domains

SimpleGraph.delete

def

For a simple graph G on vertex type V and a vertex u : V, SimpleGraph.delete G u is the induced subgraph G.induce (Set.univ \ {u}) on the subtype ↑(Set.univ \ {u} : Set V).

Statement

def SimpleGraph.delete {V : Type*} (G : SimpleGraph V) (u : V) : SimpleGraph ↑(Set.univ \ {u} : Set V)
Defined in
arXiv:2611.12781 Property 2.3
Verified
13 Nov 2026
Axioms
none listed

Read back from the Lean

For any type V, simple graph G on V, and vertex u : V, SimpleGraph.delete G u is defined as the induced subgraph of G on the set of vertices Set.univ \ {u} (the subtype of all vertices in V not equal to u), via G.induce (Set.univ \ {u}).

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

Lean source view module on GitHub

/-- The induced subgraph of G obtained by deleting vertex u. -/
def SimpleGraph.delete {V : Type*} (G : SimpleGraph V) (u : V) : SimpleGraph ↑(Set.univ \ {u} : Set V) := G.induce (Set.univ \ {u})
See it in the graphDiscuss this resultChallenge it