Relation.Confluent
abbrevimported Lean
A relation is confluent when its reflexive transitive closure has the diamond property.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in abbrev Relation.Confluent (r : α → α → Prop)
- Defined in
- CSLib, `Relation.Confluent`
- 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.Relation.Confluent← Relation.Confluent (Cslib/Foundations/Relation/Defs.lean:60): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 1
- Relation.DiamondA relation has the diamond property when all reductions with a common origin are joinable
- Used by 1
- Relation.ConvergentA relation is convergent when it is both confluent and terminating.
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in /-- A relation is confluent when its reflexive transitive closure has the diamond property. -/ abbrev Relation.Confluent (r : α → α → Prop) := Diamond (ReflTransGen r)