Theorems · Theorem · order theory

Finset.inf_insert

∀ {α : Type u_2} {β : Type u_3} [inst : SemilatticeInf α] [inst_1 : OrderTop α] {s : Finset β} {f : β → α}
  [inst_2 : DecidableEq β] {b : β}, (insert b s).inf f = f b ⊓ s.inf f

Defined in

Mathlib.Data.Finset.Lattice.Fold

Cited by

16 results in Mathlib

Foundations

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

Assumes

SemilatticeInfOrderTopDecidableEq