Theorems · Definition · combinatorics

Finset.truncatedInf

{α : Type u_1} → [inst : SemilatticeInf α] → [DecidableLE α] → [BoundedOrder α] → Finset α → α → α

The infimum of the elements of s less than a if there are some, otherwise ⊥.

Defined in

Mathlib.Combinatorics.SetFamily.AhlswedeZhang

Cited by

19 results in Mathlib

Foundations

Depth 63 from the axioms · uses propext, Classical.choice, Quot.sound

Assumes

SemilatticeInfDecidableLEBoundedOrder