Theorems · Theorem · order theory

ciInf_prod

∀ {α : Type u_1} {β : Type u_2} {γ : Type u_3} [inst : ConditionallyCompleteLattice α] {f : β × γ → α},
  BddBelow (Set.range f) → ⨅ p, f p = ⨅ b, ⨅ c, f (b, c)

Defined in: Mathlib.Order.ConditionallyCompleteLattice.Indexed
Cited by: 0 results in Mathlib
Foundations: Depth 30 from the axioms · uses propext, Classical.choice, Quot.sound
Assumes: ConditionallyCompleteLattice

Mathlib docs Source Loogle LeanSearch

Around this declaration

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

Cites5

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

Set.rangestatement and proof · cited by 4,705
iInfstatement · cited by 1,690
BddBelowstatement and proof · cited by 401
ConditionallyCompleteLatticestatement and proof · cited by 364
ciSup_prodproof · cited by 2

Cited by0

Results whose statement or proof uses this declaration.

Nothing cites this yet.