AFTD Auto-Formalizing Theoretical Domains

not_isIsolated_iff_zero_lt_degree

theoremverified

A vertex in a simple graph is not isolated if and only if its degree is strictly positive.

Statement

open Classical in
theorem not_isIsolated_iff_zero_lt_degree {V : Type*} [Fintype V]
    (G : SimpleGraph V) (w : V) :
    ¬ G.IsIsolated w ↔ 0 < G.degree w
Source
step towards weighted_dominating_occupancy_at_one_le_two_thirds
Verified
28 Oct 2026
Axioms
Classical.choiceQuot.soundpropext

The proof, explained

A vertex in a simple graph is not isolated if and only if its degree is strictly positive. This is the symmetric form of Mathlib's `SimpleGraph.degree_pos`, and the simplifier finishes the proof in a single step using that lemma.

  1. A vertex w is not isolated if and only if its degree is strictly positive: ¬G.IsIsolated w ↔ 0 < G.degree w.

    The library lemma SimpleGraph.degree_pos states that 0 < G.degree w ↔ ¬G.IsIsolated w. The simplifier uses this equivalence to rewrite the goal into a tautology.

    line 6

    uses SimpleGraph.degree_pos

      simp [SimpleGraph.degree_pos]
SimpleGraph.degree_pos
A vertex in a simple graph has strictly positive degree if and only if it is not isolated (0 < G.degree v ↔ ¬G.IsIsolated v).

Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.

Lean source view module on GitHub

open Classical in/-- A vertex in a simple graph is not isolated if and only if its degree is strictly positive. -/theorem not_isIsolated_iff_zero_lt_degree {V : Type*} [Fintype V]    (G : SimpleGraph V) (w : V) :    ¬ G.IsIsolated w ↔ 0 < G.degree w := by  simp [SimpleGraph.degree_pos]
See it in the graphDiscuss this resultChallenge it