AFTD Auto-Formalizing Theoretical Domains

digraph_directed_cycle_on

def

s is the vertex set of a directed cycle of D: its vertices can be listed without repetition, at least two of them, each with an arc to the next and the last with an arc back to the first (a digon counts).

Statement

def digraph_directed_cycle_on {α : Type} [DecidableEq α] (D : Digraph α) (s : Finset α) : Prop
Source
Filed by the prover as a step towards another result
Verified
02 Nov 2026
Axioms
none listed
Used by 59

Lean source view module on GitHub

def digraph_directed_cycle_on {α : Type} [DecidableEq α] (D : Digraph α) (s : Finset α) : Prop :=
  ∃ l : List α, l.Nodup ∧ 2 ≤ l.length ∧ l.toFinset = s ∧ l.IsChain D.Adj ∧
    ∃ a b, l.head? = some a ∧ l.getLast? = some b ∧ D.Adj b a
See it in the graphDiscuss this resultChallenge it