Theorems · Theorem · combinatorics

Finset.map_truncatedInf

∀ {α : Type u_1} {β : Type u_2} [inst : SemilatticeInf α] [inst_1 : SemilatticeInf β] [inst_2 : BoundedOrder β]
  [inst_3 : DecidableLE β] [inst_4 : DecidableLE α] [inst_5 : BoundedOrder α] (e : α ≃o β) (s : Finset α) (a : α),
  e (s.truncatedInf a) = (Finset.map e.toEmbedding s).truncatedInf (e a)

Defined in

Mathlib.Combinatorics.SetFamily.AhlswedeZhang

Cited by

1 results in Mathlib

Foundations

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

Assumes

SemilatticeInfSemilatticeInfBoundedOrderDecidableLEDecidableLEBoundedOrder