FormalConjecturesForMathlib/Combinatorics/SimpleGraph/DiamExtra.lean

GitHub source file

Explanation legend Lean4 Domain Explanation Language (L4DEL)

L4DEL explanations are a separate layer. They do not change the Lean source. Intuition is explanatory prose; numbered items are a reading path; sources link the wording back to evidence.

L4DEL
Lean4 Domain Explanation Language

Credit: The upstream authors and contributors retain credit for the project and mathematics. lean4-explainer only renders their pinned source and adds the separately disclosed explanation layer.

Project sources: Pinned project documentation, Formal Conjectures paper, arXiv v1

1 declarations, 0 contain sorry, 0 declared as axioms

Imports (1)
Imported by 1 file
  1. lemma SimpleGraph.diam_eq_zero_of_subsingleton The diameter is the greatest distance between any two vertices line 31 source

    Source documentation

    The diameter is the greatest distance between any two vertices. If the graph is disconnected, this will be 0.

    standard axioms: Classical.choice, Quot.sound, propext what this means

    Statement uses: SimpleGraph, Subsingleton, Eq, Nat, SimpleGraph.diam, OfNat.ofNat

    Proof uses: of_eq_true, Eq.trans, True, congrFun', congrArg, ENat, SimpleGraph.ediam, ENat.toNat, Iff.mpr, SimpleGraph.ediam_eq_zero_iff_subsingleton, eq_self

    7 instances, coercions and auxiliary constants left out.

    Tactic trace: 2 steps

    Open to load the checked before-and-after goal states.

    lemma diam_eq_zero_of_subsingleton [Subsingleton α] : G.diam = 0 := by
    …