Mathlib Map

Theorems · Theorem · order theory

iInf_eq_bot

∀ {α : Type u_1} {ι : Sort u_4} [inst : CompleteLinearOrder α] {f : ι → α}, iInf f = ⊥ ↔ ∀ (b : α), ⊥ < b → ∃ i, f i < b
Defined in
Mathlib.Order.CompleteLattice.Defs
Cited by
5 results in Mathlib
Foundations
Depth 18 from the axioms · uses propext, Classical.choice, Quot.sound
Assumes
CompleteLinearOrder

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.

Cited by5

Results whose statement or proof uses this declaration.