Setoid.sSup_eq_eqvGen

∀ {α : Type u_1} (S : Set (Setoid α)), sSup S = Relation.EqvGen.setoid fun x y => ∃ r ∈ S, r x y

The supremum of a set S of equivalence relations is the equivalence closure of the binary relation there exists r ∈ S relating x and y.

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Results whose statement or proof uses this declaration.