Mathlib Map

Structures · Order

SemilatticeSup

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
Shape
One type argument · adds sup, le_sup_left, le_sup_right, sup_le

Extends1

Extended by2

Forgetful instances

Every SemilatticeSup is also a

Concrete types that are instances57

  • Real
  • Rat
  • NNReal
  • ENNReal
  • Filter.Germ
  • BoundedContinuousFunction
  • NonemptyInterval
  • MeasureTheory.SimpleFunc
  • Finsupp
  • Interval
  • DFinsupp
  • TopologicalSpace.NonemptyCompacts
  • Tropical
  • CompactlySupportedContinuousMap
  • TopologicalSpace.Compacts
  • WithTopology
  • PrimeMultiset
  • Seminorm
  • ClosedSubmodule
  • TwoSidedIdeal
  • CategoryTheory.Subobject
  • GroupSeminorm
  • AddGroupSeminorm
  • TopologicalSpace.CompactOpens
  • Concept
  • Booleanisation
  • OpenNormalAddSubgroup
  • OpenNormalSubgroup
  • FiniteIndexNormalSubgroup
  • FiniteIndexNormalAddSubgroup
  • ValuationSubring
  • Semiquot
  • AddGroupNorm
  • GroupNorm
  • TopHom
  • BotHom
  • NonarchAddGroupSeminorm
  • TopologicalSpace.PositiveCompacts
  • SupHom
  • BoxIntegral.Box
  • NonarchAddGroupNorm
  • SupBotHom
  • ManyOneDegree
  • PseudoMetric
  • CategoryTheory.Coverage
  • SemilatSupCat.X
  • Subtype
  • Prod
  • OrderDual
  • Set.Elem
  • ULift
  • Lex
  • ContinuousMap
  • WithTop
  • WithBot
  • WithZero
  • OrderHom

How is a type an instance?

Loading the hierarchy index…

Assumed by867

Ancestors9