Mathlib Map

Structures · Order

SemilatticeInf

A SemilatticeInf is a meet-semilattice, that is, a partial order with a meet (a.k.a. glb / greatest lower bound, inf / infimum) operation which is the greatest element smaller than both factors.

Defined in
Mathlib.Order.Lattice
Shape
One type argument · adds inf, inf_le_left, inf_le_right, le_inf

Extends1

Extended by1

Forgetful instances

Every SemilatticeInf is also a

Concrete types that are instances56

  • Real
  • Rat
  • NNReal
  • Filter.Germ
  • BoundedContinuousFunction
  • MeasureTheory.SimpleFunc
  • Finsupp
  • DFinsupp
  • Tropical
  • AlgebraicGeometry.Scheme.IdealSheafData
  • CompactlySupportedContinuousMap
  • WithTopology
  • Partition
  • Finpartition
  • LinearPMap
  • ClosedSubmodule
  • TwoSidedIdeal
  • CategoryTheory.Subobject
  • Nucleus
  • TopologicalSpace.CompactOpens
  • GroupTopology
  • AddGroupTopology
  • Concept
  • OpenSubgroup
  • OpenAddSubgroup
  • Booleanisation
  • OpenNormalAddSubgroup
  • OpenNormalSubgroup
  • FiniteIndexNormalSubgroup
  • FiniteIndexNormalAddSubgroup
  • ClosedSubgroup
  • ClosedAddSubgroup
  • Graph
  • DiscreteQuotient
  • TopHom
  • BotHom
  • InfHom
  • BoxIntegral.Prepartition
  • InfTopHom
  • PEquiv
  • CategoryTheory.GrothendieckTopology.Cover
  • Geometry.SimplicialComplex
  • RootedTree.α
  • Module.Baer.ExtensionOf
  • SemilatInfCat.X
  • Subtype
  • Prod
  • OrderDual
  • Set.Elem
  • ULift
  • Lex
  • ContinuousMap
  • WithTop
  • WithBot
  • WithZero
  • OrderHom

How is a type an instance?

Loading the hierarchy index…

Assumed by726

Ancestors9