Theorems · Inductive type · order theory
SemilatticeSup
Type u → Type u
A SemilatticeSup is a join-semilattice, that is, a partial order
with a join (a.k.a. lub / least upper bound, sup / supremum) operation
⊔ which is the least element larger than both factors.
- Defined in
- Mathlib.Order.Lattice
- Cited by
- 785 results in Mathlib
- Foundations
- Depth 0 from the axioms, rests on 1 definitions · 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 by864
Results whose statement or proof uses this declaration.
- Finset.supstatement and proof · cited by 530
- le_sup_leftstatement and proof · cited by 265
- le_sup_rightstatement and proof · cited by 242
- sup_of_le_leftstatement and proof · cited by 218
- Finset.sup'statement and proof · cited by 174
- sup_commstatement and proof · cited by 165
- sup_lestatement and proof · cited by 159
- sup_of_le_rightstatement and proof · cited by 143
- Finset.le_supstatement and proof · cited by 112
- GaloisConnection.l_supstatement and proof · cited by 81
- Finset.sup_emptystatement and proof · cited by 72
- sup_eq_leftstatement and proof · cited by 71
Showing the 200 most cited of 864.