AFTD Auto-Formalizing Theoretical Domains

Relation.Convergent

abbrevimported Lean

A relation is convergent when it is both confluent and terminating.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
abbrev Relation.Convergent (r : α → α → Prop)
Defined in
CSLib, `Relation.Convergent`
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
Built on 2
  • Relation.ConfluentA relation is confluent when its reflexive transitive closure has the diamond property.
  • Relation.TerminatingA relation is terminating when the inverse of its transitive closure is well-founded. Note that this is also called Noetherian or strongly…

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
/-- A relation is convergent when it is both confluent and terminating. -/
abbrev Relation.Convergent (r : α → α → Prop) := Confluent r ∧ Terminating r
See it in the graphDiscuss this resultChallenge it