Suprema of congruence relations #
The supremum of a set of congruence relations is their supremum as equivalence relations: the equivalence relation generated by a union of congruences is already compatible with multiplication.
theorem
Con.sSup_toSetoid
{M : Type u_1}
[Mul M]
(S : Set (Con M))
:
(sSup S).toSetoid = sSup (toSetoid '' S)
The supremum of a set of congruence relations is their supremum as equivalence relations.
theorem
AddCon.sSup_toSetoid
{M : Type u_1}
[Add M]
(S : Set (AddCon M))
:
(sSup S).toSetoid = sSup (toSetoid '' S)
The supremum of a set of additive congruence relations is their supremum as equivalence relations.