Cslib.RightCongruence
classimported Lean
A right congruence is an equivalence relation on finite sequences (represented by lists) that is preserved by concatenation on the right. The equivalence relation is represented by a setoid to to enable ready access to the quotient construction.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in class Cslib.RightCongruence (α : Type*) extends eq : Setoid (List α)
- Defined in
- CSLib, `Cslib.RightCongruence`
- Lean proof
- By Ching-Tsun Chou, from github.com/leanprover/cslib at
3951377e5a3f(Copyright (c) 2026 Ching-Tsun Chou. 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.Cslib.RightCongruence← Cslib.RightCongruence (Cslib/Computability/Languages/Congruences/RightCongruence.lean:28): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Used by 2
- Cslib.RightCongruence.eqvClsThe equivalence class (as a language) corresponding to an element of the quotient type.
- Cslib.RightCongruence.toDAEvery right congruence gives rise to a DA whose states are the equivalence classes of the right congruence, whose start state is the empty…
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in /-- A right congruence is an equivalence relation on finite sequences (represented by lists) that is preserved by concatenation on the right. The equivalence relation is represented by a setoid to to enable ready access to the quotient construction. -/ class Cslib.RightCongruence (α : Type*) extends eq : Setoid (List α) where right_cov : CovariantClass _ _ (fun x y => y ++ x) eq