Mathlib Map

Theorems · Theorem · order theory

iInf_iSup_eq_of_finite

∀ {α : Type u} {ι : Sort v} {κ : ι → Sort w} [inst : Order.Frame α] [Finite ι] {f : (a : ι) → κ a → α},
  ⨅ a, ⨆ b, f a b = ⨆ g, ⨅ a, f a (g a)
Defined in
Mathlib.Data.Set.Finite.Lattice
Cited by
2 results in Mathlib
Foundations
Depth 71 from the axioms · uses propext, Classical.choice, Quot.sound
Assumes
Order.FrameFinite

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

Cites25

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Cited by2

Results whose statement or proof uses this declaration.