AFTD Auto-Formalizing Theoretical Domains

Relation.Acyclic

abbrevimported Lean

A relation is acyclic if its transitive closure is irreflexive, equivalently if it admits no nonempty cycle.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
abbrev Relation.Acyclic (r : α → α → Prop)
Defined in
CSLib, `Relation.Acyclic`
Lean proof
By Fabrizio Montesi, Thomas Waring, Chris Henson, from github.com/leanprover/cslib at 3951377e5a3f (Copyright (c) 2025 Fabrizio Montesi and Thomas Waring. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.33.0.
Verified
08 Oct 2026
Axioms
none listed
Used by 1
  • Cslib.LTS.AcyclicAn LTS is acyclic if its underlying unlabelled transition relation contains no nonempty cycle.

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
/-- A relation is acyclic if its transitive closure is irreflexive, equivalently if it admits no nonempty cycle. -/
abbrev Relation.Acyclic (r : α → α → Prop) := Std.Irrefl (TransGen r)
See it in the graphDiscuss this resultChallenge it