Theorems · Definition · logic and foundations
Relator.LeftUnique
{α : Sort u₁} → {β : Sort u₂} → (α → β → Prop) → PropA relation is "left unique" if every element on the right is paired with at most one element on the left.
- Defined in
- Mathlib.Logic.Relator
- Cited by
- 8 results in Mathlib
- Foundations
- Depth 1 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 by9
Results whose statement or proof uses this declaration.
- Relator.BiUniqueproof · cited by 5
- Relator.LeftUnique.flipstatement and proof · cited by 1
- Relator.LeftUnique.forall₂statement and proof · cited by 1
- List.left_unique_forall₂'statement and proof · cited by 1
- Fintype.card_le_card_of_leftTotal_uniquestatement and proof · cited by 0
- Option.Mem.leftUniquestatement · cited by 0
- Computation.Mem.left_uniquestatement · cited by 0
- Relator.left_unique_of_rel_eqstatement · cited by 0
- Part.Mem.left_uniquestatement · cited by 0