Theorems · Definition · order theory
Setoid.prod
{α : Type u_1} → {β : Type u_2} → Setoid α → Setoid β → Setoid (α × β)Given types α, β, the product of two equivalence relations r on α and s on β:
(x₁, x₂), (y₁, y₂) ∈ α × β are related by r.prod s iff x₁ is related to y₁
by r and x₂ is related to y₂ by s.
- Defined in
- Mathlib.Data.Setoid.Basic
- Cited by
- 7 results in Mathlib
- Foundations
- Depth 5 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites0
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
Nothing in Mathlib beyond the foundations.
Cited by10
Results whose statement or proof uses this declaration.
- Setoid.prod_applystatement · cited by 4
- Setoid.prodQuotientEquivstatement and proof · cited by 2
- QuotientGroup.leftRel_prodstatement · cited by 0
- QuotientGroup.rightRel_prodstatement · cited by 0
- QuotientAddGroup.leftRel_prodstatement · cited by 0
- AddCon.prodproof · cited by 0
- Setoid.prodQuotientEquiv_applystatement · cited by 0
- QuotientAddGroup.rightRel_prodstatement · cited by 0
- Setoid.prodQuotientEquiv_symm_applystatement and proof · cited by 0
- Con.prodproof · cited by 0