Theorems · Theorem · combinatorics

Finset.truncatedInf_sups

∀ {α : Type u_1} [inst : DistribLattice α] [inst_1 : DecidableEq α] {s t : Finset α} {a : α} [inst_2 : DecidableLE α]
  [inst_3 : BoundedOrder α],
  a ∈ upperClosure ↑s → a ∈ upperClosure ↑t → (s ⊻ t).truncatedInf a = s.truncatedInf a ⊔ t.truncatedInf a

Defined in

Mathlib.Combinatorics.SetFamily.AhlswedeZhang

Cited by

1 results in Mathlib

Foundations

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

Assumes

DistribLatticeDecidableEqDecidableLEBoundedOrder