AFTD Auto-Formalizing Theoretical Domains

is_bridgeless_graph

def

A simple graph G is bridgeless if no edge of G is a bridge.

Statement

def is_bridgeless_graph {V : Type*} (G : SimpleGraph V) : Prop
Defined in
arXiv:2610.09648 Section 1
Verified
19 Oct 2026
Axioms
none listed

Read back from the Lean

For a type V and a simple graph G on V, is_bridgeless_graph G asserts that for every edge e in the edge set of G, e is not a bridge of G (that is, ¬ G.IsBridge e).

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

/-- A simple graph G is bridgeless if no edge of G is a bridge. -/
def is_bridgeless_graph {V : Type*} (G : SimpleGraph V) : Prop := ∀ e ∈ G.edgeSet, ¬ G.IsBridge e
See it in the graphDiscuss this resultChallenge it