AFTD Auto-Formalizing Theoretical Domains

Cslib.RightCongruence.eqvCls

abbrevimported Lean

The equivalence class (as a language) corresponding to an element of the quotient type.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {α : Type*} in
abbrev Cslib.RightCongruence.eqvCls [c : RightCongruence α] (a : Quotient c.eq) : Language α
Defined in
CSLib, `Cslib.RightCongruence.eqvCls`
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.
Verified
08 Oct 2026
Axioms
none listed
Built on 1
  • Cslib.RightCongruenceA right congruence is an equivalence relation on finite sequences (represented by lists) that is preserved by concatenation on the right.…

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {α : Type*} in
/-- The equivalence class (as a language) corresponding to an element of the quotient type. -/
abbrev Cslib.RightCongruence.eqvCls [c : RightCongruence α] (a : Quotient c.eq) : Language α :=
  (Quotient.mk c.eq) ⁻¹' {a}
See it in the graphDiscuss this resultChallenge it