Theorems · Theorem · combinatorics

Finset.truncatedInf_union_left

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

Defined in

Mathlib.Combinatorics.SetFamily.AhlswedeZhang

Cited by

2 results in Mathlib

Foundations

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

Assumes

SemilatticeInfDecidableLEBoundedOrderDecidableEq