Relation.SemiConfluent
abbrevimported Lean
A relation is semi-confluent when single and multiple steps with common origin are multi-joinable.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in abbrev Relation.SemiConfluent (r : α → α → Prop)
- Defined in
- CSLib, `Relation.SemiConfluent`
- 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.SemiConfluent← Relation.SemiConfluent (Cslib/Foundations/Relation/Defs.lean:64): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in /-- A relation is semi-confluent when single and multiple steps with common origin are multi-joinable. -/ abbrev Relation.SemiConfluent (r : α → α → Prop) := ∀ {x y₁ y₂}, ReflTransGen r x y₂ → r x y₁ → Join (ReflTransGen r) y₁ y₂