Theorems · Theorem · group theory
AddCon.sup_eq_addConGen
∀ {M : Type u_1} [inst : Add M] (c d : AddCon M), c ⊔ d = addConGen fun x y => c x y ∨ d x yThe supremum of additive congruence relations c, d equals the
smallest additive congruence relation containing the binary relation 'x is related to y
by c or d'.
- Defined in
- Mathlib.GroupTheory.Congruence.Defs
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 36 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- Add
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites4
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coestatement · cited by 62,936
- AddConstatement and proof · cited by 138
- addConGenstatement · cited by 28
- AddCon.sup_defproof · cited by 1
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.