Theorems · Theorem · order theory
Setoid.eqvGen_idem
∀ {α : Type u_1} (r : α → α → Prop), Relation.EqvGen.setoid ⇑(Relation.EqvGen.setoid r) = Relation.EqvGen.setoid rEquivalence closure is idempotent.
- Defined in
- Mathlib.Data.Setoid.Basic
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 31 from the axioms · uses propext, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites2
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Relation.EqvGen.setoidstatement and proof · cited by 10
- Setoid.eqvGen_of_setoidproof · cited by 2
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.